Year-end Sale % OFF 
Abstract
In this note, we introduce a statistic on Motzkin paths that describes the rank generating function of Bruhat order for involutions. Our proof relies on a bijection introduced by P. Biane from permutations to certain labeled Motzkin paths and a recently introduced interpretation of this rank generating function in terms of visible inversions. By restricting our identity to fixed-point-free (FPF) involutions, we recover an identity due to L. Billera, L. Levine and K. Mészáros with a previous bijective proof by M. Watson. Our work sheds new light on the Ethiopian dinner game.
Submitted Version (
Free)
Published Version
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.
