English
Related papers

Related papers: Descent sets of cyclic permutations

200 papers

We study the descent distribution over the set of centrosymmetric permutations that avoid the pattern of length 3. Our main tool in the most puzzling case, namely, $\tau=123$ and $n$ even, is a bijection that associates a Dyck prefix of…

Combinatorics · Mathematics 2009-10-14 Marilena Barnabei , Flavio Bonetti , Matteo Silimbani

This paper presents a bijection between ascent sequences and upper triangular matrices whose non-negative entries are such that all rows and columns contain at least one non-zero entry. We show the equivalence of several natural statistics…

Combinatorics · Mathematics 2009-09-21 Mark Dukes , Robert Parviainen

In this paper we introduce {\em weak ascent sequences}, a class of number sequences that properly contains ascent sequences. We show how these sequences uniquely encode each of the following objects: permutations avoiding a particular…

Combinatorics · Mathematics 2022-10-11 Beáta Bényi , Anders Claesson , Mark Dukes

Let $n$ be a nonnegative integer and $I$ be a finite set of positive integers. In 1915, MacMahon proved that the number of permutations in the symmetric group $\mathfrak{S}_n$ with descent set $I$ is a polynomial in $n$. We call this the…

Combinatorics · Mathematics 2017-11-15 Alexander Diaz-Lopez , Pamela E. Harris , Erik Insko , Mohamed Omar , Bruce E. Sagan

We construct an intriguing bijection between $021$-avoiding inversion sequences and $(2413,4213)$-avoiding permutations, which proves a sextuple equidistribution involving double Eulerian statistics. Two interesting applications of this…

Combinatorics · Mathematics 2016-12-20 Zhicong Lin , Dongsu Kim

Baxter permutations are known to be in bijection with a wide number of combinatorial objects. Previously, it was shown that each of these objects had a natural involution which was carried equivariantly by the known bijections, and the…

Combinatorics · Mathematics 2017-10-20 Kevin Dilks

We give direct bijective proofs of the symmetry of the distributions of the number of ascents and descents over standard Young tableaux of shape $\lambda$, where $\lambda$ is a rectangle $(n,n,\dots,n)$ or a truncated staircase…

Combinatorics · Mathematics 2025-03-17 Sergi Elizalde

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…

Combinatorics · Mathematics 2007-05-23 Ron M. Adin , Yuval Roichman

In this paper we refine the well-known permutation statistic "descent" by fixing parity of (exactly) one of the descent's numbers. We provide explicit formulas for the distribution of these (four) new statistics. We use certain differential…

Combinatorics · Mathematics 2007-05-23 Sergey Kitaev , Jeffrey Remmel

The number of inversion sequences avoiding two patterns $101$ and $102$ is known to be the same as the number of permutations avoiding three patterns $2341$, $2431$, and $3241$. This sequence also counts the number of Schr\"{o}der paths…

Combinatorics · Mathematics 2024-04-08 JiSun Huh , Sangwook Kim , Seunghyun Seo , Heesung Shin

We study joint distributions of cycles and patterns in permutations written in standard cycle form. We explore both classical and generalised patterns of length 2 and 3. Many extensions of classical theory are achieved; bivariate generating…

Combinatorics · Mathematics 2007-11-05 Robert Parviainen

It is shown that a refined version of a q-analogue of the Eulerian numbers together with the action, by conjugation, of the subgroup of the symmetric group $S_n$ generated by the $n$-cycle $(1,2,...,n)$ on the set of permutations of fixed…

Combinatorics · Mathematics 2009-09-18 Bruce Sagan , John Shareshian , Michelle L. Wachs

Babson and Steingr\'{\i}msson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We consider n-permutations that avoid the generalized pattern…

Combinatorics · Mathematics 2007-05-23 Sergey Kitaev

Motivation coming from the study of affine Weyl groups, a structure of ranked poset is defined on the set of circular permutations in $S_n$ (that is, $n$-cycles). It is isomorphic to the poset of so-called admitted vectors, and to an…

Combinatorics · Mathematics 2020-10-14 Antoine Abram , Nathan Chapelier-Laget , Christophe Reutenauer

The poset of permutations of [n] under Bruhat ordering is studied. We give nontrivial upper and lower bounds for the number of comparable pairs of permutations in both the weak and strong versions of this order. In light of numerical…

Probability · Mathematics 2007-05-23 Adam Hammett , Boris Pittel

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…

Combinatorics · Mathematics 2010-05-20 Masato Kobayashi

Recall that an excedance of a permutation $\pi$ is any position $i$ such that $\pi_i > i$. Inspired by the work of Hopkins, McConville and Propp (Elec. J. Comb., 2017) on sorting using toppling, we say that a permutation is toppleable if it…

Combinatorics · Mathematics 2021-01-05 Arvind Ayyer , Daniel Hathcock , Prasad Tetali

In this paper, we establish a bijection between the set of mutation classes of mutation-cyclic skew-symmetric integral 3x3-matrices and the set of triples of integers (a,b,c) which are all greater than 1 and where the product of the two…

Representation Theory · Mathematics 2007-05-23 Ibrahim Assem , Martin Blais , Thomas Brüstle , Audrey Samson

In their study of the densest jammed configurations for theater models, Krapivsky and Luck observe that two classes of permutations have the same cardinalities and ask for a bijection between them. In this note we show that the Foata…

Combinatorics · Mathematics 2020-01-13 Sanjay Ramassamy

Recently, Bagno, Garber and Mansour studied a kind of excedance number on the complex reflection groups and computed its multidistribution with the number of fixed points on the set of involutions in these groups. In this note, we consider…

Combinatorics · Mathematics 2007-05-23 Toufik Mansour , Yidong Sun