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.016zbMATH Open1305.05229arXiv1404.4889OpenAlexW2003465872MaRDI QIDQ482198FDOQ482198

Angela S. Hicks, Emily Sergel Leven

Publication date: 19 December 2014

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

Abstract: Recent results have placed the classical shuffle conjecture of Haglund et al. in a broader context of an infinite family of conjectures about parking functions in any rectangular lattice. The combinatorial side of the new conjectures has been defined using a complicated generalization of the dinv statistic which is composed of three parts and which is not obviously non-negative. Here we simplify the definition of dinv, prove that it is always non-negative, and give a geometric description of the statistic in the style of the classical case. We go on to show that in the n x (n+1) lattice, parking functions satisfy a fermionic formula that is similar to the one given in the classical case by Haglund and Loehr.

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

Recommendations

• Combinatorics of Tesler matrices in the theory of parking functions and diagonal harmonics
• \(G\)-parking functions and tree inversions
• Non-commutative Frobenius characteristic of generalized parking functions. Application to enumeration
• Enumeration of \((p,q)\)-parking functions
• Generalized tree inversions and \(k\)-parking functions
• scientific article; zbMATH DE number 1182849
• Parking functions and tree inversions revisited
• On the enumeration of generalized parking functions
• A symmetry on parking functions via Dyck paths
• Generalized parking functions, tree inversions, and multicolored graphs

zbMATH Keywords

rational parking functionsshuffle conjecturediagonal 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• The Shuffle Algebra Revisited
• Refined knot invariants and Hilbert schemes
• An Occupancy Discipline and Applications
• The elliptic Hall algebra, Cherednik Hecke algebras and Macdonald polynomials
• Title not available (Why is that?)
• A positivity result in the theory of Macdonald polynomials
• Some remarkable new plethystic operators in the theory of Macdonald polynomials
• Title not available (Why is that?)
• Compositional (km,kn)-Shuffle Conjectures

Cited In (5)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q482198)