Related papers: Asymptotics of Pattern Avoidance in the Permutatio…

Jel\'inek, Mansour, and Shattuck studied Wilf-equivalence among pairs of patterns of the form $\{\sigma,\tau\}$ where $\sigma$ is a set partition of size $3$ with at least two blocks. They obtained an upper bound for the number of…

We establish formulae for the asymptotic growth (with respect to the scaling dimension) of the number of operators in effective field theory, or equivalently the number of $S$-matrix elements, in arbitrary spacetime dimensions and with…

The results in this paper provide new information on asymptotic properties of classical models: the neutral Kingman coalescent under a general finite-alleles, parent-dependent mutation mechanism, and its generalisation, the ancestral…

Let $k, t$ be coprime integers, and let $1 \leq r \leq t$. We let $D_k^\times(r,t;n)$ denote the total number of parts among all $k$-indivisible partitions (i.e., those partitions where no part is divisible by $k$) of $n$ which are…

We show that permutations of size $n$ avoiding both of the dashed patterns 32-41 and 41-32 are equinumerous with indecomposable set partitions of size $n+1$, and deduce a related result.

We introduce a complex-plane generalization of the consecutive level-spacing distribution, used to distinguish regular from chaotic quantum spectra. Our approach features the distribution of complex-valued ratios between nearest- and…

Asymptotic formulas of the number of various partitions are studied, like 3-colored partitions, concave partitions, certain plane partitions, partitions without small parts, the number of p-rings.

In a recent paper, Bacher and de la Harpe study the conjugacy growth series of finitary permutation groups. In the course of studying the coefficients of a series related to the finitary alternating group, they introduce generalized…

Assuming that a plane partition of the positive integer $n$ is chosen uniformly at random from the set of all such partitions, we propose a general asymptotic scheme for the computation of expectations of various plane partition statistics…

In 2019, B\'ona and Smith introduced the notion of strong pattern avoidance, saying that a permutation $\pi$ strongly avoids a pattern $\sigma$ if $\pi$ and $\pi^2$ both avoid $\sigma$. Recently, Archer and Geary generalized the idea of…

Not long ago, Claesson and Mansour proposed some conjectures about the enumeration of the permutations avoiding more than three Babson - Steingr\'\i msson patterns (generalized patterns of type $(1,2)$ or $(2,1)$). The avoidance of one, two…

Babson and Steingr\'{\i}msson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We consider n-permutations that avoid the generalized pattern…

We initiate an in-depth study of pattern avoidance on modified ascent sequences. Our main technique consists in using Stanley's standardization to obtain a transport theorem between primitive modified ascent sequences and permutations…

We initiate a probabilistic study of forward stability for products of Schubert polynomials through the record statistic (left-to-right maxima) of permutations. Building on the explicit record formula for forward stability obtained by Hardt…

We study Mallows random permutations conditioned to avoid a given pattern $\alpha$ of length~$3$. When the bias parameter is of the form $e^{\beta/n}$, we prove that these permutations converge to a non-trivial explicit deterministic…

We study the relationship between two notions of pattern avoidance for involutions in the symmetric group and their restriction to fixed-point-free involutions. The first is classical, while the second appears in the geometry of certain…

We carry out the asymptotic analysis of repulsive ensembles of N particles which are discrete analogues of continuous 1d log-gases or beta-ensembles of random matrix theory. The ensembles that we study have several groups of particles which…

We establish finiteness of low-dimensional actions of lattices in higher-rank semisimple Lie groups and establish Zimmer's conjecture for many such groups. This builds on previous work of the authors handling the case of actions by…

In [BabStein] Babson and Steingr\'{\i}msson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. In [Kit1] Kitaev considered simultaneous…

We examine historic formulations of the spin-statistics theorem from a point of view that distinguishes between the observable consequences and the ``symmetrization postulate''. In particular, we make a critical analysis of concepts of…