Partially ordered patterns (POPs) play an important role in the study of permutation patterns, providing a convenient framework for describing large families of classical patterns. The problem of enumerating permutations that avoid POPs has therefore attracted considerable attention in the literature. In particular, Gao and Kitaev resolved many counting problems for POP-avoiding permutations of lengths 4 and 5, linking the enumeration to a wide range of other combinatorial objects.
Motivated by their work, we initiate the study of permutations that simultaneously avoid two POPs belonging to the class of flat POPs. We establish a connection between permutations avoiding such POPs and the $k$-Fibonacci numbers. Moreover, we provide a bijection between permutations avoiding these POPs and certain restricted permutations, which allows us to use the method developed by Baltić to derive the generating function for permutations avoiding these POPs. Finally, we obtain enumerative results for separable permutations avoiding these two POPs, of lengths up to 5, with respect to six statistics, thereby extending the results of Gao et al. on the avoidance of a single flat POP in separable permutations. Notably, when both patterns are of length 5, the respective generating function is a rational function, with the sum in the numerator (resp., denominator) containing 293 (resp., 17) monomials.
We investigate the notion of almost avoiding a permutation: $π$ almost avoids $β$ if one can remove a single entry from $π$ to obtain a $β$-avoiding permutation.
We define a bijection between triangulations of a convex polygon and $312$-avoiding permutations through the process of "ear-clipping". This bijection is then used to obtain a bijection between polygon dissections and a certain class of $312$-avoiding permutations.
The diagram of a 132-avoiding permutation can easily be characterized: it is simply the diagram of a partition. Based on this fact, we present a new bijection between 132-avoiding and 321-avoiding permutations. We will show that this bijection translates the correspondences between these permutations and Dyck paths given by Krattenthaler and by Billey-Jockusch-Stanley, respectively, to each other. Moreover, the diagram approach yields simple proofs for some enumerative results concerning forbidden patterns in 132-avoiding permutations.
We provide a simple injective proof that the number of 132-avoiding permutations with a unique longest increasing subsequence is at least as large as the number of 132-avoiding permutations without a unique longest increasing subsequence.
We study the problem of counting alternating permutations avoiding collections of permutation patterns including 132. We construct a bijection between the set S_n(132) of 132-avoiding permutations and the set A_{2n + 1}(132) of alternating, 132-avoiding permutations. For every set p_1, ..., p_k of patterns and certain related patterns q_1, ..., q_k, our bijection restricts to a bijection between S_n(132, p_1, ..., p_k), the set of permutations avoiding 132 and the p_i, and A_{2n + 1}(132, q_1, ..., q_k), the set of alternating permutations avoiding 132 and the q_i. This reduces the enumeration…
We modify the enumeration schemes of Zeilberger and Vatter so that they can efficiently enumerate many new classes of pattern-avoiding permutations including all such classes with a regular insertion encoding.
We enumerate the pattern class Av(2143,4231) and completely describe its permutations. The main tools are simple permutations and monotone grid classes.
We answer a question of R. J. Mathar and confirm that the counting sequence for $\bar{2}413\bar{5}$-avoiding permutations is the Invert transform of the Bell numbers. The proof relies on a simple decomposition of these permutations and the known fact that $\bar{2}413$-avoiding permutations are counted by the Bell numbers.
We show a $n^2 \cdot 2^{n/2}$ upper bound on the number of $(132,213)$ avoiding cyclic permutations. This is the first nontrivial upper bound on the number of such permutations. We also construct an algorithm to determine whether a $(132,213)$ avoiding permutation is cyclic that references only the permutation's layer lengths.
We enumerate permutations that avoid all but one of the $k$ patterns of length $k$ starting with a monotone increasing subsequence of length $k-1$. We compare the size of such permutation classes to the size of the class of permutations avoiding the monotone increasing subsequence of length $k-1$.
A permutation is (1-23-4)-avoiding if it contains no four entries, increasing left to right, with the middle two adjacent in the permutation. Here we give a 2-variable recurrence for the number of such permutations, improving on the previously known 4-variable recurrence. At the heart of the proof is a bijection from (1-23-4)-avoiding permutations to increasing ordered trees whose leaves, taken in preorder, are also increasing.
We construct a sequence of finite automata that accept subclasses of the class of 4231-avoiding permutations. We thereby show that the Wilf-Stanley limit for the class of 4231-avoiding permutations is bounded below by 9.35. This bound shows that this class has the largest such limit among all classes of permutations avoiding a single permutation of length 4 and refutes the conjecture that the Wilf-Stanley limit of a class of permutations avoiding a single permutation of length k cannot exceed (k-1)^2.
We construct a bijection between 231-avoiding permutations and Dyck paths that sends the sum of the major index and the inverse major index of a 231-avoiding permutation to the major index of the corresponding Dyck path. Furthermore, we relate this bijection to others and exhibit a bistatistic on 231-avoiding permutations which is related to the q,t-Catalan numbers.
We study generating functions for the number of permutations on n letters avoiding 132 and an arbitrary permutation $τ$ on k letters, or containing $τ$ exactly once. In several interesting cases the generating function depends only on k and is expressed via Chebyshev polynomials of the second kind.
We present some combinatorial interpretations for coefficients appearing in series partitioning the permutations avoiding 132 along marked mesh patterns. We identify for patterns in which only one parameter is non zero the combinatorial family in bijection with 132-avoiding permutations and also preserving the statistic counted by the marked mesh pattern.
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 consider the distribution of ascents, descents, peaks, valleys, double ascents, and double descents over permutations avoiding a set of patterns. Many of these statistics have already been studied over sets of permutations avoiding a single pattern of length 3. However, the distribution of peaks over 321-avoiding permutations is new and we relate it statistics on Dyck paths. We also obtain new interpretations of a number of well-known combinatorial sequences by studying these statistics over permutations avoiding two patterns of length 3.
Permutations avoiding all patterns of a given shape (in the sense of Robinson-Schensted-Knuth) are considered. We show that the shapes of all such permutations are contained in a suitable thick hook, and deduce an exponential growth rate for their number.
We exploit Krattenthaler's bijection between 123-avoiding permutations and Dyck paths to determine the Eulerian distribution over the set $S_n(123)$ of 123-avoiding permutations in $S_n$. In particular, we show that the descents of a permutation correspond to valleys and triple falls of the associated Dyck path. We get the Eulerian numbers of $S_n(123)$ by studying the joint distribution of these two statistics on Dyck paths.
We give some interpretations to certain integer sequences in terms of parameters on Grand-Dyck paths and coloured noncrossing partitions, and we find some new bijections relating Grand-Dyck paths and signed pattern avoiding permutations. Next we transfer a natural distributive lattice structure on Grand-Dyck paths to coloured noncrossing partitions and signed pattern avoiding permutations, thus showing, in particular, that it is isomorphic to the structure induced by the (strong) Bruhat order on a certain set of signed pattern avoiding permutations.
We find the generating function for the class of all permutations that avoid the patterns 3124 and 4312 by showing that it is an inflation of the union of two geometric grid classes.
Pattern avoiding machines were recently introduced by Claesson, Ferrari and the current author to gain a better understanding of the classical $2$-stacksort problem. In this paper we generalize these devices by allowing permutations with repeated elements, also known as Cayley permutations. The main result is a description of those patterns such that the corresponding set of sortable permutations is a class. We also show a new involution on the set of Cayley permutations, obtained by regarding a pattern-avoiding stack as an operator. Finally, we analyze two generalizations of pop-stack sorting…
Babson and Steingrìmsson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Subsequently, Claesson presented a complete solution for the number of permutations avoiding any single pattern of type (1,2) or (2,1). For eight of these twelve patterns the answer is given by the Bell numbers. For the remaining four the answer is given by the Catalan numbers. In the present paper we give a complete solution for the number of permutations avoiding a pair of patterns of type (1,2) or (2,1). We also conjectur…
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 adjacent in an occurrence of the pattern in the permutation, and consecutive patterns are a particular case of them. We determine the asymptotic behavior of the number of permutations avoiding a consecutive pattern, showing that they are an exponentially small proportion of the total number of permutations. For some other generalized patterns we give partial resu…
This paper is continuation of the study of the 1-box pattern in permutations introduced by the authors in \cite{kitrem4}. We derive a two-variable generating function for the distribution of this pattern on 132-avoiding permutations, and then study some of its coefficients providing a link to the Fibonacci numbers. We also find the number of separable permutations with two and three occurrences of the 1-box pattern.
The simple permutations in two permutation classes --- the 321-avoiding permutations and the skew-merged permutations --- are enumerated using a uniform method. In both cases, these enumerations were known implicitly, by working backwards from the enumeration of the class, but the simple permutations had not been enumerated explicitly. In particular, the enumeration of the simple skew-merged permutations leads to the first truly structural enumeration of this class as a whole. The extension of this method to a wider collection of classes namely grid classes of infinite paths is discussed.
Comtet introduced the notion of indecomposable permutations in 1972. A permutation is indecomposable if and only if it has no proper prefix which is itself a permutation. Indecomposable permutations were studied in the literature in various contexts. In particular, this notion has been proven to be useful in obtaining non-trivial enumeration and equidistribution results on permutations. In this paper, we give a complete classification of indecomposable permutations avoiding a classical pattern of length 3 or 4, and of indecomposable permutations avoiding a non-consecutive vincular pattern of l…
In a previous paper, we showed that $3\bar{5}241$-avoiding permutations are counted by the unique sequence that starts with a 1 and shifts left under the self-composition transform. The proof uses a complicated bijection. Here we give a much simpler proof based on Lagrange inversion.
We define a map $ν$ between the symmetric group $S_n$ and the set of pairs of Dyck paths of semilength $n$. We show that the map $ν$ is injective when restricted to the set of 1234-avoiding permutations and characterize the image of this map.
In the last decade a huge amount of articles has been published studying pattern avoidance on permutations. From the point of view of enumeration, typically one tries to count permutations avoiding certain patterns according to their lengths. Here we tackle the problem of refining this enumeration by considering the statistics "first/last entry". We give complete results for every generalized patterns of type $(1,2)$ or $(2,1)$ as well as for some cases of permutations avoiding a pair of generalized patterns of the above types.
We introduce a new method for encoding permutations as weighted independent sets in a family of graphs we call cores. The encoding allows us to enumerate (1324, 2143)-, (1234, 1324, 2143)-, (1234, 1324, 1432, 3214)-avoiding permutations with respect to their number of "boundary points" and the size of the independent set in the graph they correspond to.
We give a natural definition of rowmotion for $321$-avoiding permutations, by translating, through bijections involving Dyck paths and the Lalanne--Kreweras involution, the analogous notion for antichains of the positive root poset of type $A$. We prove that some permutation statistics, such as the number of fixed points, are homomesic under rowmotion, meaning that they have a constant average over its orbits. Our setting also provides a more natural description of the celebrated Armstrong--Stump--Thomas equivariant bijection between antichains and non-crossing matchings in types $A$ and $B$, …
This addendum contains results about the inversion number and major index polynomials for permutations avoiding 321 which did not fit well into the original paper. In particular, we consider symmetry, unimodality, behavior modulo 2, and signed enumeration.
In this paper we calculate the cardinality of the set S_n(T,tau) of all permutations in S_n that avoid one pattern from S_4 and a nonempty set of patterns from S_3.
We prove a generalization of a conjecture of Dokos, Dwyer, Johnson, Sagan, and Selsor giving a recursion for the inversion polynomial of 321-avoiding permutations. We also answer a question they posed about finding a recursive formulas for the major index polynomial of 321-avoiding permutations. Other properties of these polynomials are investigated as well. Our tools include Dyck and 2-Motzkin paths, polyominoes, and continued fractions.
A stabilized-interval-free (SIF) permutation on [n]={1,2,...,n} is one that does not stabilize any proper subinterval of [n]. By presenting a decomposition of an arbitrary permutation into a list of SIF permutations, we show that the generating function A(x) for SIF permutations satisfies the defining property: [x^(n-1)] A(x)^n = n! . We also give an efficient recurrence for counting SIF permutations.
A centrosymmetric permutation is one which is invariant under the reverse-complement operation, or equivalently one whose associated standard Young tableaux under the Robinson-Schensted algorithm are both invariant under the Schutzenberger involution. In this paper, we characterize the set of permutations avoiding 1243 and 2143 whose images under the reverse-complement mapping also avoid these patterns. We also characterize in a simple manner the corresponding Schroder paths under a bijection of Egge and Mansour. We then use these results to enumerate centrosymmetric permutations avoiding the …
Not long ago, Claesson and Mansour proposed some conjectures about the enumeration of the permutations avoiding more than three Babson - Steingr\'ımsson patterns (generalized patterns of type $(1,2)$ or $(2,1)$). The avoidance of one, two or three patterns has already been considered. Here, the cases of four and five forbidden patterns are solved and the exact enumeration of the permutations avoiding them is given, confirming the conjectures of Claesson and Mansour. The approach we use can be easily extended to the cases of more than five forbidden patterns.
We complete the enumeration of Dumont permutations of the second kind avoiding a pattern of length 4 which is itself a Dumont permutation of the second kind. We also consider some combinatorial statistics on Dumont permutations avoiding certain patterns of length 3 and 4 and give a natural bijection between 3142-avoiding Dumont permutations of the second kind and noncrossing partitions that uses cycle decomposition, as well as bijections between 132-, 231- and 321-avoiding Dumont permutations and Dyck paths. Finally, we enumerate Dumont permutations of the first kind simultaneously avoiding ce…
A permutation $σ\in\mathfrak{S}_n$ is simsun if for all $k$, the subword of $σ$ restricted to $\{1,...,k\}$ does not have three consecutive decreasing elements. The permutation $σ$ is double simsun if both $σ$ and $σ^{-1}$ are simsun. In this paper we present a new bijection between simsun permutations and increasing 1-2 trees, and show a number of interesting consequences of this bijection in the enumeration of pattern-avoiding simsun and double simsun permutations. We also enumerate the double simsun permutations that avoid each pattern of length three.
Numerical evidence suggests that certain permutation patterns of length k are easier to avoid than any other patterns of that same length. We prove that these patterns are avoided by no more than (2.25k^2)^n permutations of length n. In light of this, we conjecture that no pattern of length k is avoided by more than that many permutations of length n.
We prove that the number of permutations which avoid 132-patterns and have exactly one 123-pattern equals (n-2)2^(n-3). We then give a bijection onto the set of permutations which avoid 123-patterns and have exactly one 132-pattern. Finally, we show that the number of permutations which contain exactly one 123-pattern and exactly one 132-pattern is (n-3)(n-4)2^(n-5).
We consider the distribution of the length of the longest subsequence avoiding a given pattern in a random permutation of length n. The well-studied case of a longest increasing subsequence corresponds to avoiding the pattern 21. We show that there is some constant c such that the mean value of this length is asymptotic to twice the square root of c times n and that the distribution of the length is tightly concentrated around its mean. We observe some apparent connections between c and the Stanley-Wilf limit of the class of permutations avoiding the given pattern.
We introduce a new concept of permutation avoidance pattern called hatted pattern, which is a natural generalization of the barred pattern. We show the growth rate of the class of permutations avoiding a hatted pattern in comparison to barred pattern. We prove that Dyck paths with no peak at height $p$, Dyck paths with no $ud... du$ and Motzkin paths are counted by hatted pattern avoiding permutations in $\s_n(132)$ by showing explicit bijections. As a result, a new direct bijection between Motzkin paths and permutations in $\s_n(132)$ without two consecutive adjacent numbers is given. These p…
Define $S_n^k(T)$ to be the set of permutations of $\{1,2,...,n\}$ with exactly $k$ fixed points which avoid all patterns in $T \subseteq S_m$. We enumerate $S_n^k(T)$, $T \subseteq S_3$, for all $|T| \geq 2$ and $0 \leq k \leq n$.
In 1990 West conjectured that there are $2(3n)!/((n+1)!(2n+1)!)$ two-stack sortable permutations on $n$ letters. This conjecture was proved analytically by Zeilberger in 1992. Later, Dulucq, Gire, and Guibert gave a combinatorial proof of this conjecture. In the present paper we study generating functions for the number of two-stack sortable permutations on $n$ letters avoiding (or containing exactly once) 132 and avoiding (or containing exactly once) an arbitrary permutation $τ$ on $k$ letters. In several interesting cases this generating function can be expressed in terms of the generating f…
