New Equidistributions on Plane Trees and Decompositions of $132$-Avoiding Permutations

Our main results in this paper are new equidistributions on plane trees and $132$-avoiding permutations, two closely related and ubiquitous objects. As for the former, we discover a characteristic for vertices of plane trees that is equally distributed as the height for vertices. The latter is concerned with four distinct ways of decomposing a $132$-avoiding permutation into subsequences. We show combinatorially that the subsequence length distributions of the four decompositions are mutually equal, and there is a way to group the four into two groups such that each group is symmetric and the joint length distribution of one group is the same as that of the other. Some consequences are discussed. For instance, we provide a new refinement of the fundamental equidistribution of internal vertices and leaves, and present new sets of $132$-avoiding permutations that are counted by the Motzkin numbers and their refinements.

Authors

Institutions

Publication Details

Journal
The Electronic Journal of Combinatorics
Published
2024-09-05
DOI
https://doi.org/10.37236/11867
Citations
1
Primary Topic
graph theory and CDMA systems
Type
article
Field-Weighted Citation Impact
0.21

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

New Equidistributions on Plane Trees and Decompositions of $132$-Avoiding Permutations

Ricky X. F. Chen, Zi-Wei Bai
1 citations
The Electronic Journal of Combinatorics
graph theory and CDMA systems
0.21
article

New Equidistributions on Plane Trees and Decompositions of $132$-Avoiding Permutations

Ricky X. F. Chen, Zi-Wei Bai
article en
1 citations

Abstract

Our main results in this paper are new equidistributions on plane trees and $132$-avoiding permutations, two closely related and ubiquitous objects. As for the former, we discover a characteristic for vertices of plane trees that is equally distributed as the height for vertices. The latter is concerned with four distinct ways of decomposing a $132$-avoiding permutation into subsequences. We show combinatorially that the subsequence length distributions of the four decompositions are mutually equal, and there is a way to group the four into two groups such that each group is symmetric and the joint length distribution of one group is the same as that of the other. Some consequences are discussed. For instance, we provide a new refinement of the fundamental equidistribution of internal vertices and leaves, and present new sets of $132$-avoiding permutations that are counted by the Motzkin numbers and their refinements.

The Electronic Journal of CombinatoricsVol. 31(3)
Hefei University of Technology (CN)
National Natural Science Foundation of China, Natural Science Foundation of Anhui Province
Openalex Percentile: Top 49%
graph theory and CDMA systems
0.21
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.