Related papers: Stanley-Wilf limits are typically exponential

We present a class of permutations for which the number of distinctly ordered subsequences of each permutation approaches an almost optimal value as the length of the permutation grows to infinity.

A permutation $\pi \in \mathbb{S}_n$ is $k$-balanced if every permutation of order $k$ occurs in $\pi$ equally often, through order-isomorphism. In this paper, we explicitly construct $k$-balanced permutations for $k \le 3$, and every $n$…

Consider an irreducible, admissible representation $\pi$ of GL(2,$F$) whose restriction to GL(2,$F)^+$ breaks up as a sum of two irreducible representations $\pi_+ + \pi_-$. If $\pi=r_{\theta}$, the Weil representation of GL(2,$F$) attached…

Let $G$ be a graph on $n$ vertices, labeled $v_1,\ldots,v_n$ and $\pi$ be a permutation on $[n]:=\{1,2,\cdots, n\}$. Suppose that each pebble $p_i$ is placed at vertex $v_{\pi(i)}$ and has destination $v_i$. During each step, a disjoint set…

Generalizing the notion of a vexillary permutation, we introduce a filtration of S_infinity by the number of Schur function terms in the Stanley symmetric function, with the kth filtration level called the k-vexillary permutations. We show…

Let $A(p,n,k)$ be the number of $p$-tuples of commuting permutations of $n$ elements whose permutation action results in exactly $k$ orbits or connected components. We formulate the conjecture that, for every fixed $p$ and $n$, the…

Let $R(n)$ denote the number of rich words of length $n$ over a given finite alphabet. In 2017 it was proved that $\lim_{n\rightarrow\infty} \sqrt[n]{R(n)}=1$; it means the number of rich words has a subexponential growth. However, up to…

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…

Define $S_n^k(\alpha)$ to be the set of permutations of $\{1,2,...,n\}$ with exactly $k$ fixed points which avoid the pattern $\alpha \in S_m$. Let $s_n^k(\alpha)$ be the size of $S_n^k(\alpha)$. We investigate $S_n^0(\alpha)$ for all…

Given a countable set X (usually taken to be the natural numbers or integers), an infinite permutation, \pi, of X is a linear ordering of X. This paper investigates the combinatorial complexity of infinite permutations on the natural…

A permutation p is realized by the shift on N symbols if there is an infinite word on an N-letter alphabet whose successive left shifts by one position are lexicographically in the same relative order as p. The set of realized permutations…

For $\tau\in S_3$, let $\mu_n^{\tau}$ denote the uniformly random probability measure on the set of $\tau$-avoiding permutations in $S_n$. Let $\mathbb{N}^*=\mathbb{N}\cup\{\infty\}$ with an appropriate metric and denote by…

Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. Using an analysis of the probability that two overlapping consecutive $k$-permutations are order isomorphic, the authors of a recent paper showed that the expected number of…

The Mallows measure is a probability measure on $S_n$ where the probability of a permutation $\pi$ is proportional to $q^{l(\pi)}$ with $q > 0$ being a parameter and $l(\pi)$ the number of inversions in $\pi$. We prove a weak law of large…

Let $S_{\rm div}(n)$ denote the set of permutations $\pi$ of $n$ such that for each $1\leq j \leq n$ either $j \mid \pi(j)$ or $\pi(j) \mid j$. These permutations can also be viewed as vertex-disjoint directed cycle covers of the divisor…

The Mallows measure is a probability measure on $S_n$ where the probability of a permutation $\pi$ is proportional to $q^{l(\pi)}$ with $q > 0$ being a parameter and $l(\pi)$ the number of inversions in $\pi$. We show the convergence of the…

A signed permutation \pi = \pi_1\pi_2 \ldots \pi_n in the hyperoctahedral group B_n is a word such that each \pi_i \in {-n, \ldots, -1, 1, \ldots, n} and {|\pi_1|, |\pi_2|, \ldots, |\pi_n|} = {1,2,\ldots,n}. An index i is a peak of \pi if…

Let S_n denote the symmetric group of all permutations of the set {1, 2, ...,n} and let S = \cup_{n\ge0} S_n. If Pi is a set of permutations, then we let Av_n(Pi) be the set of permutations in S_n which avoid every permutation of Pi in the…

Stanley sequences starting from the set $\{0, n\}$ where $n$ is a positive integer have long been conjectured to be divided into two types: the "regular" type where the growth rate is $\Theta(n^{\log_2(3)})$, and the "irregular" type where…

We view the RSK correspondence as associating to each permutation $\pi \in S_n$ a Young diagram $\lambda=\lambda(\pi)$, i.e. a partition of $n$. Suppose now that $\pi$ is left-multiplied by $t$ transpositions, what is the largest number of…