English
Related papers

Related papers: Euler-Mahonian triple set-valued statistics on per…

200 papers

The Springer numbers, introduced by Arnold, are generalizations of Euler numbers in the sense of Coxeter groups. They appear as the row sums of a double triangular array $(v_{n,k})$ of integers, $1\leq|k|\leq n$, defined recursively by a…

Combinatorics · Mathematics 2023-10-10 Sen-Peng Eu , Louis Kao

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

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

Permutation statistics $\wnm$ and $\rlm$ are both arising from permutation tableaux. $\wnm$ was introduced by Chen and Zhou, which was proved equally distributed with the number of unrestricted rows of a permutation tableau. While $\rlm$ is…

Combinatorics · Mathematics 2021-02-16 Joanna N. Chen

We introduce the notion of a Mahonian pair. Consider the set, P^*, of all words having the positive integers as alphabet. Given finite subsets S,T of P^*, we say that (S,T) is a Mahonian pair if the distribution of the major index, maj,…

Combinatorics · Mathematics 2011-11-03 Bruce E. Sagan , Carla D. Savage

We derive explicit formulas for the matroidal mixed Eulerian numbers. We resolve a question posed by Berget, Spink, and Tseng, demonstrating that the invariant defined by matroidal mixed Eulerian numbers is precisely equivalent to Derksen's…

Algebraic Geometry · Mathematics 2025-02-10 Gaku Liu , Mateusz Michałek , Julian Weigert

An involution is a bijection that is its own inverse. Given a permutation $\sigma$ of $[n],$ let $\mathsf{invol}(\sigma)$ denote the number of ways $\sigma$ can be expressed as a composition of two involutions of $[n].$ We prove that the…

Combinatorics · Mathematics 2025-08-22 Charles Burnette

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

We formulate an abstract notion of equidistribution for families of $\lambda$-probability spaces parameterized by admissible $\mathbb{Z}$-sets. Under the assumption of equidistribution, we show that the $\sigma$-moment generating functions…

Number Theory · Mathematics 2025-06-02 Matthew Bertucci , Sean Howe

Random integers, sampled uniformly from $[1,x]$, share similarities with random permutations, sampled uniformly from $S_n$. These similarities include the Erd\H{o}s--Kac theorem on the distribution of the number of prime factors of a random…

Number Theory · Mathematics 2024-10-04 Dor Elboim , Ofir Gorodetsky

The combinatorial theory for the set of parity alternating permutations is expounded. In view of the numbers of ascents and inversions, several enumerative aspects of the set are investigated. In particular, it is shown that signed Eulerian…

Combinatorics · Mathematics 2017-06-13 Shinji Tanimoto

We introduce iterated beta integrals, a new class of iterated integrals on the universal abelian covering of the punctured projective line that unifies hyperlogarithms and classical beta integrals while preserving their fundamental…

Number Theory · Mathematics 2026-03-27 Minoru Hirose , Nobuo Sato

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

We use recurrences (alias difference equations) to prove the longstanding conjecture that the two most important permutation statistics, namely the number of inversions and the major index, are asymptotically joint-independently-normal. We…

Combinatorics · Mathematics 2011-02-08 Andrew Baxter , Doron Zeilberger

The Euler-Maclaurin summation formula is generalized to a modified form by expanding the periodic Bernoulli polynomials as its Fourier series and taking cuts, which includes both the Euler-Maclaurin summation formula and the Poission…

Mathematical Physics · Physics 2021-07-07 Jihong Guo , Yunpeng Liu

We give a direct combinatorial proof of the $q,t$-symmetry relation $\tilde H_{\mu}(X;q,t)=\tilde H_{\mu'}(X;t,q)$ in the Macdonald polynomials $\tilde H_\mu$ at the specialization $q=1$. The bijection demonstrates that the Macdonald inv…

Combinatorics · Mathematics 2016-11-22 Maria Gillespie , Ryan Kaliszewski , Jennifer Morse

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 derive a formula expressing the joint distribution of the cyclic valley number and excedance number statistics over a fixed conjugacy class of the symmetric group in terms of Eulerian polynomials. Our proof uses a slight extension of Sun…

Combinatorics · Mathematics 2020-01-17 M. Crossan Cooper , William S. Jones , Yan Zhuang

In this paper, we introduce an inversion statistic on the hyperoctahedral group $B_n$ by using an decomposition of a positive root system of this reflection group. Then we prove some combinatorial properties for the inversion statistic. We…

Combinatorics · Mathematics 2023-07-21 Hasan Arslan , Alnour Altoum , Hilal Karakus Arslan

We consider the two permutation statistics which count the distinct pairs obtained from the last two terms of occurrences of patterns t_1...t_{m-2}m(m-1) and t_1...t_{m-2}(m-1)m in a permutation, respectively. By a simple involution in…

Combinatorics · Mathematics 2007-05-23 Astrid Reifegerste
‹ Prev 1 8 9 10 Next ›