Abstract
Babson and Steingrı́msson have recently introduced seven new permutation statistics, that they conjectured were all Mahonian (i.e., equi-distributed with the number of inversions). We prove their conjecture for the first four and also prove that the first and the fourth are even Euler–Mahonian. We use two different, in fact, opposite, techniques. For three of them we give a computer-generated proof, using the Maple package ROTA, that implements the second author's “Umbral Transfer Matrix Method.” For the fourth one a geometric permutation transformation is used that leads to a further refinement of this Euler–Mahonian distribution study.
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.
