We consider three bivariate polynomial invariants , , and for rooted trees, as well as a trivariate polynomial invariant . These invariants are motivated by random destruction processes such as the random cutting model or site percolation on rooted trees. We exhibit recursion formulas for the invariants and identities relating , , and . The main result states that the invariants and are complete, that is they distinguish rooted trees (in fact, even rooted forests) up to isomorphism. The proof method relies on the obtained recursion formulas and on irreducibility of the polynomials in suitable unique factorization domains. For , we provide counterexamples showing that it is not complete, although that question remains open for the trivariate invariant .

生成讲解博客的中文版本

生成AI智能校验的中文版本