Metraipolis › archive › dc_69bfe536b9bd

Poincare Polynomials of Heavy-Light Hassett Spaces — arXiv:2609.03268

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.03268
License (as archived)
CC0-1.0
Archived
2026-10-17T02:33:20.984Z
SHA-256 of the archived text
4cb49c71f8ac7ebeb183c93a2b6ffd4a1de8d7178bcf223ae0dc7333e0fbc5cf
Stable URL of this page
https://metraipolis.com/documento/dc_69bfe536b9bd

How to cite

Poincare Polynomials of Heavy-Light Hassett Spaces — arXiv:2609.03268 — arXiv (en), https://arxiv.org/abs/2609.03268 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_69bfe536b9bd (Metraipolis archive dc_69bfe536b9bd, sha256 4cb49c71f8ac7ebeb183c93a2b6ffd4a1de8d7178bcf223ae0dc7333e0fbc5cf)
BibTeX
@misc{dc69bfe536b9bd,
  title = {Poincare Polynomials of Heavy-Light Hassett Spaces — arXiv:2609.03268},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.03268},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_69bfe536b9bd; sha256 4cb49c71f8ac7ebeb183c93a2b6ffd4a1de8d7178bcf223ae0dc7333e0fbc5cf},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.03268. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The Poincaré polynomials of the Deligne-Mumford space $\overline{M_{0,n}}$ of stable genus 0 curves have been widely studied by several authors such as Keel and Manin. These polynomials can be computed via a recursive formula that is combinatorial in nature, and their exponential generating functions satisfy elegant functional and differential equations. In this paper, we state some combinatorial formulas to the Poincaré polynomials of Hassett's heavy-light moduli spaces $\overline{M_{0,w_{m,n}}}$, with $m$ heavy marked points and $n-m$ light marked points. We express the Poincaré polynomials recursively in terms of the Möbius function of a certain lattice of set partitions. In the case of $m=2$, we get a Losev-Manin space. We give an explicit formula for the Poincaré polynomial or $\overline{M_{0,w_{2,n}}}$ by counting ordered set partitions; and give a recursive formula for this polynomial similar to that in the setting of $\overline{M_{0,n}}$. We prove this recursive formula using geometric and topological properties of the stratification of Losev-Manin spaces; and use an exponential generating function to simplify this recursive formula. Finally, we give a remarkable generalization to the ordered Bell numbers and a recurrence relation for this generalization.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-04 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Algebraic Geometry (math.AG); Algebraic Topology (math.AT); General Topology (math.GN).
Pagina del lavoro: https://arxiv.org/abs/2609.03268 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T02:09:21.176Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-04?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).