English
Related papers

Related papers: Symmetric decompositions and Euler-Stirling statis…

200 papers

Eulerian quasisymmetric functions were introduced by Shareshian and Wachs in order to obtain a q-analog of Euler's exponential generating function formula for the Eulerian numbers. They are defined via the symmetric group, and applying the…

Combinatorics · Mathematics 2012-05-07 Matthew Hyatt

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

The Eulerian idempotents, first introduced for the symmetric group and later extended to all reflection groups, generate a family of representations called the Eulerian representations that decompose the regular representation. In Type $A$,…

Combinatorics · Mathematics 2022-01-07 Sarah Brauner

In this paper, we consider the number of occurrences of descents, ascents, 123-subwords, 321-subwords, peaks and valleys in flattened permutations, which were recently introduced by Callan in his study of finite set partitions. For descents…

Combinatorics · Mathematics 2013-07-16 Toufik Mansour , Mark Shattuck , David G. L. Wang

Let $S_r(p,q)$ be the $r$-associated Stirling numbers of the second kind, the number of ways to partition a set of size $p$ into $q$ subsets of size at least $r$. For $r=1$, these are the standard Stirling numbers of the second kind, and…

Combinatorics · Mathematics 2024-09-04 E. Rodney Canfield , J. William Helton , Jared A. Hughes

This paper is a study of power series, where the coefficients are binomial expressions (iterated finite differences). Our results can be used for series summation, for series transformation, or for asymptotic expansions involving Stirling…

Number Theory · Mathematics 2016-10-10 Khristo N. Boyadzhiev

This paper develops techniques to study the number of descents in random permutations via martingales. We relax an assumption in the Berry-Esseen theorem of Bolthausen (1982) to extend the theorem's scope to martingale differences of…

Probability · Mathematics 2021-03-16 Alperen Y. Özdemir

Let $A(n,m)$ denote the Eulerian numbers, which count the number of permutations on $[n]$ with exactly $m$ descents. It is well known that $A(n,m)$ also counts the number of permutations on $[n]$ with exactly $m$ excedances. In this report,…

Combinatorics · Mathematics 2023-06-22 David Dong

Physical and mathematical applications of fractional Poisson probability distribution have been presented. As a physical application, a new family of quantum coherent states has been introduced and studied. As mathematical applications, we…

Mathematical Physics · Physics 2015-05-13 Nick Laskin

This work deals with a new generalization of $r$-Stirling numbers using $l$-tuple of permutations and partitions called $(l,r)$-Stirling numbers of both kinds. We study various properties of these numbers using combinatorial interpretations…

Combinatorics · Mathematics 2021-01-28 Hacène Belbachir , Yahia Djemmada

It is known that Bernoulli scheme of independent trials with two outcomes is connected with the binomial coefficients. The aim of this paper is to indicate stochastic processes which are connected with the $q$-polynomial coefficients (in…

Combinatorics · Mathematics 2007-05-23 Alexander I. Il'inskii

Starting from some considerations we make about the relations between certain difference statistics and the classical permutation statistics we study permutations whose inversion number and excedance difference coincide. It turns out that…

Combinatorics · Mathematics 2007-05-23 Astrid Reifegerste

This paper shows that a finite discrete convolution involving Stirling numbers of both kinds and harmonic numbers can be expressed in terms of the Bernoulli numbers. As applications of this expression, the linear recurrence relation for the…

Number Theory · Mathematics 2026-02-04 Levent Kargın , Merve Mutluer

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

In 1916, MacMahon showed that permutations in $S_n$ with a fixed descent set $I$ are enumerated by a polynomial $d_I(n)$. Diaz-Lopez, Harris, Insko, Omar, and Sagan recently revived interest in this descent polynomial, and suggested the…

Combinatorics · Mathematics 2020-12-01 Kaarel Hänni

It is known that Euler numbers, defined as the Taylor coefficients of the tangent and secant functions, count alternating permutations in the symmetric group. Springer defined a generalization of these numbers for each finite Coxeter group…

Combinatorics · Mathematics 2018-01-09 Matthieu Josuat-Vergès

We find the exponential generating function for permutations with all valleys even and all peaks odd, and use it to determine the asymptotics for its coefficients, answering a question posed by Liviu Nicolaescu. The generating function can…

Combinatorics · Mathematics 2014-08-11 Ira M. Gessel , Yan Zhuang

We introduce the theory of normal ordered grammars, which gives a natural generalization of the normal ordering problem. To illustrate the main idea, we explore normal ordered grammars associated with the Eulerian polynomials and the…

Combinatorics · Mathematics 2024-04-24 Shi-Mei Ma , Toufik Mansour , Jean Yeh , Yeong-Nan Yeh

The powers of matrices with Stirling number-coefficients are investigated. It is revealed that the elements of these matrices have a number of properties of the ordinary Stirling numbers. Moreover, "higher order" Bell, Fubini and Eulerian…

Combinatorics · Mathematics 2008-12-23 Istvan Mezo

In a paper by Lin an interesting family of semipermutations comes out to index the elements of a cohomology basis of a Hessenberg type variety. The corresponding Betti numbers are a generalization of Eulerian numbers. We show three…

Combinatorics · Mathematics 2026-01-27 Giovanni Gaiffi , Giovanni Interdonato