The Newton polytope and Lorentzian property of chromatic symmetric functions

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Matherne, Jacob P., Morales, Alejandro H., Selover, Jesse
Natura: Preprint
Pubblicazione: 2022
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866929704175403008
author Matherne, Jacob P.
Morales, Alejandro H.
Selover, Jesse
author_facet Matherne, Jacob P.
Morales, Alejandro H.
Selover, Jesse
contents Chromatic symmetric functions are well-studied symmetric functions in algebraic combinatorics that generalize the chromatic polynomial and are related to Hessenberg varieties and diagonal harmonics. Motivated by the Stanley--Stembridge conjecture, we show that the allowable coloring weights for indifference graphs of Dyck paths are the lattice points of a permutahedron $\mathcal{P}_λ$, and we give a formula for the dominant weight $λ$. Furthermore, we conjecture that such chromatic symmetric functions are Lorentzian, a property introduced by Brändén and Huh as a bridge between discrete convex analysis and concavity properties in combinatorics, and we prove this conjecture for abelian Dyck paths. We extend our results on the Newton polytope to incomparability graphs of (3+1)-free posets, and we give a number of conjectures and results stemming from our work, including results on the complexity of computing the coefficients and relations with the $ζ$ map from diagonal harmonics.
format Preprint
id arxiv_https___arxiv_org_abs_2201_07333
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle The Newton polytope and Lorentzian property of chromatic symmetric functions
Matherne, Jacob P.
Morales, Alejandro H.
Selover, Jesse
Combinatorics
05E05, 05C15, 06A07 (Primary) 05A10, 05A20, 03D15 (Secondary)
Chromatic symmetric functions are well-studied symmetric functions in algebraic combinatorics that generalize the chromatic polynomial and are related to Hessenberg varieties and diagonal harmonics. Motivated by the Stanley--Stembridge conjecture, we show that the allowable coloring weights for indifference graphs of Dyck paths are the lattice points of a permutahedron $\mathcal{P}_λ$, and we give a formula for the dominant weight $λ$. Furthermore, we conjecture that such chromatic symmetric functions are Lorentzian, a property introduced by Brändén and Huh as a bridge between discrete convex analysis and concavity properties in combinatorics, and we prove this conjecture for abelian Dyck paths. We extend our results on the Newton polytope to incomparability graphs of (3+1)-free posets, and we give a number of conjectures and results stemming from our work, including results on the complexity of computing the coefficients and relations with the $ζ$ map from diagonal harmonics.
title The Newton polytope and Lorentzian property of chromatic symmetric functions
topic Combinatorics
05E05, 05C15, 06A07 (Primary) 05A10, 05A20, 03D15 (Secondary)
url https://arxiv.org/abs/2201.07333