English
Related papers

Related papers: Descents on nonnesting multipermutations

200 papers

We describe the distribution of the number and location of the fixed points of permu- tations that avoid the pattern 321 via a bijection with rooted plane trees on n + 1 vertices. Using the local limit theorem for Galton-Watson trees, we…

Combinatorics · Mathematics 2019-04-02 Christopher Hoffman , Douglas Rizzolo , Erik Slivken

In this paper, we characterize and enumerate pattern-avoiding permutations composed of only 3-cycles. In particular, we answer the question for the six patterns of length 3. We find that the number of permutations composed of $n$ 3-cycles…

Combinatorics · Mathematics 2021-04-27 Kassie Archer , Christina Graves

How many matchings on the vertex set V={1,2,...,2n} avoid a given configuration of three edges? Chen, Deng and Du have shown that the number of matchings that avoid three nesting edges is equal to the number of matchings avoiding three…

Combinatorics · Mathematics 2007-06-26 Vit Jelinek

Centrosymmetric involutions in the symmetric group S_{2n} are permutations \pi such that \pi=\pi^{-1} and \pi(i)+\pi(2n+1-i)=2n+1 for all i, and they are in bijection with involutions of the hyperoctahedral group. We describe the…

Combinatorics · Mathematics 2015-09-01 Marilena Barnabei , Flavio Bonetti , Sergi Elizalde , Matteo Silimbani

For any finite partially ordered set $P$, the $P$-Eulerian polynomial is the generating function for the descent number over the set of linear extensions of $P$, and is closely related to the order polynomial of $P$ arising in the theory of…

Combinatorics · Mathematics 2024-09-11 T. Kyle Petersen , Yan Zhuang

In this paper, we study the generating functions for the number of pattern restricted Stirling permutations with a given number of plateaus, descents and ascents. Properties of the generating functions, including symmetric properties and…

Combinatorics · Mathematics 2016-07-21 David Callan , Shi-Mei Ma , Toufik Mansour

We investigate the $\alpha$-colored Eulerian polynomials and a notion of descents introduced in a recent paper of Hedmark and show that such polynomials can be computed as a polynomial encoding descents computed over a quotient of the…

Combinatorics · Mathematics 2016-11-22 Dustin Hedmark , Cyrus Hettle , McCabe Olsen

In this paper, we give a formula for the number of permutations that avoid the split patterns $3|12$ and $23|1$ with respect to a position $r$. Such permutations count the number of Schubert varieties for which the projection map from the…

Combinatorics · Mathematics 2024-02-28 Travis Grigsby , Edward Richmond

Recently, Dokos et al. conjectured that for all $k, m\geq 1$, the patterns $ 12\ldots k(k+m+1)\ldots (k+2)(k+1) $ and $(m+1)(m+2)\ldots (k+m+1)m\ldots 21 $ are $maj$-Wilf-equivalent. In this paper, we confirm this conjecture for all $k\geq…

Combinatorics · Mathematics 2014-10-14 Huiyun Ge , Sherry H. F. Yan , Yaqiu Zhang

We examine the poset $P$ of 132-avoiding $n$-permutations ordered by descents. We show that this poset is the "coarsening" of the well-studied poset $Q$ of noncrossing partitions . In other words, if $x<y$ in $Q$, then $f(y)<f(x)$ in $P$,…

Combinatorics · Mathematics 2007-05-23 Miklos Bona

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…

Combinatorics · Mathematics 2015-12-08 Jun Ma , Shimei Ma , Yeong-Nan Yeh , Zhu Xu

The large Schroder numbers are known to count several classes of permutations avoiding two 4-letter patterns. Here we show they count another family of permutations, those whose left to right minima decomposition, when reversed, is…

Combinatorics · Mathematics 2012-10-25 David Callan

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…

Combinatorics · Mathematics 2007-05-23 Astrid Reifegerste

In this paper, we study gamma-positivity of descent-type polynomials by introducing the change of context-free grammars method. We first present grammatical proofs of the gamma-positivity of the Eulerian polynomials, type B Eulerian…

Combinatorics · Mathematics 2019-02-26 Shi-Mei Ma , Jun Ma , Yeong-Nan Yeh

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\"oder paths of semilength $n$ without peaks at even level. As a consequence, the refined…

Combinatorics · Mathematics 2009-03-09 Sherry H. F. Yan

In this paper we generalize permutations to plane permutations. We employ this framework to derive a combinatorial proof of a result of Zagier and Stanley, that enumerates the number of $n$-cycles $\omega$, for which $\omega(12\cdots n)$…

Combinatorics · Mathematics 2015-03-17 Ricky X. F. Chen , Christian M. Reidys

We define some generalizations of the classical descent and inversion statistics on signed permutations that arise from the work of Sack and Ulfarsson [20] and called after width-k descents and width-k inversionsof type A in Davis's work…

Combinatorics · Mathematics 2022-05-11 Marwa Ben Abdelmaksoud , Adel Hamdi

Given a knot complement X and its p-fold cyclic cover X_p, we identify twisted polynomials associated to 1-dimensional linear representations of the fundamental group of X_p with twisted polynomials associated to related p-dimensional…

Geometric Topology · Mathematics 2013-09-30 Chris Herald , Paul Kirk , Charles Livingston

We show that the distribution of the major index over the set of involutions in S_n that avoid the pattern 321 is given by the q-analogue of the n-th central binomial coefficient. The proof consists of a composition of three non-trivial…

Combinatorics · Mathematics 2014-07-25 Marilena Barnabei , Flavio Bonetti , Sergi Elizalde , Matteo Silimbani

A permutation whose any prefix has no more descents than ascents is called a ballot permutation. In this paper, we present a decomposition of ballot permutations that enables us to construct a bijection between ballot permutations and odd…

Combinatorics · Mathematics 2021-03-09 Zhicong Lin , David G. L. Wang , Tongyuan Zhao