Related papers: Asymptotics of Pattern Avoidance in the Permutatio…

We determine a set of permutation patterns $q$ so that the number of permutations with $r$ occurrences of $q$ is asymptotically $n^r$ times the number of permutations avoiding $q$, partially settling a conjecture of Conway and Guttman. We…

Aldous' spectral gap conjecture, proven by Caputo, Liggett and Richthammer, states the following: for any set of transpositions in the symmetric group $\mathrm{Sym}(n)$, the spectral gap of the corresponding random walk on the group -- an…

We show that for any permutation $\pi$ there exists an integer $k_{\pi}$ such that every permutation avoiding $\pi$ as a pattern is a product of at most $k_{\pi}$ separable permutations. In other words, every strict class $\mathcal C$ of…

Strassen's asymptotic rank conjecture [Progr. Math. 120 (1994)] claims a strong submultiplicative upper bound on the rank of a three-tensor obtained as an iterated Kronecker product of a constant-size base tensor. The conjecture, if true,…

We use various combinatorial and probabilistic techniques to study growth rates for the probability that a random permutation from the Mallows distribution avoids consecutive patterns. The Mallows distribution behaves like a $q$-analogue of…

A permutation $\pi$ strongly avoids the pattern $\tau$ if both $\pi$ and $\pi^2$ avoid $\tau$. In this paper, we enumerate permutations of size $n$ that strongly avoid the pattern 132. This enumeration allows us to prove a conjecture that…

Let $i(n,k)$ be the proportion of permutations $\pi\in\mathcal{S}_n$ having an invariant set of size $k$. In this note we adapt arguments of the second author to prove that $i(n,k) \asymp k^{-\delta} (1+\log k)^{-3/2}$ uniformly for $1\leq…

We prove that the number of permutations avoiding an arbitrary consecutive pattern of length m is asymptotically largest when the avoided pattern is 12...m, and smallest when the avoided pattern is 12...(m-2)m(m-1). This settles a…

Datasets from the fields of bioinformatics, chemometrics, and face recognition are typically characterized by small samples of high-dimensional data. Among the many variants of linear discriminant analysis that have been proposed in order…

For integers $k,t \geq 2$, and $1\leq r \leq t$ let $D_k^\times(r,t;n)$ be the number of parts among all $k$-indivisible partitions of $n$ (i.e., partitions where all parts are not divisible by $k$) of $n$ that are congruent to $r$ modulo…

Building off recent work of Garg and Peng, we continue the investigation into classical and consecutive pattern avoidance in rooted forests. We prove a forest analogue of the Stanley-Wilf conjecture for avoiding a single pattern as well as…

We extend the notion of consecutive pattern avoidance to considering sums over all permutations where each term is a product of weights depending on each consecutive pattern of a fixed length. We study the problem of finding the asymptotics…

After fixing a canonical ordering (or labeling) of the elements of a finite poset, one can associate each linear extension of the poset with a permutation. Some recent papers consider specific families of posets and ask how many linear…

The main theme of this paper is the enumeration of the occurrence of a pattern in words and permutations. We mainly focus on asymptotic properties of the sequence $f_r^v(k,n),$ the number of $n$-array $k$-ary words that contain a given…

We introduce a new boundedness condition for affine permutations, motivated by the fruitful concept of periodic boundary conditions in statistical physics. We study pattern avoidance in bounded affine permutations. In particular, we show…

We consider the problem of detecting the presence of a submatrix with larger-than-usual values in a large data matrix. This problem was considered in (Butucea and Ingster, 2013) under a one-parameter exponential family, and one of the test…

The number of 123-avoiding permutation on $\{1,2,\ldots,n\}$ with a fixed leading terms is counted by the ballot numbers. The same holds for $132$-avoiding permutations. These results were proved by Miner and Pak using the…

Two asymptotic configurations on a full $\mathbb{Z}^d$-shift are indistinguishable if for every finite pattern the associated sets of occurrences in each configuration coincide up to a finitely supported permutation of $\mathbb{Z}^d$. We…

Let $\pi \in \mathfrak{S}_m$ and $\sigma \in \mathfrak{S}_n$ be permutations. An occurrence of $\pi$ in $\sigma$ as a consecutive pattern is a subsequence $\sigma_i \sigma_{i+1} \cdots \sigma_{i+m-1}$ of $\sigma$ with the same order…

This paper presents a collection of experimental results regarding permutation pattern avoidance, focusing on cases where there are "many" patterns to be avoided.