pith. sign in

arxiv: 1509.09210 · v1 · pith:CRWG7CVPnew · submitted 2015-09-30 · 🧮 math.CO

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

classification 🧮 math.CO
keywords polynomialsametreesproblemnon-isomorphicprouhet-tarry-escottrestrictedchromatic
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.