Related papers: Distribution of statistics on separable permutatio…
We initiate the study of limit shapes for random permutations avoiding a given pattern. Specifically, for patterns of length 3, we obtain delicate results on the asymptotics of distributions of positions of numbers in the permutations. We…
The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation through a stack. A formula for the number of permutations of length n that can be sorted by passing it twice…
In this paper, we introduce a context-free grammar $G\colon x \rightarrow xy,\, y \rightarrow zu,\, z \rightarrow zw,\, w \rightarrow xv,\, u \rightarrow xyz^{-1}v,\, v \rightarrow x^{-1}zwu$ over the variable set $V=\{x,y,z,w,u,v\}$. We…
We introduce a new family of noncommutative analogues of the Hall-Littlewood symmetric functions. Our construction relies upon Tevlin's bases and simple q-deformations of the classical combinatorial Hopf algebras. We connect our new…
Defant and Zheng introduced a consecutive-pattern-avoiding stack sort map $SC_{\sigma}$, where the stack must avoid a consecutive pattern $\sigma$. Seidel and Sun disproved a conjecture in Defant and Zheng's paper about the maximum…
A conjecture by Deutsch, Kitaev, and Remmel states that the triples of permutation statistics $(S_{10}, S_{12}, S_{17})$ and $(S_{12}, S_{10} ,S_{17})$ are equidistributed over the symmetric group $\mathfrak{S}_n$. Here, $S_{10}$ enumerates…
Motivated by the recent proof of the Stanley-Wilf conjecture, we study the asymptotic behavior of the number of permutations avoiding a generalized pattern. Generalized patterns allow the requirement that some pairs of letters must be…
Statistics in ranked lists is important in analyzing molecular biology measurement data, such as ChIP-seq, which yields ranked lists of genomic sequences. State of the art methods study fixed motifs in ranked lists. More flexible models…
This article presents a modern deterministic framework for the study of leading significant digit distributions in numerical data. Rather than relying on traditional probabilistic or mixture-based explanations, we demonstrate that the…
A permutation statistic $\operatorname{st}$ is said to be shuffle-compatible if the distribution of $\operatorname{st}$ over the set of shuffles of two disjoint permutations $\pi$ and $\sigma$ depends only on $\operatorname{st}\pi$,…
Given a permutation $\sg = \sg_1...\sg_n$ in the symmetric group $S_n$, we say that $\sg_i$ matches the marked mesh pattern $MMP(a,b,c,d)$ in $\sg$ if there are at least $a$ points to the right of $\sg_i$ in $\sg$ which are greater than…
A set partition avoids a pattern if no subdivision of that partition standardizes to the pattern. There exists a bijection between set partitions and restricted growth functions (RGFs) on which Wachs and White defined four statistics of…
Following some recent works, we investigate the problem of optimising the total population size for logistic diffusive models with respect to resources distributions. Using the spatially heterogeneous Fisher-KPP equation, we obtain a…
Permutations with bounded drop size, which we also call bounded permutations, was introduced by Chung, Claesson, Dukes and Graham. Petersen introduced a new Mahonian statistic the sorting index, which is denoted by $\sor$. Meanwhile, Wilson…
We consider avoidance of permutation patterns with designated gap sizes between pairs of consecutive letters. We call the patterns having such constraints distant patterns (DPs) and we show their relation to other pattern notions…
In this paper we consider the enumeration of ordered set partitions avoiding a permutation pattern of length 2 or 3. We provide an exact enumeration for avoiding the permutation 12. We also give exact enumeration for ordered partitions with…
Extending the notion of pattern avoidance in permutations, we study matchings and set partitions whose arc diagram representation avoids a given configuration of three arcs. These configurations, which generalize 3-crossings and 3-nestings,…
The partially asymmetric exclusion process (PASEP) is an important model from statistical mechanics which describes a system of interacting particles hopping left and right on a one-dimensional lattice of N sites. It is partially asymmetric…
In recent years, there has been increasing interest in consecutive pattern avoidance in permutations. In this paper, we introduce two approaches to counting permutations that avoid a set of prescribed patterns consecutively. These algoritms…
Given a permutation $\sg = \sg_1 \ldots \sg_n$ in the symmetric group $S_n$, we say that $\sg_i$ matches the marked mesh pattern $MMP(a,b,c,d)$ in $\sg$ if there are at least $a$ points to the right of $\sg_i$ in $\sg$ which are greater…