An Infinite Antichain of Planar Tanglegrams

Contrary to the expectation arising from the tanglegram Kuratowski theorem of Czabarka et al. (SIAM J. Discrete Math. 31(3), 1732–1750, 2017), we construct an infinite antichain of planar tanglegrams with respect to the induced subtanglegram partial order. R.E. Tarjan, R. Laver, D.A. Spielman and M. Bóna, and possibly others, showed that the partially ordered set of finite permutations ordered by deletion of entries contains an infinite antichain, i.e., there exists an infinite collection of permutations, such that none of them contains another as a pattern. Our construction adds a twist to the construction of Spielman and Bóna (Electr. J. Comb. 7, N2, 2000).

     

Weighted Counting of Inversions on Alternating Sign Matrices

We generalize the author’s formula (2011) on weighted counting of inversions on permutations to one on alternating sign matrices. The proof is based on the sequential construction of alternating sign matrices from the unit matrix which essentially follows from the earlier work of Lascoux-Schützenberger (1996).

     

New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization

In this paper, two new subspace minimization conjugate gradient methods based on p-regularization models are proposed, where a special scaled norm in p-regularization model is analyzed. Different choices of special scaled norm lead to different solutions to the p-regularized subproblem. Based on the analyses of the solutions in a two-dimensional subspace, we derive new directions satisfying the sufficient descent condition. With a modified nonmonotone line search, we establish the global convergence of the proposed methods under mild assumptions. R-linear convergence of the proposed methods is also analyzed. Numerical results show that, for the CUTEr library, the proposed methods are superior to four conjugate gradient methods, which were proposed by Hager and Zhang (SIAM J. Optim. 16(1):170–192, 2005), Dai and Kou (SIAM J. Optim. 23(1):296–320, 2013), Liu and Liu (J. Optim. Theory. Appl. 180(3):879–906, 2019) and Li et al. (Comput. Appl. Math. 38(1):2019), respectively.

     

AM-Totally Boundedness on Normed Riesz Spaces

In this paper we introduce and study the class of AM-totally bounded operators. Also we introduce the notion of graph lattice norm to prove a domination result for this class of operators. In particular, we extend the main theorem of Aqzzouz et al. [8]. Further, we give new results concerning the power domination problem by a totally bounded operator.

     

Cohen positive strongly p-summing and p-convex multilinear operators

The aim of this work is to give and study the notion of Cohen positive p-summing multilinear operators. We prove a natural analog of the Pietsch domination theorem for these classes and characterize their conjugates. As an application, we generalize a result due to Bu and Shi (J. Math. Anal. Appl. 401:174–181, 2013), and we compare this class with the class of multiple p-convex m-linear operators.

     

On the Convergence Complexity of Gibbs Samplers for a Family of Simple Bayesian Random Effects Models

The emergence of big data has led to so-called convergence complexity analysis, which is the study of how Markov chain Monte Carlo (MCMC) algorithms behave as the sample size, n, and/or the number of parameters, p, in the underlying data set increase. This type of analysis is often quite challenging, in part because existing results for fixed n and p are simply not sharp enough to yield good asymptotic results. One of the first convergence complexity results for an MCMC algorithm on a continuous state space is due to Yang and Rosenthal (2019), who established a mixing time result for a Gibbs sampler (for a simple Bayesian random effects model) that was introduced and studied by Rosenthal (Stat Comput 6:269–275, 1996). The asymptotic behavior of the spectral gap of this Gibbs sampler is, however, still unknown. We use a recently developed simulation technique (Qin et al. Electron J Stat 13:1790–1812, 2019) to provide substantial numerical evidence that the gap is bounded away from 0 as n → ∞. We also establish a pair of rigorous convergence complexity results for two different Gibbs samplers associated with a generalization of the random effects model considered by Rosenthal (Stat Comput 6:269–275, 1996). Our results show that, under a strong growth condition, the spectral gaps of these Gibbs samplers converge to 1 as the sample size increases.

     

Existence of Two Non-zero Weak Solutions for a Nonlinear Navier Boundary Value Problem Involving the $p$-Biharmonic

