Labeled Ballot Paths and the Springer Numbers
William Y.C. Chen, Neil J.Y. Fan, Jeffrey Y.T. Jia

TL;DR
This paper establishes a bijection between labeled ballot paths and snakes of type B_n, providing new combinatorial interpretations and generating functions for Springer numbers and related structures.
Contribution
It introduces the inversion code of type B_n snakes and links labeled ballot paths with these snakes, offering new combinatorial insights and a specialized bijection.
Findings
Derived a bivariate generating function for B(n,k)
Established a bijection between labeled ballot paths and snakes of type B_n
Connected labeled Dyck paths with alternating permutations
Abstract
The Springer numbers are defined in connection with the irreducible root systems of type , which also arise as the generalized Euler and class numbers introduced by Shanks. Combinatorial interpretations of the Springer numbers have been found by Purtill in terms of Andre signed permutations, and by Arnol'd in terms of snakes of type . We introduce the inversion code of a snake of type and establish a bijection between labeled ballot paths of length n and snakes of type . Moreover, we obtain the bivariate generating function for the number B(n,k) of labeled ballot paths starting at (0,0) and ending at (n,k). Using our bijection, we find a statistic such that the number of snakes of type with equals B(n,k). We also show that our bijection specializes to a bijection between labeled Dyck paths of length 2n and alternating…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Advanced Mathematical Identities · Algorithms and Data Compression
