A new bijective proof of Babson and Steingrímsson's conjecture
From MaRDI portal
(Redirected from Publication:528980)
Abstract: Babson and Steingr'{i}msson introduced generalized permutation patterns and showed that most of the Mahonian statistics in the literature can be expressed by the combination of generalized pattern functions. Particularly, they defined a new Mahonian statistic in terms of generalized pattern functions, which is denoted . Given a permutation , let denote the descent number of and denote the major index of . Babson and Steingr'{i}msson conjectured that and are equidistributed on . Foata and Zeilberger settled this conjecture using q-enumeration, generating functions and Maple packages ROTA and PERCY. Later, Burstein provided a bijective proof of a refinement of this conjecture. In this paper, we give a new bijective proof of this conjecture.
Recommendations
Cites work
- A Combinatorial Property of q-Eulerian Numbers
- An Eulerian partner for inversions
- An extension of MacMahon's equidistribution theorem to ordered set partitions
- Babson-Steingrímsson statistics are indeed Mahonian (and sometimes even Euler-Mahonian)
- Generalized permutation patterns and a classification of the Mahonian statistics
- On joint distribution of adjacencies, descents and some Mahonian statistics
- Statistics on wreath products, perfect matchings, and signed words
Cited in
(11)- On joint distribution of adjacencies, descents and some Mahonian statistics
- From \(q\)-Stirling numbers to the ordered multiset partitions: a viewpoint from vincular patterns
- Babson-Steingrímsson statistics are indeed Mahonian (and sometimes even Euler-Mahonian)
- Mahonian STAT on rearrangement class of words
- Generalized permutation patterns and a classification of the Mahonian statistics
- A short proof of a result of Foata and Zeilberger
- Mahonian STAT on words
- A new proof of Bowers-Stephenson conjecture
- Equidistributions of Mahonian statistics over pattern avoiding permutations
- An equivalence of multistatistics on permutations
- An equivalence of multistatistics on permutations
This page was built for publication: A new bijective proof of Babson and Steingrímsson's conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q528980)