arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1509.09210math.CO
收藏

具有相同限制U-多项式的树与Prouhet-Tarry-Escott问题

On trees with the same restricted U-polynomial and the Prouhet-Tarry-Escott problem

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

摘要:

本文主要研究Stanley提出的两棵非同构树是否可以有相同的$U$ -多项式(或等价地,相同的色对称函数)的问题。我们考虑了$U_k$ -多项式,它是$U$ -多项式的一个限制形式,并借助于Prouhet-Tarry-Escott问题的解,构造了对于任意给定的$k$,具有相同$U_k$ -多项式的非同构树.通过这样做,我们还发现了一类新的树,区分的$U$ -多项式同构。

英文摘要:

This paper focuses on the well-known problem due to Stanley of whether two non-isomorphic trees can have the same $U$-polynomial (or, equivalently, the same chromatic symmetric function). We consider the $U_k$-polynomial, which is a restricted version of $U$-polynomial, and construct with the help of solutions of the Prouhet-Tarry-Escott problem, non-isomorphic trees with the same $U_k$-polynomial for any given $k$. By doing so, we also find a new class of trees that are distinguished by the $U$-polynomial up to isomorphism.

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

↑