In this paper, we consider a class of non-cooperative elliptic systems of Kirchhoff type involving \(p\)-biharmonic operator and critical growth. With the help of the Limit index theory due to Li (Nonlinear Anal. TMA 30(7):4619–4627, 1997) and the concentration compactness principle, we establish the existence of infinitely many solutions for the problem under the suitable conditions on the nonlinearity.

     

Two Tilts of Higher Spherical Algebras

We introduce and study two exotic families of finite-dimensional algebras over an algebraically closed field. We prove that every such an algebra is derived equivalent to a higher spherical algebra studied by Erdmann and Skowroński (Arch. Math. 114, 25–39, 2020), and hence that it is a tame symmetric periodic algebra of period 4. This together with the results of Erdmann and Skowroński (Algebr. Represent. Theor. 22, 387–406, 2019; Arch. Math. 114, 25–39, 2020) shows that every trivial extension algebra of a tubular algebra of type (2,2,2,2) admits a family of periodic symmetric higher deformations which are tame of non-polynomial growth and have the same Gabriel quiver, answering the question recently raised by Skowroński.

     

Brownian Loops Topology

In the seminal work of Symanzik (1969), Poisson ensembles of Brownian loops were implicitly used. Since the work of Lawler and Werner (Prob. Th. Rel. Fields 128:565–588 2004) on “loop soups”, these ensembles have also been the object of many investigations. The purpose of the present work is to determine the distributions related to their topological properties, using trace formula and zeta regularization. These results have been announced in Le Jan (2016) and Le Jan (2017).

     

Characterizations of risk aversion in cumulative prospect theory

In this paper, we investigate the necessary and sufficient conditions for a decision maker to be monotone risk averse and left-monotone risk averse, respectively, in cumulative prospect theory (CPT). Our results show that the decision maker is more pessimistic than greedy if she is either monotone or left-monotone risk averse, which is similar to that of Chateauneuf et al. (Econ Theory 25(3):649–667, 2005) in the rank-dependent expected utility model. Detailed examples are presented to illustrate the main theorems. With this work, we make a progress in the characterizations of risk aversion in CPT, which is essential in understanding the features of CPT and its applications in finance and insurance.

     

An observation concerning the vanishing topology of certain isolated determinantal singularities

We extend the results about the vanishing topology of isolated Cohen–Macaulay codimension 2 singularities from a previous article by Frühbis-Krüger and Zach (On the vanishing topology of isolated Cohen–Macaulay codimension 2 singularities. arXiv:1501.01915, 2015). Due to the Hilbert–Burch theorem, these singularities have a canonical determinantal structure and a well behaved deformation theory, which, in particular, yields a unique Milnor fiber. Studying the case of possibly non-isolated singularities in the Tjurina transform, as introduced in Frühbis-Krüger and Zach (2015), we reveal that in dimension 3 and 2 there is always exactly one special vanishing cycle in degree 2 closely related to the determinantal structure of the singularity.

     

A coarsening algorithm on adaptive red-green-blue refined meshes

Adaptive meshing is a fundamental component of adaptive finite element methods. This includes refining and coarsening meshes locally. In this work, we are concerned with the red-green-blue refinement strategy in two dimensions and its counterpart-coarsening. In general, coarsening algorithms are mostly based on an explicitly given refinement history. In this work, we present a coarsening algorithm on adaptive red-green-blue meshes in two dimensions without explicitly knowing the refinement history. To this end, we examine the local structure of these meshes, find an easy-to-verify criterion to adaptively coarsen red-green-blue meshes, and prove that this criterion generates meshes with the desired properties. We present a MATLAB implementation built on the red-green-blue refinement routine of the ameshref-package (Funken and Schmidt 2018, 2019).

     

Uniform in Time $L^{\infty }$ -Estimates for Nonlinear Aggregation-Diffusion Equations

In this paper, we consider the general reaction–diffusion system proposed in Abdelmalek and Bendoukha (Nonlinear Anal., Real World Appl. 35:397–413, 2017) as a generalization of the original Lengyel–Epstein model developed for the revolutionary Turing-type CIMA reaction. We establish sufficient conditions for the global existence of solutions. We also follow the footsteps of Lisena (Appl. Math. Comput. 249:67–75, 2014) and other similar studies to extend previous results regarding the local and global asymptotic stability of the system. In the local PDE sense, more relaxed conditions are achieved compared to Abdelmalek and Bendoukha (Nonlinear Anal., Real World Appl. 35:397–413, 2017). Also, new extended results are achieved for the global existence, which when applied to the Lengyel–Epstein system, provide weaker conditions than those of Lisena (Appl. Math. Comput. 249:67–75, 2014). Numerical examples are used to affirm the findings and benchmark them against previous results.

     

