Pith. sign in

REVIEW

Refined enumeration of vertices among all rooted ordered $d$-trees

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

arxiv 1806.06417 v1 pith:WEDBFB5K submitted 2018-06-17 math.CO

classification math.CO
keywords orderedrootedtreesverticescardinalitiesedgesenumerateenumeration
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

In this paper we enumerate the cardinalities for the set of all vertices of outdegree $\ge k$ at level $\ge \ell$ among all rooted ordered $d$-trees with $n$ edges. Our results unite and generalize several previous works in the literature.

Discussion (0). Continue with ORCID to comment.

Pith tools