A simpler formula for the number of diagonal inversions of an \((m, n)\)-parking function and a returning fermionic formula

DOI10.1016/j.disc.2014.10.016zbMath1305.05229arXiv1404.4889OpenAlexW2003465872MaRDI QIDQ482198

Angela Hicks, Emily Sergel Leven

Publication date: 19 December 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.4889

zbMATH Keywords

shuffle conjecturerational parking functionsdiagonal inversionsdinvfermionic formula

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of representation theory (05E10) Hilbert-Samuel and Hilbert-Kunz functions; Poincaré series (13D40)

Related Items (4)

Rectangular analogues of the square paths conjecture and the univariate Delta conjecture ⋮ A new plethystic symmetric function operator and the rational compositional shuffle conjecture at \(t=1/q\) ⋮ Rational parking functions and LLT polynomials ⋮ Schur function expansions and the rational shuffle theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some remarkable new plethystic operators in the theory of Macdonald polynomials
• Refined knot invariants and Hilbert schemes
• Compactified Jacobians and \(q,t\)-Catalan numbers. I.
• A combinatorial formula for the character of the diagonal coinvariants
• The elliptic Hall algebra and the \(K\)-theory of the Hilbert scheme of \(\mathbb{A}^{2}\)
• A conjectured combinatorial formula for the Hilbert series for diagonal harmonics
• A positivity result in the theory of Macdonald polynomials
• The Shuffle Algebra Revisited
• The elliptic Hall algebra, Cherednik Hecke algebras and Macdonald polynomials
• Compositional (km,kn)-Shuffle Conjectures
• An Occupancy Discipline and Applications

This page was built for publication: A simpler formula for the number of diagonal inversions of an \((m, n)\)-parking function and a returning fermionic formula