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 stat. Given a permutation pi, let des(pi) denote the descent number of pi and maj(pi) denote the major index of pi. Babson and Steingr'{i}msson conjectured that (des,stat) and (des,maj) are equidistributed on Sn. 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.


Summary: \textit{E. Babson} and \textit{E. Steingrímsson} [Sémin. Lothar. Comb. 44, B44b, 18 p. (2000; Zbl 0957.05010)] 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 \(stat\). Given a permutation \(\pi\), let \(des(\pi)\) denote the descent number of \(\pi\) and \(maj(\pi)\) denote the major index of \(\pi\). Babson and Steingrímsson conjectured that \((des,stat)\) and \((des,maj)\) are equidistributed on \(S_n\). \textit{D. Foata} and \textit{D. Zeilberger} [Adv. Appl. Math. 27, No. 2--3, 390--404 (2001; Zbl 0994.05006)] settled this conjecture using \(q\)-enumeration, generating functions and Maple packages ROTA and PERCY. Later, \textit{A. Burstein} [``On joint distribution of adjacencies, descents and some Mahonian statistics, in: 22nd International Conference on Formal Power Series and Algebraic Combinatorics, Discrete Math. Theor. Comput. Sci. Proc., AN, 601--611 (2010); \url{https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAN0141/3158.html}] provided a bijective proof of a refinement of this conjecture. In this paper, we give a new bijective proof of this conjecture.





Describes a project that uses

Uses Software






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)