Abstract
We describe a general machine for constructing statistics on words with a certain recursive structure. The classical Mahonian statistics, major index and inversion number, are examples, as are more modern Mahonian statistics, including those of Zeilberger and Bressoud, Denert, Han, Rawlings and Kadell. We give simple recursive procedures for calculating these statistics, as well as statistic-preserving bijections among them. We also describe other non-Mahonian distributions with similar recursive structures.
Sign-in/Register to access full text options 
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.
