Enumerations of vertices among all rooted ordered trees with levels and degrees
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:EGW6PZO4record.jsonopen to challenge →
classification
math.CO
keywords
leveldegreeell-1orderedrootedtreesverticesbijections
read the original abstract
In this paper we enumerate and give bijections for the following four sets of vertices among rooted ordered trees of a fixed size: (i) first-children of degree $k$ at level $\ell$, (ii) non-first-children of degree $k$ at level $\ell-1$, (iii) leaves having $k-1$ elder siblings at level $\ell$, and (iv) non-leaves of outdegree $k$ at level $\ell-1$. Our results unite and generalize several previous works in the literature.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.