arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2002.08186math.CO
收藏

On the smallest trees with the same restricted $U$-polynomial and the rooted $U$-polynomial

José Aliste-Prieto, Anna de Mier, José Zamora

英文摘要:

In this article, we construct explicit examples of pairs of non-isomorphic trees with the same restricted $U$-polynomial for every $k$; by this we mean that the polynomials agree on terms with degree at most $k+1$. The main tool for this construction is a generalization of the $U$-polynomial to rooted graphs, which we introduce and study in this article. Most notably we show that rooted trees can be reconstructed from its rooted $U$-polynomial.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