English
Related papers

Related papers: Eulerian quasisymmetric functions and cyclic sievi…

200 papers

We introduce a family of quasisymmetric functions called {\em Eulerian quasisymmetric functions}, which specialize to enumerators for the joint distribution of the permutation statistics, major index and excedance number on permutations of…

Combinatorics · Mathematics 2010-08-24 John Shareshian , Michelle L. Wachs

We introduce a family of quasisymmetric functions called {\em Eulerian quasisymmetric functions}, which have the property of specializing to enumerators for the joint distribution of the permutation statistics, major index and excedance…

Combinatorics · Mathematics 2008-05-19 John Shareshian , Michelle L. Wachs

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

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

The cyclic sieving phenomenon of Reiner, Stanton, and White characterizes the stabilizers of cyclic group actions on finite sets using q-analogue polynomials. Eu and Fu demonstrated a cyclic sieving phenomenon on generalized cluster…

Combinatorics · Mathematics 2021-10-27 Zachary Stier , Julian Wellman , Zixuan Xu

The cyclic sieving phenomenon (CSP) was introduced by Reiner, Stanton, and White to study combinatorial structures with actions of cyclic groups. The crucial step is to find a polynomial, for example a q-analog, that satisfies the CSP…

Combinatorics · Mathematics 2020-03-11 Qingzhong Liang , Grant Bowling

We prove two conjectures of Shareshian and Wachs about Eulerian quasisymmetric functions and polynomials. The first states that the cycle type Eulerian quasisymmetric function $Q_{\lambda,j}$ is Schur-positive, and moreover that the…

Combinatorics · Mathematics 2011-11-10 Anthony Henderson , Michelle L. Wachs

The cyclic sieving phenomenon was defined by Reiner, Stanton, and White in a 2004 paper. Let X be a finite set, C be a finite cyclic group acting on X, and f(q) be a polynomial in q with nonnegative integer coefficients. Then the triple…

Combinatorics · Mathematics 2011-02-10 Bruce E. Sagan

The cyclic sieving phenomenon was introduced by Reiner, Stanton and White in 2004 as a generalization of Stembridge's $q=-1$ phenomenon. In a paper from 2008, Eu and Fu studied many occurrences of this phenomenon on the faces of the…

Combinatorics · Mathematics 2026-03-31 Lucas Pouillart

We present exponential generating function analogues to two classical identities involving the ordinary generating function of the complete homogeneous symmetric functions. After a suitable specialization the new identities reduce to…

Combinatorics · Mathematics 2017-12-01 Rafael S. González D'León

We find a $q$-analog of the following symmetrical identity involving binomial coefficients $\binom{n}{m}$ and Eulerian numbers $A_{n,m}$, due to Chung, Graham and Knuth [{\it J. Comb.}, {\bf 1} (2010), 29--38]: {equation*} \sum_{k\geq…

Combinatorics · Mathematics 2012-04-02 Guoniu Han , Zhicong Lin , Jiang Zeng

We define an analogue of signed Eulerian numbers $f_{n,k}$ for involutions of the symmetric group and derive some combinatorial properties of this sequence. In particular, we exhibit both an explicit formula and a recurrence for $f_{n,k}$…

Combinatorics · Mathematics 2008-03-17 M. Barnabei , F. Bonetti , M. Silimbani

We give a $q$-enumeration of circular Dyck paths, which is a superset of the classical Dyck paths enumerated by the Catalan numbers. These objects have recently been studied by Alexandersson and Panova. Furthermore, we show that this…

Combinatorics · Mathematics 2020-04-21 Per Alexandersson , Svante Linusson , Samu Potka

The Stirling permutations introduced by Gessel-Stanley have recently received considerable attention. Motivated by Ji's work on $(\alpha,\beta)$-Eulerian polynomials (Sci China Math., 2025) and Yan-Yang-Lin's work on $1/k$-Eulerian…

Combinatorics · Mathematics 2025-07-28 Shi-Mei Ma , Jianfeng Wang , Guiying Yan , Jean Yeh , Yeong-Nan Yeh

Let the symmetric functions be defined for the pair of integers $\left( n,r\right) $, $n\geq r\geq 1$, by $p_{n}^{\left( r\right) }=\sum m_{\lambda }$ where $m_{\lambda }$ are the monomial symmetric functions, the sum being over the…

Combinatorics · Mathematics 2025-05-08 Vincent Brugidou

The $(q,r)$-Eulerian polynomials are the $(\maj-$$\exc,\fix,\exc)$ enumerative polynomials of permutations. Using Shareshian and Wachs' exponential generating function of these Eulerian polynomials, Chung and Graham proved two symmetrical…

Combinatorics · Mathematics 2013-03-12 Zhicong Lin

Cyclic sieving is a well-known phenomenon where certain interesting polynomials, especially $q$-analogues, have useful interpretations related to actions and representations of the cyclic group. We propose a definition of sieving for an…

Combinatorics · Mathematics 2023-11-16 Sujit Rao , Joe Suk

We define a new basis of the algebra of quasi-symmetric functions by lifting the cycle-index polynomials of symmetric groups to noncommutative polynomials with coefficients in the algebra of free quasi-symmetric functions, and then…

Combinatorics · Mathematics 2019-03-27 Jean-Christophe Novelli , Jean-Yves Thibon , Frederic Toumazet

Recently, the higher-order q-Euler polynomials and multiple q-Euler zeta functions are introduced by T. Kim ([8, 9]). In this paper, we investigate some symmetric properties of the multiple q-Euler zeta function and derive various…

Number Theory · Mathematics 2013-12-30 Dae San Kim , Taekyun Kim

We introduce a new permutation statistic, namely, the number of cycles of length $q$ consisting of consecutive integers, and consider the distribution of this statistic among the permutations of $\{1,2,...,n\}$. We determine explicit…

Combinatorics · Mathematics 2015-03-17 Richard A. Brualdi , Emeric Deutsch
‹ Prev 1 2 3 10 Next ›