Properization: constructing proper scoring rules via Bayes acts

Scoring rules serve to quantify predictive performance. A scoring rule is proper if truth telling is an optimal strategy in expectation. Subject to customary regularity conditions, every scoring rule can be made proper, by applying a special case of the Bayes act construction studied by Grünwald and Dawid (Ann Stat 32:1367–1433, 2004) and Dawid (Ann Inst Stat Math 59:77–93, 2007), to which we refer as properization. We discuss examples from the recent literature and apply the construction to create new types, and reinterpret existing forms, of proper scoring rules and consistent scoring functions. In an abstract setting, we formulate sufficient conditions under which Bayes acts exist and scoring rules can be made proper.

     

Global Weak Solutions for the Cauchy Problem to One-Dimensional Heat-Conductive MHD Equations of Viscous Non-resistive Gas

We investigate the dynamics of the Vlasov-Poisson system in the presence of radiation damping. A propagation result for velocity moments of order \(k>3\) is established in (Kunze and Rendall in Ann. Henri Poincaré 2:857–886, 2001). In this paper, we prove existence of global solutions propagating velocity and velocity-spatial moments of order \(k>2\) and establish an explicit polynomially growing in time bound on the moments.

     

Characterizing bounded orthogonally additive polynomials on vector lattices

We derive formulas for characterizing bounded orthogonally additive polynomials in two ways. Firstly, we prove that certain formulas for orthogonally additive polynomials derived in Kusraeva (Vladikavkaz Math J 16(4):49–53, 2014) actually characterize them. Secondly, by employing complexifications of the unique symmetric multilinear maps associated with orthogonally additive polynomials, we derive new characterizing formulas.

     

A Level-1 Limit Order Book with Time Dependent Arrival Rates

We propose a simple stochastic model for the dynamics of a limit order book, extending the recent work of Cont and de Larrard (SIAM J Financial Math 4(1), 1–25 2013), where the price dynamics are endogenous, resulting from market transactions. We also show that the conditional diffusion limit of the price process is the so-called Brownian meander.

     

Approximation of Sojourn Times of Gaussian Processes

We investigate the tail asymptotic behavior of the sojourn time for a large class of centered Gaussian processes X, in both continuous- and discrete-time framework. All results obtained here are new for the discrete-time case. In the continuous-time case, we complement the investigations of Berman (Commun Pure Appl Math 38(5):519–528, 1985a and Probab Theory Relat Fields 20(1):113–124, 1987) for non-stationary X. A by-product of our investigation is a new representation of Pickands constant which is important for Monte-Carlo simulations and yields a sharp lower bound for Pickands constant.

     

Modelling competitive interactions and plant–soil feedback in vegetation dynamics

Plant–soil feedback is recognized as a causal mechanism for the emergence of vegetation patterns of the same species especially when water is not a limiting resource (e.g. humid environments) (Cartenì et al. in J Theor Biol 313:153–161, 2012. https://doi.org/10.1016/j.jtbi.2012.08.008; Marasco et al. in Bull Math Biol 76(11):2866–2883, 2014. https://doi.org/10.1007/s11538-014-0036-6). Nevertheless, in the field, plants rarely grow in monoculture but compete with other plant species. In these cases, plant–soil feedback was shown to play a key role in plant-species coexistence (Mazzoleni et al. in Ecol Model 221(23):2784–2792, 2010. https://doi.org/10.1016/j.ecolmodel.2010.08.007). Using a mathematical model consisting of four PDEs, we investigate mechanisms of inter- and intra-specific plant–soil feedback on the coexistence of two competing plant species. In particular, the model takes into account both negative and positive feedback influencing the growth of the same and the other plant species. Both the coexistence of the plant species and the dominance of a particular plant species is examined with respect to all model parameters together with the emergence of spatio-temporal vegetation patterns.