English
Related papers

Related papers: A Simple Proof that Major Index and Inversions are…

200 papers

Arslan, Altoum, and Zaarour introduced an inversion statistic for generalized symmetric groups. In this work, we study the distribution of this statistic over colored permutations, including derangements and involutions. By establishing a…

Combinatorics · Mathematics 2025-05-06 Moussa Ahmia , José L. Ramírez , Diego Villamizar

The goal of this paper is to go further in the analysis of the behavior of the number of descents in a random permutation. Via two different approaches relying on a suitable martingale decomposition or on the Irwin-Hall distribution, we…

Probability · Mathematics 2024-11-20 Bernard Bercu , Michel Bonnefont , Adrien Richou

Two permutations $s$ and $t$ are $k$-similar if they can be decomposed into subpermutations $s^1, \ldots, s^k$ and $t^1, \ldots, t^k$ such that $s^i$ is order-isomorphic to $t^i$ for all $i$. Recently, Dudek, Grytczuk and Ruci\'nski posed…

Combinatorics · Mathematics 2023-01-24 Carla Groenland , Tom Johnston , Dániel Korándi , Alexander Roberts , Alex Scott , Jane Tan

We consider the descent and flag major index statistics on the colored permutation groups, which are wreath products of the form $\mathfrak{S}_{n,r}=\mathbb{Z}_r\wr \mathfrak{S}_n$. We show that the $k$-th moments of these statistics on…

Combinatorics · Mathematics 2025-07-29 Kevin Liu , Mei Yin

Let R(n,k) be the number of permutations of $\{1,2,\ldots,n\}$ with k alternating runs. In this paper, we establish the relationships between R(n,k) and the central factorial numbers of even indices as well as the number of signed…

Combinatorics · Mathematics 2022-03-07 Qi Fang , Ya-Nan Feng , Shi-Mei Ma

The motivation of this paper is to investigate the joint distribution of succession and Eulerian statistics. We first investigate the enumerators for the joint distribution of descents, big ascents and successions over all permutations in…

Combinatorics · Mathematics 2024-01-09 Shi-Mei Ma , Hao Qi , Jean Yeh , Yeong-Nan Yeh

A set of permutations $I \subset S_n$ is said to be {\em k-intersecting} if any two permutations in $I$ agree on at least $k$ points. We show that for any $k \in \mathbb{N}$, if $n$ is sufficiently large depending on $k$, then the largest…

Combinatorics · Mathematics 2017-07-11 David Ellis , Ehud Friedgut , Haran Pilpel

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

In this paper we consider permutations of sequences of partitions, obtaining a result which parallels von Neumann's theorem on permutations of dense sequences and uniformly distributed sequences of points.

Functional Analysis · Mathematics 2009-02-12 Ingrid Carbone , Aljosa Volcic

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

Inspired by work of McKay, Morse, and Wilf, we give an exact count of the involutions in S_n which contain a given permutation \tau in S_k as a subsequence; this number depends on the patterns of the first j values of \tau for 1<=j<=k. We…

Combinatorics · Mathematics 2007-05-23 Aaron D. Jaggard

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

A generalization of the classical statistics ``maj'' and ``inv'' (the major index and number of inversions) on words is introduced, parameterized by arbitrary graphs on the underlying alphabet. The question of characterizing those graphs…

Combinatorics · Mathematics 2008-02-03 Dominique Foata , Doron Zeilberger

Let $n\geq 1$, $0\leq t\leq {n \choose 2}$ be arbitrary integers. Define the numbers $I_n(t)$ as the number of permutations of $[n]$ with $t$ inversions. Let $n,d\geq 1$ and $0\leq t\leq (d-1)n$ be arbitrary integers. Define {\em the…

Combinatorics · Mathematics 2016-10-10 Gábor Hegedüs

A refinement of the multinomial distribution is presented where the number of inversions in the sequence of outcomes is tallied. This refinement of the multinomial distribution is its joint distribution with the number of inversions in the…

Probability · Mathematics 2025-08-19 Andrew V. Sills

As natural generalizations of the descent number ($\des$) and the major index ($\maj$), Rawlings introduced the notions of the $r$-descent number ($r\des$) and the $r$-major index ($r\maj$) for a given positive integer $r$. A pair $(\st_1,…

Combinatorics · Mathematics 2025-01-22 Kaimei Huang , Sherry H. F. Yan

A permutation $\pi \in \mathbb{S}_n$ is $k$-balanced if every permutation of order $k$ occurs in $\pi$ equally often, through order-isomorphism. In this paper, we explicitly construct $k$-balanced permutations for $k \le 3$, and every $n$…

Combinatorics · Mathematics 2023-06-30 Gal Beniamini , Nir Lavee , Nati Linial

Chatteerjee and Diaconis have recently shown the asymptotic normality for the joint distribution of the number of descents and inverse descents in a random permutation. A noteworthy point of their results is that the asymptotic variance of…

Combinatorics · Mathematics 2024-05-24 Luis Fredes , Bernard Bercu , Michel Bonnefont , Adrien Richou

We introduce a notion of {\em cyclic Schur-positivity} for sets of permutations, which naturally extends the classical notion of Schur-positivity, and it involves the existence of a bijection from permutations to standard Young tableaux…

Combinatorics · Mathematics 2019-08-22 Jonathan Bloom , Sergi Elizalde , Yuval Roichman

Let $m, n$ be positive integers such that $m>1$ divides $n$. In this paper, we introduce a special class of piecewise-affine permutations of the finite set $[1, n]:=\{1, \ldots, n\}$ with the property that the reduction $\pmod m$ of $m$…

Number Theory · Mathematics 2020-03-13 Lucas Reis , Sávio Ribas
‹ Prev 1 4 5 6 7 8 10 Next ›