Involutions under Bruhat order and labeled Motzkin paths
From MaRDI portal
Publication:2136194
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 Philippe 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 Louis Billera, Lionel Levine and Karola M'esz'aros with a previous bijective proof by Matthew Watson. Our work sheds new light on the Ethiopian dinner game.
Recommendations
Cites work
- scientific article; zbMATH DE number 3943829 (Why is no real title available?)
- A Class of Sequential Games
- A statistic on involutions
- Bruhat order on fixed-point-free involutions in the symmetric group
- Denert's Permutation Statistic Is Indeed Euler‐Mahonian
- How to Make the Most of a Shared Meal: Plan the Last Bite First
- How to decompose a permutation into a pair of labeled Dyck paths by playing a game
- Permutations depending on the exceedance type and the number of inversions and combinatorial interpretation of a continued fraction of Heine
- Restricted involutions and Motzkin paths
- Schur \(P\)-positivity and involution Stanley symmetric functions
- The Bruhat order on symmetric varieties
- The Bruhat order on the involutions of the symmetric group
Cited in
(4)
This page was built for publication: Involutions under Bruhat order and labeled Motzkin paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2136194)