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

Resultado de la investigación: Contribución a una revistaArtículo

6 Citas (Scopus)

Resumen

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 Uk-polynomial, which is a restricted version of U-polynomial, and construct, for any given k, non-isomorphic trees with the same Uk-polynomial. These trees are constructed by encoding solutions of the Prouhet–Tarry–Escott problem. As a consequence, we find a new class of trees that are distinguished by the U-polynomial up to isomorphism.

Idioma originalInglés
Páginas (desde-hasta)1435-1441
Número de páginas7
PublicaciónDiscrete Mathematics
Volumen340
N.º6
DOI
EstadoPublicada - 1 jun 2017

Áreas temáticas de ASJC Scopus

  • Ciencia computacional teórica
  • Matemáticas discretas y combinatorias

Huella Profundice en los temas de investigación de 'On trees with the same restricted U-polynomial and the Prouhet–Tarry–Escott problem'. En conjunto forman una huella única.

  • Citar esto