𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Achiral plane trees

✍ Scribed by Nicholas Wormald


Publisher
John Wiley and Sons
Year
1978
Tongue
English
Weight
899 KB
Volume
2
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

Harary and Robinson showed that the number a~n~ of achiral planted plane trees with n points coincides with the number p~n~ of achiral plane trees with n points, for n β©Ύ 2. They posed the problem of finding a natural structural correspondence which explains this coincidence. In the present paper this problem is answered by constructing two‐to‐one correspondences from certain sets of binary sequences to each of the sets of trees concerned, giving a structural basis for the equation 2__a__~n~ = 2__p__~n~. Answers are also supplied to similar correspondence‐type problems of Harary and Robinson, concerning planted plane trees, and achiral rooted plane trees. In addition, each of these four types of plane trees are counted with numbers of points and endpoints as the enumeration parameters. The results all show a symmetry with respect to the number of endpoints which is not shared by the set of all plane trees.


πŸ“œ SIMILAR VOLUMES


Geometry of plane trees
✍ Yu. Yu. Kochetkov πŸ“‚ Article πŸ“… 2009 πŸ› Springer US 🌐 English βš– 168 KB
Plane trees and Shabat polynomials
✍ Jean BΓ©trΓ©ma; Alexander Zvonkin πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 538 KB

In his unpublished paper [7] Alexandre Grothendieck has indicated that there exist profound relations between the theory of number fields and that of maps on two-dimensional surfaces. This theme was later explored by George Shabat (Moscow) and his students (see [1,2,11,12,14,16]). For the simplest

Efficient generation of plane trees
✍ Shin-ichi Nakano πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 96 KB

A rooted plane tree is a rooted tree with a left-to-right ordering specified for the children of each vertex. In this paper we give a simple algorithm to generate all rooted plane trees with at most n vertices. The algorithm uses O(n) space and generates such trees in O(1) time per tree without dupl

Plane trees and classical mathematics
✍ N. M. Adrianov; G. B. Shabat πŸ“‚ Article πŸ“… 1996 πŸ› Springer US 🌐 English βš– 348 KB
Some properties of plane rooted trees
✍ I. V. Konoval'tsev; E. P. Lipatov πŸ“‚ Article πŸ“… 1973 πŸ› Springer US 🌐 English βš– 340 KB