Representation stability for marked graph complexes
Algebraic Combinatorics · 01.07.2026 · 9 (3) · 865-892
DOI: 10.5802/alco.487 ↗Kurz gefasst
Fachartikel in der Zeitschrift Algebraic Combinatorics, online erschienen am 01.07.2026. Verfasst von Enoch Fedah und 1 weiteren Autor:innen. Die Arbeit nennt 23 Literaturangaben.
Abstract (Originalsprache)
We prove a sharp representation stability result for graph complexes with a distinguished vertex, and prove that the chains realizing this sharp bound pass to non-trivial families of graph homology classes. This result may be interpreted as a higher genus generalization of Hersh and Reiner’s stability bound for configuration spaces of points in odd dimensional Euclidean space.
Zitieren
APA
Fedah, E., & Ward, B. C. (2026). Representation stability for marked graph complexes. Algebraic Combinatorics, 9(3), 865-892. https://doi.org/10.5802/alco.487
Vancouver
Fedah E, Ward BC. Representation stability for marked graph complexes. Algebraic Combinatorics. 2026;9(3):865-892. doi:10.5802/alco.487
BibTeX
@article{Fedah2026,
author = {Fedah, Enoch and Ward, Benjamin C.},
title = {Representation stability for marked graph complexes},
journal = {Algebraic Combinatorics},
year = {2026},
volume = {9},
number = {3},
pages = {865--892},
doi = {10.5802/alco.487}
}
EUVIMED