A new bijective proof of Babson and Steingr\'{\i}msson's conjecture
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.
Keywords
Cite
@article{arxiv.1701.08044,
title = {A new bijective proof of Babson and Steingr\'{\i}msson's conjecture},
author = {Joanna N. Chen and Shouxiao Li},
journal= {arXiv preprint arXiv:1701.08044},
year = {2017}
}