Chromatic MacMahon symmetric functions of graphs
Algebraic Combinatorics · 01.07.2026 · 9 (3) · 597-610
DOI: 10.5802/alco.496 ↗Kurz gefasst
Fachartikel in der Zeitschrift Algebraic Combinatorics, online erschienen am 01.07.2026. Verfasst von Jeremy L. Martin und 1 weiteren Autor:innen. Die Arbeit nennt 22 Literaturangaben.
Abstract (Originalsprache)
A MacMahon symmetric function is an invariant of the diagonal action of the symmetric group on power series in multiple alphabets of variables. We introduce an analogue of the chromatic symmetric function for vertex-weighted graphs, taking values in the MacMahon symmetric functions on two sets of variables, recording information about both cardinalities and weights of vertex sets. We prove that the chromatic symmetric MacMahon function of a tree determines the generating function for its vertex subsets by cardinality, weight, and the numbers of internal and external edges. This result generalizes the one for the unweighted case, first conjectured by Crew and proved independently by Aliste-Prieto–Martin–Wagner–Zamora and Liu–Tang.
Zitieren
APA
Martin, J. L., & Trist, M. B. (2026). Chromatic MacMahon symmetric functions of graphs. Algebraic Combinatorics, 9(3), 597-610. https://doi.org/10.5802/alco.496
Vancouver
Martin JL, Trist MB. Chromatic MacMahon symmetric functions of graphs. Algebraic Combinatorics. 2026;9(3):597-610. doi:10.5802/alco.496
BibTeX
@article{Martin2026,
author = {Martin, Jeremy L. and Trist, May B.},
title = {Chromatic MacMahon symmetric functions of graphs},
journal = {Algebraic Combinatorics},
year = {2026},
volume = {9},
number = {3},
pages = {597--610},
doi = {10.5802/alco.496}
}
EUVIMED