Stable curves and chromatic polynomials

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Reinke, Bernhard, Silversmith, Rob
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866909405604216832
author Reinke, Bernhard
Silversmith, Rob
author_facet Reinke, Bernhard
Silversmith, Rob
contents The intersection numbers of moduli spaces of stable curves $\overline{\mathcal{M}}_{g,m}$ are well-studied and are known to have rich combinatorial structure. We introduce a natural class of these intersection numbers $ω_{G,g,m}$ indexed by finite simple graphs $G=(V,E)$. In genus zero, these numbers are closely related to several previously-studied quantities, including maximum likelihood degrees in algebraic statistics, counts of regions of certain hyperplane arrangements, and Kapranov degrees. We give two proofs of a simple closed formula $ω_{G,g,m}=(-1)^{\left\lvert V \right\rvert}χ_G(-(2g-2+m)),$ where $χ_G$ is the chromatic polynomial of $G$ -- one proof via intersection theory on moduli spaces of stable curves, and the other using the theory of hyperplane arrangements. We discuss several related questions and speculations, including new candidates for the chromatic polynomial of a directed graph.
format Preprint
id arxiv_https___arxiv_org_abs_2411_17551
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Stable curves and chromatic polynomials
Reinke, Bernhard
Silversmith, Rob
Algebraic Geometry
Combinatorics
The intersection numbers of moduli spaces of stable curves $\overline{\mathcal{M}}_{g,m}$ are well-studied and are known to have rich combinatorial structure. We introduce a natural class of these intersection numbers $ω_{G,g,m}$ indexed by finite simple graphs $G=(V,E)$. In genus zero, these numbers are closely related to several previously-studied quantities, including maximum likelihood degrees in algebraic statistics, counts of regions of certain hyperplane arrangements, and Kapranov degrees. We give two proofs of a simple closed formula $ω_{G,g,m}=(-1)^{\left\lvert V \right\rvert}χ_G(-(2g-2+m)),$ where $χ_G$ is the chromatic polynomial of $G$ -- one proof via intersection theory on moduli spaces of stable curves, and the other using the theory of hyperplane arrangements. We discuss several related questions and speculations, including new candidates for the chromatic polynomial of a directed graph.
title Stable curves and chromatic polynomials
topic Algebraic Geometry
Combinatorics
url https://arxiv.org/abs/2411.17551