2000
DOI: 10.1006/jcta.1999.3027
|View full text |Cite
|
Sign up to set email alerts
|

A Bijection on Ordered Trees and Its Consequences

Abstract: A bijection is introduced in the set of all ordered trees having n edges from which one derives that, for each positive integer q, the parameters "number of nodes of degree q" and "number of odd-level nodes of degree q-1" are equidistributed.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
12
0

Year Published

2004
2004
2022
2022

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(12 citation statements)
references
References 14 publications
0
12
0
Order By: Relevance
“…Figure 2 gives an example of the bijection ϕ. The following corollary which is implied in [4] can be obtained as well. Proof.…”
Section: Consequencesmentioning
confidence: 69%
See 3 more Smart Citations
“…Figure 2 gives an example of the bijection ϕ. The following corollary which is implied in [4] can be obtained as well. Proof.…”
Section: Consequencesmentioning
confidence: 69%
“…Therefore, the Schmitt-Waterman bijection maps an RNA secondary structure with k isolated bases to a plane tree with k leaves. Thus, combined with our bijection φ, with RNA secondary structures serving as intermediate objects, we immediately obtain the following well-known result [4].…”
Section: Consequencesmentioning
confidence: 75%
See 2 more Smart Citations
“…1 Introduction There are several bijections on Dyck paths in the literature [1,2,3,4,5,6,7,8,9,10,11], usually introduced to show the equidistribution of statistics: if a bijection sends statistic A to statistic B, then clearly both have the same distribution. Another aspect of such a bijection is its cycle structure considered as a permutation on Dyck paths.…”
mentioning
confidence: 99%