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

Resultado de la investigación: Contribución a la publicaciónArticle

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 originalEnglish
Páginas (desde - hasta)1435-1441
Número de páginas7
PublicaciónDiscrete Mathematics
Volumen340
Número de edición6
Identificadores de objetos digitales
EstadoPublished - 1 jun 2017

Huella dactilar

Polynomials

Keywords

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Discrete Mathematics and Combinatorics

    Citar esto

    Aliste-Prieto, José; de Mier, Anna; Zamora, José / On trees with the same restricted U-polynomial and the Prouhet–Tarry–Escott problem.

    En: Discrete Mathematics, Vol. 340, N.º 6, 01.06.2017, p. 1435-1441.

    Resultado de la investigación: Contribución a la publicaciónArticle

    @article{ff953746ce514e2e8824a8d2a0d693a9,
    title = "On trees with the same restricted U-polynomial and the Prouhet–Tarry–Escott problem",
    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 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.",
    keywords = "Chromatic symmetric function, Graph polynomials, Prouhet–Tarry– Escott problem, U-polynomial",
    author = "José Aliste-Prieto and {de Mier}, Anna and José Zamora",
    year = "2017",
    month = "6",
    doi = "10.1016/j.disc.2016.09.019",
    volume = "340",
    pages = "1435--1441",
    journal = "Discrete Mathematics",
    issn = "0012-365X",
    publisher = "Elsevier",
    number = "6",

    }

    On trees with the same restricted U-polynomial and the Prouhet–Tarry–Escott problem. / Aliste-Prieto, José; de Mier, Anna; Zamora, José.

    En: Discrete Mathematics, Vol. 340, N.º 6, 01.06.2017, p. 1435-1441.

    Resultado de la investigación: Contribución a la publicaciónArticle

    TY - JOUR

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

    AU - Aliste-Prieto,José

    AU - de Mier,Anna

    AU - Zamora,José

    PY - 2017/6/1

    Y1 - 2017/6/1

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

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

    KW - Chromatic symmetric function

    KW - Graph polynomials

    KW - Prouhet–Tarry– Escott problem

    KW - U-polynomial

    UR - http://www.scopus.com/inward/record.url?scp=85015628094&partnerID=8YFLogxK

    U2 - 10.1016/j.disc.2016.09.019

    DO - 10.1016/j.disc.2016.09.019

    M3 - Article

    VL - 340

    SP - 1435

    EP - 1441

    JO - Discrete Mathematics

    T2 - Discrete Mathematics

    JF - Discrete Mathematics

    SN - 0012-365X

    IS - 6

    ER -