Polynomial Invariants for Rooted Trees Related to Their Random Destruction

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$.

Authors

Institutions

Publication Details

Journal
The Electronic Journal of Combinatorics
Published
2024-11-15
DOI
https://doi.org/10.37236/11975
Citations
1
Primary Topic
Stochastic processes and statistical mechanics
Type
article
Field-Weighted Citation Impact
0.89

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Polynomial Invariants for Rooted Trees Related to Their Random Destruction

Fabian Burghart
1 citations
The Electronic Journal of Combinatorics
Stochastic processes and statistical mechanics
0.89
article

Polynomial Invariants for Rooted Trees Related to Their Random Destruction

Fabian Burghart
article en
1 citations

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$.

The Electronic Journal of CombinatoricsVol. 31(4)
Eindhoven University of Technology (NL)
European Commission, Knut och Alice Wallenbergs Stiftelse, Vetenskapsrådet, Uppsala Universitet
Life in Land
Openalex Percentile: Top 26%
Stochastic processes and statistical mechanics
0.89
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.