Pith. sign in

REVIEW

Polynomial invariants for rooted trees related to their random destruction

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2302.08394 v3 pith:XCR2MZYR submitted 2023-02-16 math.CO math.PR

classification math.COmath.PR
keywords invariantsrootedtreespolynomialrandomcompletedestructionformulas
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

We consider three bivariate polynomial invariants $P$, $A$, and $S$ for rooted trees, as well as a trivariate polynomial invariant $M$. 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 $P$, $S$, and $M$. The main result states that the invariants $P$ and $S$ 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 $A$, we provide counterexamples showing that it is not complete, although that question remains open for the trivariate invariant $M$.

Discussion (0). Continue with ORCID to comment.

Pith tools