English
Related papers

Related papers: Permutation statistics on involutions

200 papers

Inversion sequences, also known as subexcedant sequences, form a fundamental class of objects in enumerative combinatorics. In this paper, we study the joint distribution of five statistics on inversion sequences. While several statistics…

Combinatorics · Mathematics 2026-04-21 Lora R. Du , Guo-Niu Han

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…

Combinatorics · Mathematics 2020-08-21 Ira M. Gessel , Yan Zhuang

Any permutation has a disjoint cycle decomposition and concept generates an equivalence class on the symmetry group called the cycle-type. The main focus of this work is on permutations of restricted cycle-types, with particular emphasis on…

Combinatorics · Mathematics 2014-06-11 Tewodros Amdeberhan , Victor H. Moll

We study a group action on permutations due to Foata and Strehl and use it to prove that the descent generating polynomial of certain sets of permutations has a nonnegative expansion in the basis $\{t^i(1+t)^{n-1-2i}\}_{i=0}^m$, $m=\lfloor…

Combinatorics · Mathematics 2012-04-18 Petter Brändén

Recently, the second author studied an Eulerian statistic (called cover) in the context of convex polytopes, and proved an equal joint distribution of (cover,des) with (des,exc). In this paper, we present several direct bijective proofs…

Combinatorics · Mathematics 2012-08-16 Travis Hance , Nan Li

Carlitz and Scoville introduced the polynomials $A_n(x,y|{\alpha},{\beta})$, which we refer to as the $(\alpha, \beta)$-Eulerian polynomials. These polynomials count permutations based on Eulerian-Stirling statistics, including descents,…

Combinatorics · Mathematics 2023-10-17 Kathy Q. Ji

In the first part of the paper, we study the inversion statistic of random permutations under the family $(\mathbb{P}_\theta^{(n)})_{\theta \ge 0}$ of Ewens sampling distributions on $S_n$. We obtain a rather simple exact formula for the…

Probability · Mathematics 2025-11-18 Ross G. Pinsky , Dominic T. Schickentanz

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

We prove several identities expressing polynomials counting permutations by various descent statistics in terms of Eulerian polynomials, extending results of Stembridge, Petersen, and Br\"and\'en. Additionally, we find $q$-exponential…

Combinatorics · Mathematics 2018-06-13 Yan Zhuang

In this research announcement we present a new q-analog of a classical formula for the exponential generating function of the Eulerian polynomials. The Eulerian polynomials enumerate permutations according to their number of descents or…

Combinatorics · Mathematics 2007-05-23 John Shareshian , Michelle L. Wachs

We derive a generating function for the number of integer compositions of $n$ into $k$ parts (i.e., $k$-compositions of $n$) with a given number of inversions, and obtain similar results for $k$-compositions of $n$ with a given number of…

General Mathematics · Mathematics 2026-05-21 E. G. Santos

Given an Eulerian digraph, we consider the genus distribution of its face-oriented embeddings. We prove that such distribution is log-concave for two families of Eulerian digraphs, thus giving a positive answer for these families to a…

Combinatorics · Mathematics 2022-02-15 Yichao Chen , Wenjie Fang

We use representation theory of the symmetric group S_n to prove Poisson limit theorems for the distribution of fixed points for three types of non-uniform permutations. First, we give results for the commutator of g and x where g and x are…

Combinatorics · Mathematics 2024-06-28 Jason Fulman

We study the number of random permutations needed to invariably generate the symmetric group, $S_n$, when the distribution of cycle counts has the strong $\alpha$-logarithmic property. The canonical example is the Ewens sampling formula,…

Probability · Mathematics 2016-10-18 Gerandy Brito , Christopher Fowler , Matthew Junge , Avi Levy

In a recent paper, Regev and Roichman introduced the <_L order and the L-descent number statistic, des_L, on the group of colored permutations, C_a \wr S_n. Here we define the L-reverse major index statistic, rmaj_L, on the same group and…

Combinatorics · Mathematics 2007-05-23 Dan Bernstein

An involution is a permutation that is its own inverse. Given a permutation $\sigma$ of $[n],$ let $\mathbf{N}_{n}(\sigma)$ denote the number of ways to write $\sigma$ as a product of two involutions of $[n].$ If we endow the symmetric…

Combinatorics · Mathematics 2015-08-19 Charles Burnette , Eric Schmutz

Let $W$ be a finite Coxeter group and $X$ a subset of $W$. The length polynomial $L_{W,X}(t)$ is defined by $L_{W,X}(t) = \sum_{x \in X} t^{\ell(x)}$, where $\ell$ is the length function on $W$. In this article we derive expressions for the…

Combinatorics · Mathematics 2014-03-31 Sarah B. Hart , Peter J. Rowley

We introduce a new statistic on the hyperoctahedral groups (Coxeter groups of type B), and give a conjectural formula for its signed distributions over arbitrary descent classes. The statistic is analogous to the classical Coxeter length…

Combinatorics · Mathematics 2013-03-06 Alexander Stasinski , Christopher Voll

A conjecture by Deutsch, Kitaev, and Remmel states that the triples of permutation statistics $(S_{10}, S_{12}, S_{17})$ and $(S_{12}, S_{10} ,S_{17})$ are equidistributed over the symmetric group $\mathfrak{S}_n$. Here, $S_{10}$ enumerates…

Combinatorics · Mathematics 2026-03-17 Umesh Shankar

In this article we consider the cycle structure of compositions of pairs of involutions in the symmetric group S_n chosen uniformly at random. These can be modeled as modified 2-regular graphs, giving rise to exponential generating…

Combinatorics · Mathematics 2009-11-19 Michael Lugo