English
Related papers

Related papers: $k$-arrangements, statistics and patterns

200 papers

We propose sum rules for permutations $p_n(k)$ of the ensemble $\left\{1,2,\cdots,n\right\}$ with $k$ fixed points, in the form of partial sums of their moments. The corresponding identities involve Stirling numbers of the first kind…

Combinatorics · Mathematics 2026-03-10 Jean-Christophe Pain

We consider two related problems arising from a question of R. Graham on quasirandom phenomena in permutation patterns. A ``pattern'' in a permutation $\sigma$ is the order type of the restriction of $\sigma : [n] \to [n]$ to a subset $S…

Combinatorics · Mathematics 2008-01-29 Joshua Cooper , Andrew Petrarca

The Eulerian number A(n,k) counts permutations of n symbols with exactly k descents. Motivated by problems in cryptography, several authors have studied the proportion of permutations whose number of descents lies in a fixed congruence…

Probability · Mathematics 2026-05-13 Jason Fulman , Adrian Röllin

Given a permutation statistic $\operatorname{st}$, define its inverse statistic $\operatorname{ist}$ by $\operatorname{ist}(\pi):=\operatorname{st}(\pi^{-1})$. We give a general approach, based on the theory of symmetric functions, for…

Combinatorics · Mathematics 2024-11-13 Ira M. Gessel , Yan Zhuang

We give two simple proofs of a conjecture of Richard Stanley concerning the equidistribution of derangements and alternating permutations with the maximal number of fixed points.

Combinatorics · Mathematics 2007-05-23 Robin Chapman , Lauren K. Williams

We prove an interesting fact describing the location of the roots of the generating polynomials of the numbers of derangements of length $n$, counted by their number of cycles. We then use this result to prove that if $k$ is the number of…

Numerical Analysis · Mathematics 2007-05-23 Miklos Bona

We present a short proof of MacMahon's classic result that the number of permutations with $k$ inversions equals the number whose major index (sum of positions at which descents occur) is $k$

Combinatorics · Mathematics 2022-07-13 Michael J. Collins

There are several approaches to study occurrences of consecutive patterns in permutations such as the inclusion-exclusion method, the tree representations of permutations, the spectral approach and others. We propose yet another approach to…

Combinatorics · Mathematics 2007-05-23 Sergey Avgustinovich , Sergey Kitaev

We examine the distribution and popularity of different parameters (such as the number of descents, runs, valleys, peaks, right-to-left minima, and more) on the sets of increasing and flattened permutations. For each parameter, we provide…

Combinatorics · Mathematics 2024-10-22 Jean-Luc Baril , José L. Ramírez

We give a new interpretation of the derangement numbers d_n as the sum of the values of the largest fixed points of all non-derangements of length n-1. We also show that the analogous sum for the smallest fixed points equals the number of…

Combinatorics · Mathematics 2009-04-21 Emeric Deutsch , Sergi Elizalde

We show that the pair (des, ides) of statistics on the set of permu- tations has the same distribution as the pair (asc, row) of statistics on the set of inversion tables, proving a conjecture of Visontai. The common generating function of…

Combinatorics · Mathematics 2014-01-23 Erik Aas

A symmetry of $(t,q)$-Eulerian numbers of type $B$ is combinatorially proved by defining an involution preserving many important statistics on the set of permutation tableaux of type $B$. This involution also proves a symmetry of the…

Combinatorics · Mathematics 2015-12-18 Soojin Cho , Kyoungsuk Park

We prove that the pair of statistics (des,maj) on multiset permutations is equidistributed with the pair (stc,inv) on certain quotients of the symmetric group. We define the analogue of the statistic stc on multiset permutations, whose…

Combinatorics · Mathematics 2016-12-02 Angela Carnevale

We define and study positional marked patterns, permutations $\tau$ where one of elements in $\tau$ is underlined. Given a permutation $\sigma$, we say that $\sigma$ has a $\tau$-match at position $i$ if $\tau$ occurs in $\sigma$ in such a…

Combinatorics · Mathematics 2023-06-22 Sittipong Thamrongpairoj , Jeffrey B. Remmel

At a crossroads of calculus and combinatorics, the generating function of secant and tangent numbers (Euler numbers) provides enumeration of alternating permutations. In this article, we present a new refinement of Euler numbers to answer…

Combinatorics · Mathematics 2020-11-17 Masato Kobayashi

We present methods of calculating statistics generating functions over the colored permutation groups, and generalizing known theorems from the symmetric groups to general colored permutations groups.

Combinatorics · Mathematics 2007-05-23 Michael Fire

We introduce several statistics on ordered partitions of sets, that is, set partitions where the blocks are permuted arbitrarily. The distribution of these statistics is closely related to the q-Stirling numbers of the second kind. Some of…

Combinatorics · Mathematics 2019-04-26 Einar Steingrimsson

We study the joint distribution of descents and inverse descents over the set of permutations of n letters. Gessel conjectured that the two-variable generating function of this distribution can be expanded in a given basis with nonnegative…

Combinatorics · Mathematics 2013-03-21 Mirkó Visontai

It is well known that descents and excedances are equidistributed in the symmetric group. We show that the descent and excedance enumerators, summed over permutations with a fixed first letter are identical when we perform a simple change…

Combinatorics · Mathematics 2026-04-10 Hiranya Kishore Dey , Umesh Shankar , Sivaramakrishnan Sivasubramanian

A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…

Combinatorics · Mathematics 2007-05-23 Sergey Kitaev , Tyrrell B. McAllister , T. Kyle Petersen