REVIEW
A Generalized Enumeration of Labeled Trees and Reverse Pr\"ufer Algorithm
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
A Generalized Enumeration of Labeled Trees and Reverse Pr\"ufer Algorithm
read the original abstract
A {\em leader} of a tree $T$ on $[n]$ is a vertex which has no smaller descendants in $T$. Gessel and Seo showed $$\sum_{T \in \mathcal{T}_n}u^\text{(# of leaders in $T$)} c^\text{(degree of 1 in $T$)}=u P_{n-1}(1,u,cu),$$ which is a generalization of Cayley formula, where $\mathcal{T}_n$ is the set of trees on $[n]$ and $$P_n(a,b,c)=c\prod_{i=1}^{n-1}(ia+(n-i)b+c).$$ Using a variation of Pr\"ufer code which is called a {\em RP-code}, we give a simple bijective proof of Gessel and Seo's formula.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.