We study new statistics on permutations that are variations on the descent and the inversion statistics. In particular, we consider the alternating descent set of a permutation sigma = sigma_1sigma_2...sigma_n defined as the set of indices i such that either i is odd and sigma_i > sigma_{i+1}, or i is even and sigma_i < sigma_{i+1}. We show that this statistic is equidistributed with the 3-descent set statistic on permutations sigma = sigma_1sigma_2...sigma_{n+1} with sigma_1 = 1, defined to be the set of indices i such that the triple sigma_i sigma_{i+1} sigma_{i+2} forms an odd permutation of size 3. We then introduce Mahonian inversion statistics corresponding to the two new variations of descents and show that the joint distributions of the resulting descent-inversion pairs are the same. We examine the generating functions involving alternating Eulerian polynomials, defined by analogy with the classical Eulerian polynomials sum_{sigma in S_n} t^{des(sigma)+1} using alternating descents. For the alternating descent set statistic, we define the generating polynomial in two non-commutative variables by analogy with the ab-index of the Boolean algebra B_n, and make observations about it. By looking at the number of alternating inversions in alternating (down-up) permutations, we obtain a new q-analog of the Euler number E_n and show how it emerges in a q-analog of an identity expressing E_n as a weighted sum of Dyck paths.
In this paper we study the cycle descent statistic on permutations. Several involutions on permutations and derangements are constructed. Moreover, we construct a bijection between negative cycle descent permutations and Callan perfect matchings.
A ballot permutation is a permutation $π$ such that in any prefix of $π$ the descent number is not more than the ascent number. By using a reversal concatenation map, we give a formula for the joint distribution (pk, des) of the peak and descent statistics over ballot permutations, and connect this distribution and the joint distribution (pk, dp, des) of the peak, depth, and descent statistics over ordinary permutations in terms of generating functions. As corollaries, we obtain several formulas for the bivariate generating function for (i) the peak statistic over ballot permutations,(ii) the …
We introduce and study new refinements of inversion statistics for permutations, such as k-step inversions, (the number of inversions with fixed position differences) and non-inversion sums (the sum of the differences of positions of the non-inversions of a permutation). We also provide a distribution function for non-inversion sums, a distribution function for k-step inversions that relates to the Eulerian polynomials, and special cases of distribution functions for other statistics we introduce, such as (\leqk)-step inversions and (k1,k2)-step inversions (that fix the value separation as wel…
In this paper we study the generating polynomials obtained by enumerating signed simsun permutations by number of the descents. Properties of the polynomials, including the recurrence relations and generating functions are studied.
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 …
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.
Motivated by juggling sequences and bubble sort, we examine permutations on the set {1,2,...,n} with d descents and maximum drop size k. We give explicit formulas for enumerating such permutations for given integers k and d. We also derive the related generating functions and prove unimodality and symmetry of the coefficients.
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 say that two permutations $π$ and $ρ$ have separated descents at position $k$ if $π$ has no descents before position $k$ and $ρ$ has no descents after position $k$. We give a counting formula, in terms of reduced word tableaux, for computing the structure constants of products of Schubert polynomials indexed by permutations with separated descents, and recognize that these structure constants are certain Edelman-Greene coefficients. Our approach uses generalizations of Schützenberger's jeu de taquin algorithm and the Edelman-Greene correspondence via bumpless pipe dreams.
Stirling permutations were introduced by Gessel and Stanley, who used their enumeration by the number of descents to give a combinatorial interpretation of certain polynomials related to Stirling numbers. Quasi-Stirling permutations, which can be viewed as labeled noncrossing matchings, were introduced by Archer et al. as a natural extension of Stirling permutations. Janson's correspondence between Stirling permutations and labeled increasing plane trees extends to a bijection between quasi-Stirling permutations and the same set of trees without the increasing restriction. Archer et al. posed …
Let $s$ denote West's stack-sorting map. A permutation is called $t-\textit{sorted}$ if it is of the form $s^t(μ)$ for some permutation $μ$. We prove that the maximum number of descents that a $t$-sorted permutation of length $n$ can have is $\left\lfloor\frac{n-t}{2}\right\rfloor$. When $n$ and $t$ have the same parity and $t\geq 2$, we give a simple characterization of those $t$-sorted permutations in $S_n$ that attain this maximum. In particular, the number of such permutations is $(n-t-1)!!$.
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.
Descents in permutations or words are defined from the relative position of two consecutive letters. We investigate a statistic involving patterns of k consecutive letters, and show that it leads to Hopf algebras generalizing noncommutative symmetric functions and quasi-symmetric functions.
The set of all permutations, ordered by pattern containment, is a poset. We present an order isomorphism from the poset of permutations with a fixed number of descents to a certain poset of words with subword order. We use this bijection to show that intervals of permutations with a fixed number of descents are shellable, and we present a formula for the Möbius function of these intervals. We present an alternative proof for a result on the Möbius function of intervals $[1,π]$ such that $π$ has exactly one descent. We prove that if $π$ has exactly one descent and avoids 456123 and 356124, then…
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.
Motivated by the work of Chung, Claesson, Dukes, and Graham, we define a natural type B analog of the classic bubble sort, and use it to define a type B analog of the maximum drop statistic. We enumerate (by explicit, recursive, and generating function formulas) signed permutations with r type B descents and type B maximum drop at most k. We also find a connection between these signed permutations and certain 2-colored juggling sequences.
We provide a bijective proof of a formula of Auli and the author expressing the number of inversion sequences with no three consecutive equal entries in terms of the number of non-derangements, that is, permutations with fixed points. Additionally, we give bijective proofs of two simple recurrences for the number of non-derangements.
In 2012, Sagan and Savage introduced the notion of $st$-Wilf equivalence for a statistic $st$ and for sets of permutations that avoid particular permutation patterns which can be extended to generalized permutation patterns. In this paper we consider $inv$-Wilf equivalence on sets of two or more consecutive permutation patterns. We say that two sets of generalized permutation patterns $Π$ and $Π'$ are $inv$-Wilf equivalent if the generating function for the inversion statistic on the permutations that simultaneously avoid all elements of $Π$ is equal to the generating function for the inversio…
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.
We present a bijection between cyclic permutations of {1,2,...,n+1} and permutations of {1,2,...,n} that preserves the descent set of the first n entries and the set of weak excedances. This non-trivial bijection involves a Foata-like transformation on the cyclic notation of the permutation, followed by certain conjugations. We also give an alternate derivation of the consequent result about the equidistribution of descent sets using work of Gessel and Reutenauer. Finally, we prove a conjecture of the author in [SIAM J. Discrete Math. 23 (2009), 765-786] and a conjecture of Eriksen, Freij and …
Bóna conjectured that the descent polynomials on $(n-2)$-stack sortable permutations have only real zeros. Brändén proved this conjecture by establishing a more general result. In this paper, we give another proof of Brändén's result by using the theory of $s$-Eulerian polynomials recently developed by Savage and Visontai.
We solve two related extremal problems in the theory of permutations. A set $Q$ of permutations of the integers 1 to $n$ is inversion-complete (resp., pair-complete) if for every inversion $(j,i)$, where $1 \le i \textless{} j \le n$, (resp., for every pair $(i,j)$, where $i\not= j$) there exists a permutation in~$Q$ where $j$ is before~$i$. It is minimally inversion-complete if in addition no proper subset of~$Q$ is inversion-complete; and similarly for pair-completeness. The problems we consider are to determine the maximum cardinality of a minimal inversion-complete set of permutations, and…
In this paper we examine the sorting operator $T(LnR)=T(R)T(L)n$. Applying this operator to a permutation is equivalent to passing the permutation reversed through a stack. We prove theorems that characterise $t$-revstack sortability in terms of patterns in a permutation that we call $zigzag$ patterns. Using these theorems we characterise those permutations of length $n$ which are sorted by $t$ applications of $T$ for $t=0,1,2,n-3,n-2,n-1$. We derive expressions for the descent polynomials of these six classes of permutations and use this information to prove Steingrímsson's sorting conjecture…
The set of all permutations, ordered by pattern containment, is a poset. We give a formula for the Möbius function of intervals $[1,π]$ in this poset, for any permutation $π$ with at most one descent. We compute the Möbius function as a function of the number and positions of pairs of consecutive letters in $π$ that are consecutive in value. As a result of this we show that the Möbius function is unbounded on the poset of all permutations. We show that the Möbius function is zero on any interval $[1,π]$ where $π$ has a triple of consecutive letters whose values are consecutive and monotone. We…
The descent set D(w) of a permutation w of 1,2,...,n is a standard and well-studied statistic. We introduce a new statistic, the connectivity set C(w), and show that it is a kind of dual object to D(w). The duality is stated in terms of the inverse of a matrix that records the joint distribution of D(w) and C(w). We also give a variation involving permutations of a multiset and a q-analogue that keeps track of the number of inversions of w.
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.
We study three dimensional array of numbers $B(n,k,j)$, $0\le j,k\le n$, where $B(n,k,j)$ is the number of type $B$ permutations of order $n$ with $k$ descents and $j$ minus signs. We prove in particular, that $b(n,k,j):=B(n,k,j)/\binom{n}{j}$ is an integer and provide two combinatorial interpretations for these numbers.
This paper is concerned with the joint distribution of the number of exterior peaks and the number of proper double descents over permutations on $[n] =\{1,2,\ldots,n\}$. The notion of exterior peaks of a permutation was introduced by Aguiar, Bergeron and Nyman in their study of the peak algebra. Gessel obtained the generating function of the number of permutations on $[n]$ with a given number of exterior peaks. On the other hand, by establishing differential equations, Elizalde and Noy derived the generating function for the number of permutations on $[n]$ with a given number of proper double…
Starting from some considerations we make about the relations between certain difference statistics and the classical permutation statistics we study permutations whose inversion number and excedance difference coincide. It turns out that these (so-called bi-increasing) permutations are just the 321-avoiding ones. The paper investigates their excedance and descent structure. In particular, we find some nice combinatorial interpretations for the distribution coefficients of the number of excedances and descents, respectively, and their difference analogues over the bi-increasing permutations in…
Let $dd(I;n)$ denote the number of permutations of $[n]$ with double descent set $I$. For singleton sets $I$, we present a recursive formula for $dd(I;n)$ and a method to estimate $dd(I;n)$. We also discuss the enumeration of certain classes of rim hooks. Let $\mathcal{R}_I(n)$ denote the set of all rim hooks of length $n$ with double descent set $I$, so that any tableau of one of these rim hooks corresponds to a permutation with double descent set $I$. We present a formula for the size of $\mathcal{R}_I(n)$ when $I$ is a singleton set, and we also present a formula for the size of $\mathcal{R…
An open conjecture in pattern avoidance theory is that the distribution of the major index among 321-avoiding permutations is distributed unimodally. We construct a formula for this distribution, and in the case of 2 descents prove unimodality, with unimodality for 3 through 5 descents likely being little more complicated. The formula refines the $q$-analogue of the Frame-Robinson-Thrall hooklength formula for two-rowed partitions, and in the latter part of the paper we discuss another theorem of the same type, and further exploration toward this question. We also give observations on the anal…
We prove several identities expressing polynomials counting permutations by various descent statistics in terms of Eulerian polynomials, extending results of Stembridge, Petersen, and Brändén. Additionally, we find $q$-exponential generating functions for $q$-analogues of these descent statistic polynomials that also keep track of the inversion number or inverse major index. We also present identities relating several of these descent statistic polynomials to refinements of type B Eulerian polynomials and flag descent polynomials by the number of negative letters of a signed permutation. Our m…
We prove an identity conjectured by Adin and Roichman involving the descent set of $λ$-unimodal cyclic permutations. These permutations appear in formulas for characters of certain representations of the symmetric group. Such formulas have previously been proven algebraically. In this paper, we present a combinatorial proof for one such formula and discuss the consequences for the distribution of the descent set on cyclic permutations.
We find the exponential generating function for permutations with all valleys even and all peaks odd, and use it to determine the asymptotics for its coefficients, answering a question posed by Liviu Nicolaescu. The generating function can be expressed as the reciprocal of a sum involving Euler numbers. We give two proofs of the formula. The first uses a system of differential equations. The second proof derives the generating function directly from general permutation enumeration techniques, using noncommutative symmetric functions. The generating function is an "alternating" analogue of Davi…
We define and study odd analogues of classical geometric and combinatorial objects associated to permutations, namely odd Schubert varieties, odd diagrams, and odd inversion sets. We show that there is a bijection between odd inversion sets of permutations and acyclic orientations of the Turán graph, that the dimension of the odd Schubert variety associated to a permutation is the odd length of the permutation, and give several necessary conditions for a subset of $[n] \times [n]$ to be the odd diagram of a permutation. We also study the sign-twisted generating function of the odd length over …
We give a solution to a problem posed by Corteel and Nadeau concerning permutation tableaux of length n and the number of occurrences of the dashed pattern 32--1 in permutations on [n]. We introduce the inversion number of a permutation tableau. For a permutation tableau T and the permutation $π$ obtained from T by the bijection of Corteel and Nadeau, we show that the inversion number of T equals the number of occurrences of the dashed pattern 32--1 in the reverse complement of $π$. We also show that permutation tableaux without inversions coincide with L-Bell tableaux introduced by Corteel an…
Let $T_n$ be the set of 321-avoiding permutations of order $n$. Two properties of $T_n$ are proved: (1) The {\em last descent} and {\em last index minus one} statistics are equidistributed over $T_n$, and also over subsets of permutations whose inverse has an (almost) prescribed descent set. An analogous result holds for Dyck paths. (2) The sign-and-last-descent enumerators for $T_{2n}$ and $T_{2n+1}$ are essentially equal to the last-descent enumerator for $T_n$. The proofs use a recursion formula for an appropriate multivariate generating function.
Motivated by recent results on quasi-Stirling permutations, which are permutations of the multiset $\{1,1,2,2,\dots,n,n\}$ that avoid the "crossing" patterns 1212 and 2121, we consider nonnesting permutations, defined as those that avoid the patterns 1221 and 2112 instead. We show that the polynomial giving the distribution of the number of descents on nonnesting permutations is a product of an Eulerian polynomial and a Narayana polynomial. It follows that, rather unexpectedly, this polynomial is palindromic. We provide bijective proofs of these facts by composing various transformations on Dy…
This paper studies statistics of riffle shuffles by relating them to random word statistics with the use of inverse shuffles. Asymptotic normality of the number of descents and inversions in riffle shuffles with convergence rates of order $1/\sqrt{n}$ in the Kolmogorov distance are proven. Results are also given about the lengths of the longest alternating subsequences of random permutations resulting from riffle shuffles. A sketch of how the theory of multisets can be useful for statistics of a variation of top $m$ to random shuffles is presented.
We use recurrences (alias difference equations) to prove the longstanding conjecture that the two most important permutation statistics, namely the number of inversions and the major index, are asymptotically joint-independently-normal. We even derive more-precise-than needed asymptotic formulas for the (normalized) mixed moments. This is the fully revised second edition, incorportating the many insightful comments of nine conscientious NON-anonymous referees listed under the authors' names. This article is exclusively published in the on-line journal "Personal Journal of Shalosh B. Ekhad and …
