A refinement for ordered labeled trees
Abstract
Let On be the set of ordered labeled trees on 0,...,n. A maximal decreasing subtree of an ordered labeled tree is defined by the maximal ordered subtree from the root with all edges being decreasing. In this paper, we study a new refinement On,k of On, which is the set of ordered labeled trees whose maximal decreasing subtree has k+1 vertices.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.