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 results, showing that the number of permutations avoiding them grows faster than for classical patterns but more slowly than for consecutive patterns.
Zeilberger's enumeration schemes can be used to completely automate the enumeration of many permutation classes. We extend his enumeration schemes so that they apply to many more permutation classes and describe the Maple package WILFPLUS, which implements this process. We also compare enumeration schemes to three other systematic enumeration techniques: generating trees, substitution decompositions, and the insertion encoding.
Using the correspondence between a cycle up-down permutation and a pair of matchings, we give a combinatorial proof of the enumeration of alternating permutations according to the given peak set.
Universal cycle for $k$-permutations is a cyclic arrangement in which each $k$-permutation appears exactly once as $k$ consecutive elements. Enumeration problem of universal cycles for $k$-permutations is discussed and one new enumerating method is proposed in this paper. Accurate enumerating formulae are provided when $k=2,3$.
We enumerate the pattern class Av(2143,4231) and completely describe its permutations. The main tools are simple permutations and monotone grid classes.
We consider the enumeration of pattern-avoiding involutions, focusing in particular on sets defined by avoiding a single pattern of length 4. As we demonstrate, the numerical data for these problems demonstrates some surprising behavior. This strange behavior even provides some very unexpected data related to the number of 1324-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.
We consider the question of computing the distribution of a permutation statistics over restricted permutations via enumeration schemes. The restricted permutations are those avoiding sets of vincular patterns (which include both classical and consecutive patterns), and the statistics are described in the number of copies of certain vincular patterns such as the descent statistic and major index. An enumeration scheme is a polynomial-time algorithm (specifically, a system of recurrence relations) to compute the number of permutations avoiding a given set of vincular patterns. Enumeration schem…
We find the generating function for the permutation class $\mathcal{A}'=\text{Av}(52341,53241,52431,35142,42513,351624)$ whose permutations index local complete intersection Schubert varieties. The method we apply is the extension of how Albert and Brignall discover the generating function for $\mathcal{A}=\text{Av}(4231,35142,42513,351624)$ in their paper. This completes the enumerations of all classical permutation classes indexing certain types of Schubert varieties.
A simple permutation is one which maps no proper non-singleton interval onto an interval. We consider the enumeration of simple permutations from several aspects. Our results include a straightforward relationship between the ordinary generating function for simple permutations and that for all permutations, that the coefficients of this series are not P-recursive, an asymptotic expansion for these coefficients, and a number of congruence results.
We enumerate the number of 0/1-matrices avoiding 2x2 submatrices satisfying certain conditions. We also provide corresponding exponential generating functions.
We describe an algorithm, implemented in Python, which can enumerate any permutation class with polynomial enumeration from a structural description of the class. In particular, this allows us to find formulas for the number of permutations of length n which can be obtained by a finite number of block sorting operations (e.g., reversals, block transpositions, cut-and-paste moves).
We initiate a general approach for the fast enumeration of permutations with a prescribed number of occurrences of `forbidden' patterns, that seems to indicate that the enumerating sequence is always P-recursive. We illustrate the method completely in terms of the patterns `abc',`cab' and `abcd'.
A grid class consists of permutations whose pictorial depiction can be partitioned into increasing and decreasing parts as determined by a given matrix. In this paper, we introduce a method for enumerating cyclic permutations in vector grid classes by establishing a bijective relationship with certain necklaces. We use this method to complete the enumeration of cyclic permutations in the length 3 vector grid classes. In addition, we define an analog of Wilf-equivalence between these sets. We conclude by discussing cyclic permutations in alternating grid classes.
The circular descent of a permutation $σ$ is a set $\{σ(i)\mid σ(i)>σ(i+1)\}$. In this paper, we focus on the enumerations of permutations by the circular descent set. Let $cdes_n(S)$ be the number of permutations of length $n$ which have the circular descent set $S$. We derive the explicit formula for $cdes_n(S)$. We describe a class of generating binary trees $T_k $ with weights. We find that the number of permutations in the set $CDES_n(S)$ corresponds to the weights of $T_k$. As a application of the main results in this paper, we also give the enumeration of permutation tableaux according …
A graceful n-permutation is a graceful labeling of an n-vertex path P_n. In this paper we improve the asymptotic lower bound on the number of such permutations from (5/3)^n to 2.37^n. This is a computer-assisted proof based on an effective algorithm that enumerates graceful n-permutations. Our algorithm is also presented in detail.
In this paper, we focus on the enumeration of permutations by number of cyclic occurrence of peaks and valleys. We find several recurrence relations involving the number of permutations with a prescribed number of cyclic peaks, cyclic valleys, fixed points and cycles. Several associated permutation statistics and the corresponding generating functions are also studied. In particular, we establish a connection between cyclic valleys and Pell numbers as well as cyclic peaks and alternating runs.
The method we have applied in "A. Bernini, L. Ferrari, R. Pinzani, Enumerating permutations avoiding three Babson-Steingrimsson patterns, Ann. Comb. 9 (2005), 137--162" to count pattern avoiding permutations is adapted to words. As an application, we enumerate several classes of words simultaneously avoiding two generalized patterns of length 3.
A permutation graph is a graph that can be derived from a permutation, where the vertices correspond to letters of the permutation, and the edges represent inversions. We provide a construction to show that there are infinitely many connected $r$-regular permutation graphs for $r \geq 3$. We prove that all $3$-regular permutation graphs arise from a similar construction. Finally, we enumerate all $3$-regular permutation graphs on $n$ vertices.
In this paper we present an explicit formula for the number of permutations with a given number of alternating descents. Moreover, we study the interlacing property of the real parts of the zeros of the generating polynomials of these numbers.
Let R(n,k) denote the number of permutations of {1,2,...,n} with k alternating runs. We find a grammatical description of the numbers R(n,k) and then present several convolution formulas involving the generating function for the numbers R(n,k). Moreover, we establish a connection between alternating runs and Andre permutations.
In this paper, we count a dual set of Stirling permutations by the number of alternating runs. Properties of the generating functions, including recurrence relations, grammatical interpretations and convolution formulas are studied.
The 321,hexagon-avoiding (321-hex) permutations were introduced and studied by Billey and Warrington in as a class of elements of S_n whose Kazhdan-Lusztig and Poincare polynomials and the singular loci of whose Schubert varieties have certain fairly simple and explicit descriptions. This paper provides a 7-term linear recurrence relation leading to an explicit enumeration of the 321-hex permutations. A complete description of the corresponding generating tree is obtained as a by-product of enumeration techniques used in the paper, including Schensted's 321-subsequences decomposition, a 5-para…
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.
We use the 0-1 tableaux as a tool for enumerating permutations and partitions with restricted minima. The method used is extended for permutation pairs and partition pairs generated by a bipartite 0-1 tableaux.
The circular peak set of a permutation $σ$ is the set $\{σ(i)\mid σ(i-1)<σ(i)>σ(i+1)\}$. In this paper, we focus on the enumeration problems for permutations by circular peak sets. Let $cp_n(S)$ denote the number of the permutations of order $n$ which have the circular peak set $S$. For the case with $|S|=0,1,2$, we derive the explicit formulas for $cp_n(S)$. We also obtain some recurrence relations for the sequence $cp_n(S)$ and give the formula for $cp_n(S)$ in the general case.
We give a generating function for the fully commutative affine permutations enumerated by rank and Coxeter length, extending formulas due to Stembridge and Barcucci--Del Lungo--Pergola--Pinzani. For fixed rank, the length generating functions have coefficients that are periodic with period dividing the rank. In the course of proving these formulas, we obtain results that elucidate the structure of the fully commutative affine permutations.
The notion of (3+1)-avoidance has shown up in many places in enumerative combinatorics. The natural goal of enumeration of all (3+1)-avoiding posets remains open. In this paper, we enumerate graded (3+1)-avoiding posets for both reasonable definitions of the word "graded." Our proof consists of a number of structural theorems followed by some generating function magic. We also provide asymptotics for the growth rate of the number of graded (3 + 1)-avoiding posets.
In this paper, we confirm a conjecture of Laborde-Zubieta on the enumeration of corners in tree-like tableaux. Our proof is based on Aval, Boussicault and Nadeau's bijection between tree-like tableaux and permutation tableaux, and Corteel and Nadeau's bijection between permutation tableaux and permutations. This last bijection sends a corner in permutation tableaux to an ascent followed by a descent in permutations, this enables us to enumerate the number of corners in permutation tableaux, and thus to completely solve L.-Z.'s conjecture. Moreover, we give a bijection between corners and runs …
We consider the problem of enumerating the permutations containing exactly $k$ occurrences of a pattern of length 3. This enumeration has received a lot of interest recently, and there are a lot of known results. This paper presents an alternative approach to the problem, which yields a proof for a formula which so far only was conjectured (by Noonan and Zeilberger). This approach is based on bijections from permutations to certain lattice paths with ``jumps'', which were first considered by Krattenthaler.
In this paper, we start by giving the definitions and basic facts about hyperoctahedral number system. There is a natural correspondence between the integers expressed in the latter and the elements of the hyperoctahedral group when we use the inversion statistic on this group to code the signed permutations. We use this correspondence to define a way with which the signed permutations group can be ordered. With this classification scheme, we can find the r-th signed permutation from a given number r and vice versa without consulting the list in lexicographical order of the elements of the sig…
We show that the reciprocal of a partial sum with 2m terms of the alternating exponential series is the exponential generating function for permutations in which every increasing run has length congruent to 0 or 1 modulo 2m. More generally we study polynomials whose reciprocals are exponential generating functions for permutations whose run lengths are restricted to certain congruence classes, and extend these results to noncommutative symmetric functions that count words with the same restrictions on run lengths.
The maximally clustered permutations are characterized by avoiding the classical permutation patterns 3421, 4312, and 4321. This class contains the freely-braided permutations and the fully-commutative permutations. In this work, we show that the generating functions for certain fully-commutative pattern classes can be transformed to give generating functions for the corresponding freely-braided and maximally clustered pattern classes. Moreover, this transformation of generating functions is rational. As a result, we obtain enumerative formulas for the pattern classes mentioned above as well a…
Vincular and covincular patterns are generalizations of classical patterns allowing restrictions on the indices and values of the occurrences in a permutation. In this paper we study the integer sequences arising as the enumerations of permutations simultaneously avoiding a vincular and a covincular pattern, both of length 3, with at most one restriction. We see familiar sequences, such as the Catalan and Motzkin numbers, but also some previously unknown sequences which have close links to other combinatorial objects such as lattice paths and integer partitions. Where possible we include a gen…
A classical result of Euler states that the tangent numbers are an alternating sum of Eulerian numbers. A dual result of Roselle states that the secant numbers can be obtained by a signed enumeration of derangements. We show that both identities can be refined with the following statistics: the number of crossings in permutations and derangements, and the number of patterns 31-2 in alternating permutations. Using previous results of Corteel, Rubey, Prellberg, and the author, we derive closed formulas for both q-tangent and q-secant numbers. There are two different methods to obtain these formu…
We prove a formula for the number of permutations in $S_n$ such that their first $n-k$ entries are increasing and their longest increasing subsequence has length $n-k$. This formula first appeared as a consequence of character polynomial calculations in recent work of Adriano Garsia and Alain Goupil. We give two `elementary' bijective proofs of this result and of its $q$-analogue, one proof using the RSK correspondence and one only permutations.
This paper completes a project to enumerate permutations avoiding a triple T of 4-letter patterns, in the sense of classical pattern avoidance, for every T. There are 317 symmetry classes of such triples T and previous papers have enumerated avoiders for all but 14 of them. One of these 14 is conjectured not to have an algebraic generating function. Here, we find the generating function for each of the remaining 13, and it is algebraic in each case.
In this paper, we show that both 12312-avoiding partitions and 12321-avoiding partitions of the set $[n+1]$ are in one-to-one correspondence with Schröder paths of semilength $n$ without peaks at even level. As a consequence, the refined enumeration of 12312-avoiding (resp. 12321-avoiding) partitions according to the number of blocks can be reduced to the enumeration of certain Schröder paths according to the number of peaks. Furthermore, we get the enumeration of irreducible 12312-avoiding (resp. 12321-avoiding) partitions, which are closely related to skew Dyck paths.
Several authors have examined connections among restricted permutations, continued fractions, and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for involutions which avoid 3412. Our results include a recursive procedure for computing the generating function for involutions which avoid 3412 and any set of additional patterns. We use our results to give enumerations and generating functions for involutions which avoid 3412 and various sets of additional patterns. In many cases we express these generating functions in terms of Chebyshev polynomials of…
We prove several general formulas for the distributions of various permutation statistics over any set of permutations whose quasisymmetric generating function is a symmetric function. Our formulas involve certain kinds of plethystic substitutions on quasisymmetric generating functions, and the permutation statistics we consider include the descent number, peak number, left peak number, and the number of up-down runs. We apply these results to cyclic permutations, involutions, and derangements, and more generally, to derive formulas for counting all permutations by the above statistics jointly…
Using a result of Gessel and Reutenauer, we find a simple formula for the number of cyclic permutations with a given descent set, by expressing it in terms of ordinary descent numbers (i.e., those counting all permutations with a given descent set). We then use this formula to show that, for almost all sets $I \subseteq [n-1]$, the fraction of size-$n$ permutations with descent set $I$ which are $n$-cycles is asymptotically $1/n$. As a special case, we recover a result of Stanley for alternating cycles. We also use our formula to count the cycles that do not have two consecutive descents.
We study permutations that are sorted by operators of the form $\mathbf{S} \circ α\circ \mathbf{S}$, where $\mathbf{S}$ is the usual stack sorting operator introduced by D. Knuth and $α$ is any $D_8$-symmetry obtained combining the classical reverse, complement and inverse operations. Such permutations can be characterized by excluded (generalized) patterns. Some conjectures about the enumeration of these permutations, refined with numerous classical statistics, have been proposed by A. Claesson, M. Dukes and E. Steingrímsson. We prove these conjectures, and enrich one of them with a few more …
We obtain an upper and lower bound for the number of reduced words for a permutation in terms of the number of braid classes and the number of commutation classes of the permutation. We classify the permutations that achieve each of these bounds, and enumerate both cases.
In theory of Coxeter groups, bigrassmannian elements are well known as elements which have precisely one left descent and precisely one right descent. In this article, we prove formulas on enumeration of bigrassmannian permutations weakly below a permutation in Bruhat order in the symmetric groups. For the proof, we use equivalent characterizations of bigrassmannian permutations by Lascoux-Schutzenberger and Reading.
Springer numbers are an analog of Euler numbers for the group of signed permutations. Arnol'd showed that they count some objects called snakes, that generalize alternating permutations. Hoffman established a link between Springer numbers, snakes, and some polynomials related with the successive derivatives of trigonometric functions. The goal of this article is to give further combinatorial properties of derivative polynomials, in terms of snakes and other objects: cycle-alternating permutations, weighted Dyck or Motzkin paths, increasing trees and forests. We obtain the generating functions,…
Given two operators $\hat D$ and $\hat E$ subject to the relation $\hat D\hat E -q \hat E \hat D =p$, and a word $w$ in $M$ and $N$, the rewriting of $w$ in normal form is combinatorially described by rook placements in a Young diagram. We give enumerative results about these rook placements, particularly in the case where $p=(1-q)/q^2$. This case naturally arises in the context of the PASEP, a random process whose partition function and stationary distribution are expressed using two operators $D$ and $E$ subject to the relation $DE-qED=D+E$ (matrix Ansatz). Using the link obtained by Corteel…
Baryshnikov and Romik derived the combinatorial identities for the numbers of the $m$-strip tableaux. This generalized the classical André's theorem for the number of up-down permutations. They asked for a bijective proof for the enumeration of $3$-strip tableaux. In this paper we will provide such a bijective proof. First we count the $3$-strip tableaux by decomposition. Secondly we will apply this "decomposition" idea on the up-down permutations and down-up permutations to enumerate the $3$-strip tableaux bijectively.
