A combinatorial bijection on di-sk trees
Shishuo Fu, Zhicong Lin, Yaling Wang

TL;DR
This paper constructs a combinatorial bijection on di-sk trees, revealing new distributional symmetries of permutation statistics and providing alternative proofs for known equidistribution results in pattern-avoiding permutations.
Contribution
It introduces a novel bijection on di-sk trees that demonstrates distributional equivalences of permutation statistics, offering new insights and alternative proofs for classical results.
Findings
The bijection proves the equidistribution of certain permutation statistic quintuples.
Specialization to 312-avoiding permutations yields an alternative proof of a known equidistribution result.
Additional results on tree traversal statistics are presented.
Abstract
A di-sk tree is a rooted binary tree whose nodes are labeled by or , and no node has the same label as its right child. The di-sk trees are in natural bijection with separable permutations. We construct a combinatorial bijection on di-sk trees proving the two quintuples and have the same distribution over separable permutations. Here for a permutation , is the set of values of the left-to-right maxima/minima of and is the set of descent bottoms of , while and are respectively the number of components of and the length of initial ascending run of . Interestingly, our bijection specializes to a bijection on -avoiding permutations, which provides (up to the classical {\em Knuth--Richards bijection}) an…
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 · Algorithms and Data Compression · Bayesian Methods and Mixture Models
