𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Skew Diagrams and Ordered Trees

✍ Scribed by Robert G. Rieper; Melkamu Zeleke


Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
125 KB
Volume
27
Category
Article
ISSN
0196-8858

No coin nor oath required. For personal study only.

✦ Synopsis


We use a known combinatorial argument to prove that among all ordered trees the ratio of the total number of vertices to leaves is two. We introduce a new combinatorial bijection on the set of these trees that shows why this must be so. Ordered trees are then enumerated by number of leaves, total path length, and number of vertices to obtain q-analogs of Catalan numbers. The results on ordered trees are then readily transferred by the skew diagrams to help enumerate parallelogram polyominoes by their area, perimeter, and other statistics.


πŸ“œ SIMILAR VOLUMES


Ordered trees and non-crossing partition
✍ Nachum Dershowitz; Shmuel Zaks πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 229 KB

of non-crossing partitions.

Skew chain orders and sets of rectangles
✍ Douglas B. West; Daniel J. Kleitman πŸ“‚ Article πŸ“… 1979 πŸ› Elsevier Science 🌐 English βš– 451 KB
A Bijection on Ordered Trees and Its Con
✍ Emeric Deutsch πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 214 KB

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.