Abstract
In 2010, the first author introduced a combinatorial model for Schur polynomials based on labeled abaci. We generalize this construction to give analogous models for the Hall–Littlewood symmetric polynomials Pλ, Qλ, and Rλ using objects called abacus-tournaments. We introduce various cancellation mechanisms on abacus-tournaments to obtain simpler combinatorial formulas and explain why these polynomials are divisible by certain products of t-factorials. These tools are then applied to give bijective proofs of several identities involving Hall–Littlewood polynomials, including the Pieri rule that expands the product Pμek into a linear combination of Hall–Littlewood polynomials.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
