Abstract
We generalize the author’s formula (2011) on weighted counting of inversions on permutations to one on alternating sign matrices. The proof is based on the sequential construction of alternating sign matrices from the unit matrix which essentially follows from the earlier work of Lascoux-Schützenberger (1996).
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.