A Family of Invariants of Rooted Forests
Abstract
Let A be a commutative k-algebra over a field of k and a linear operator defined on A. We define a family of A-valued invariants for finite rooted forests by a recurrent algorithm using the operator and show that the invariant distinguishes rooted forests if (and only if) it distinguishes rooted trees T, and if (and only if) it is finer than the quantity α (T)=|Aut(T)| of rooted trees T. We also consider the generating function U(q)=Σn=1∞ Un qn with Un =ΣT∈ n 1α (T) (T), where n is the set of rooted trees with n vertices. We show that the generating function U(q) satisfies the equation U(q)= q-1 U(q). Consequently, we get a recurrent formula for Un (n≥ 1), namely, U1=(1) and Un = Sn-1(U1, U2, >..., Un-1) for any n≥ 2, where Sn(x1, x2, ...) (n∈ ) are the elementary Schur polynomials. We also show that the (strict) order polynomials and two well known quasi-symmetric function invariants of rooted forests are in the family of invariants and derive some consequences about these well-known invariants from our general results on . Finally, we generalize the invariant to labeled planar forests and discuss its certain relations with the Hopf algebra HP, RD in F spanned by labeled planar forests.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.