most citedMeasure rigidity and -adic Littlewood-type problems

4 citations

Showing math.COShow all

6 papers · 1 filter

math.CO2005

Enriched -partitions and peak algebras

T. Kyle Petersen

We develop a more general view of Stembridge's enriched -partitions and use this theory to outline the structure of peak algebras for the symmetric group and the hyperoctahedral…

math.CO2004

A Short Proof of the Zeilberger-Bressoud -Dyson Theorem

Ira M. Gessel, Guoce Xin

We give a formal Laurent series proof of Andrews's -Dyson Conjecture, first proved by Zeilberger and Bressoud.

math.CO2004

A combinatorial proof of Postnikov's identity and a generalized enumeration of labeled trees

Seunghyun Seo

In this paper, we give a simple combinatorial explanation of a formula of A. Postnikov relating bicolored rooted trees to bicolored binary trees. We also present generalized formul…

math.CO20041 cited

A Residue Theorem for Malcev-Neumann Series

Guoce Xin

In this paper, we establish a residue theorem for Malcev-Neumann series that requires few constraints, and includes previously known combinatorial residue theorems as special cases…

math.CO2004

Cyclic descents and P-partitions

T. Kyle Petersen

Louis Solomon showed that the group algebra of the symmetric group has a subalgebra called the descent algebra, generated by sums of permutations with a given de…

math.CO20041 cited

A triple lacunary generating function for Hermite polynomials

Ira M. Gessel, Pallavi Jayawant

Some of the classical orthogonal polynomials such as Hermite, Laguerre, Charlier, etc. have been shown to be the generating polynomials for certain combinatorial objects. These com…