English
Related papers

Related papers: On some colored Eulerian quasisymmetric functions

200 papers

We investigate quasisymmetric functions coming from combinatorial Hopf monoids. We show that these invariants arise naturally in Ehrhart theory, and that some of their specializations are Hilbert functions for relative simplicial complexes.…

Combinatorics · Mathematics 2016-04-04 Jacob White

A classical result of MacMahon shows that the length function and the major index are equi-distributed over the symmetric group. Foata and Sch\"utzenberger gave a remarkable refinement and proved that these parameters are equi-distributed…

Combinatorics · Mathematics 2007-05-23 R. M. Adin , F. Brenti , Y. Roichman

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

We develop a quasisymmetric analogue of the combinatorial theory of Schubert polynomials and the associated divided difference operators. Our counterparts are "forest polynomials", and a new family of linear operators, whose theory of…

Combinatorics · Mathematics 2026-02-03 Philippe Nadeau , Hunter Spink , Vasu Tewari

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

Visontai conjectured in 2013 that the joint distribution of ascent and distinct nonzero value numbers on the set of subexcedant sequences is the same as that of descent and inverse descent numbers on the set of permutations. This conjecture…

Discrete Mathematics · Computer Science 2016-06-28 Jean-Luc Baril , Vincent Vajnovszki

We study the joint distribution of descents and inverse descents over the set of permutations of n letters. Gessel conjectured that the two-variable generating function of this distribution can be expanded in a given basis with nonnegative…

Combinatorics · Mathematics 2013-03-21 Mirkó Visontai

The $k$-arrangements are permutations whose fixed points are $k$-colored. We prove enumerative results related to statistics and patterns on $k$-arrangements, confirming several conjectures by Blitvi\'c and Steingr\'imsson. In particular,…

Combinatorics · Mathematics 2020-05-14 Shishuo Fu , Guo-Niu Han , Zhicong Lin

Gravitationally collapsed objects are known to be biased tracers of an underlying density contrast. Using symmetry arguments, generalised biasing schemes have recently been developed to relate the halo density contrast $\delta_h$ with the…

Cosmology and Nongalactic Astrophysics · Physics 2018-02-14 Dipak Munshi

We find a combinatorial interpretation of Shareshian and Wachs' $q$-binomial-Eulerian polynomials, which leads to an alternative proof of their $q$-$\gamma$-positivity using group actions. Motivated by the sign-balance identity of…

Combinatorics · Mathematics 2020-05-18 Zhicong Lin , David G. L. Wang , Jiang Zeng

Tatsuyuki Hikita recently proved the Stanley--Stembridge conjecture using probabilistic methods, showing that the chromatic symmetric functions of unit interval graphs are $e$-positive. Finding a combinatorial interpretation for these…

Combinatorics · Mathematics 2026-02-18 Isaiah Siegl

We define vertex-colourings for edge-partitioned digraphs, which unify the theory of P-partitions and proper vertex-colourings of graphs. We use our vertex-colourings to define generalized chromatic functions, which merge the chromatic…

Combinatorics · Mathematics 2023-06-28 Farid Aliniaeifard , Shu Xiao Li , Stephanie van Willigenburg

We discover new linear relations between the chromatic symmetric functions of certain sequences of graphs and apply these relations to find new families of e-positive unit interval graphs. Motivated by the results of Gebhard and Sagan, we…

Combinatorics · Mathematics 2024-12-24 Farid Aliniaeifard , Victor Wang , Stephanie van Willigenburg

We introduce analogues of the Hopf algebra of Free quasi-symmetric functions with bases labelled by colored permutations. As applications, we recover in a simple way the descent algebras associated with wreath products $\Gamma\wr\SG_n$ and…

Combinatorics · Mathematics 2007-05-23 Jean-Christophe Novelli , Jean-Yves Thibon

Carlitz and Scoville in 1973 considered a four variable polynomial that enumerates permutations in $\mathfrak{S}_n$ with respect to the parity of its descents and ascents. In recent work, Pan and Zeng proved a $q$-analogue of…

Combinatorics · Mathematics 2026-04-10 Hiranya Kishore Dey , Umesh Shankar , Sivaramakrishnan Sivasubramanian

Permutation statistics constitute a classical subject of enumerative combinatorics. In her study of the genus zeta function, Denert discovered a new Mahonian statistic for permutations, which is called the Denert's statistic ({\bf $\den$})…

Combinatorics · Mathematics 2026-01-29 Kaimei Huang , Yongzhou Wen , Sherry H. F. Yan

Let $T$ be an unrooted tree. The \emph{chromatic symmetric function} $X_T$, introduced by Stanley, is a sum of monomial symmetric functions corresponding to proper colorings of $T$. The \emph{subtree polynomial} $S_T$, first considered…

Combinatorics · Mathematics 2011-10-05 Jeremy L. Martin , Matthew Morin , Jennifer D. Wagner

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

Schur functions are a basis of the symmetric function ring that represent Schubert cohomology classes for Grassmannians. Replacing the cohomology ring with $K$-theory yields a rich combinatorial theory of inhomogeneous deformations, where…

Combinatorics · Mathematics 2023-05-19 Logan Crew , Oliver Pechenik , Sophie Spirkl

Given an $n$-vertex digraph $D$ and a labeling $\sigma:V(D)\to [n]$, we say that an arc $u\to v$ of $D$ is a descent of $\sigma$ if $\sigma(u)>\sigma(v)$. Foata and Zeilberger introduced a generating function $A_D(t)$ for labelings of $D$…

Combinatorics · Mathematics 2023-09-20 Kyle Celano , Nicholas Sieger , Sam Spiro
‹ Prev 1 3 4 5 6 7 10 Next ›