Search arXivSearch

arXiv · math/0211095

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 {\it finer} than the quantity $α(T)=|\text{Aut}(T)|$ of rooted trees $T$. We also consider the generating function $U(q)=\sum_{n=1}^\infty U_n q^n$ with $U_n =\sum_{T\in \bT_n} \frac 1{α(T)} Ψ(T)$, where $\bT_n$ is the set of rooted trees with $n$ vertices. We show that the generating function $U(q)$ satisfies the equation $Ξ\exp U(q)= q^{-1} U(q)$. Consequently, we get a recurrent formula for $U_n$ $(n\geq 1)$, namely, $U_1=Ξ(1)$ and $U_n =ΞS_{n-1}(U_1, U_2, >..., U_{n-1})$ for any $n\geq 2$, where $S_n(x_1, x_2, ...)$ $(n\in \bN)$ 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 $\mathcal H_{P, R}^D$ in \cite{F} spanned by labeled planar forests.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wenhua Zhao. 2003-05-24. A Family of Invariants of Rooted Forests. https://arxiv.org/abs/math/0211095

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO