Abstract
Macdonald has defined a two-parameter refinement of the Kostka matrix, denoted K λ , μ ( q , t ) {K_{\lambda ,\mu }}(q,t) . The entries are rational functions of q and t, but he has conjectured that they are in fact polynomials with nonnegative integer coefficients. We prove two results that support this conjecture. First, we prove that if μ \mu is a partition with at most two columns (or at most two rows), then K λ , μ ( q , t ) {K_{\lambda ,\mu }}(q,t) is indeed a polynomial. Second, we provide a combinatorial interpretation of K λ , μ ( q , t ) {K_{\lambda ,\mu }}(q,t) for the case in which μ \mu is a hook. This interpretation proves in this case that not only are the entries polynomials, but also that their coefficients are nonnegative integers.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.