A Family of Invariants of Rooted Forests
Wenhua Zhao
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.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.