Bijections for ternary trees and non-crossing trees (Q1613443): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q127087532, #quickstatements; #temporary_batch_1721910495864 |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Prodinger, Helmut / rank | |||
| Property / author | |||
| Property / author: Prodinger, Helmut / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127087532 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 13:29, 25 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bijections for ternary trees and non-crossing trees |
scientific article |
Statements
Bijections for ternary trees and non-crossing trees (English)
0 references
29 August 2002
0 references
Consider the set \(P_n\) of the vertices of a regular \(n\)-gon. A non-crossing tree is a connected acyclic graph with vertex set \(P_n\) whose edges are straight line segments that do not cross. Using the idea of rotation correspondence the authors establish a new bijection between the set of non-crossing trees of size \(n+1\) and the set of ternary trees of size \(n\). Furthermore two bijective proofs for a recurrence relation for the number of ternary trees of fixed size are presented.
0 references
trees
0 references
bijections
0 references
