Bijections around Springer numbers
Combinatorics
2025-01-03 v1
Abstract
Arnol'd proved in 1992 that Springer numbers enumerate the Snakes, which are type analogs of alternating permutations. Chen, Fan and Jia in 2011 introduced the labeled ballot paths and established a ``hard'' bijection with snakes. Callan conjectured in 2012 and Han--Kitaev--Zhang proved recently that rc-invariant alternating permutations are counted by Springer numbers. Very recently, Chen--Fang--Kitaev--Zhang investigated multi-dimensional permutations and proved that weakly increasing -dimensional permutations are also counted by Springer numbers. In this work, we construct a sequence of ``natural'' bijections linking the above four combinatorial objects.
Cite
@article{arxiv.2501.00335,
title = {Bijections around Springer numbers},
author = {Shaoshi Chen and Yang Li and Zhicong Lin and Sherry H. F. Yan},
journal= {arXiv preprint arXiv:2501.00335},
year = {2025}
}
Comments
7 pages