A proof of the \(\frac{n!}{2}\) conjecture for hook shapes

DOI10.1007/s00026-022-00613-3arXiv2203.15146OpenAlexW4306893288WikidataQ115238747 ScholiaQ115238747MaRDI QIDQ6062819

Sam Armon

Publication date: 6 November 2023

Published in: Annals of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Macdonald polynomialsGarsia-Haiman modules

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Symmetric functions and generalizations (05E05) Symmetric groups (20B30)

Cites Work

• Unnamed Item
• Unnamed Item
• Bitableaux bases for some Garsia-Haiman modules and other related modules
• The combinatorics of the Garsia-Haiman modules for hook shapes
• Monomial bases related to the \(n!\) conjecture
• Factorizations of Pieri rules for Macdonald polynomials
• Some natural bigraded \(S_ n\)-modules and \(q,t\)-Kostka coefficients
• Intersection of modules related to Macdonald's polynomials
• Hilbert schemes, polygraphs and the Macdonald positivity conjecture
• A kicking basis for the two-column Garsia-Haiman modules
• Some Particular Entries of the Two-Parameter Kostka Matrix
• A combinatorial formula for Macdonald polynomials
• A graded representation model for Macdonald's polynomials.
• A combinatorial model for the Macdonald polynomials
• On the Netto Inversion Number of a Sequence

This page was built for publication: A proof of the \(\frac{n!}{2}\) conjecture for hook shapes