Decorated trees

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Cassou-Noguès, Pierrette, Daigle, Daniel
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866916425110650880
author Cassou-Noguès, Pierrette
Daigle, Daniel
author_facet Cassou-Noguès, Pierrette
Daigle, Daniel
contents We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and the decorations are required to satisfy certain conditions. The class of decorated trees includes different types of trees used in algebraic geometry, such as the Eisenbud and Neumann diagrams for links of singularities and the Neumann diagrams for links at infinity of algebraic plane curves. By purely combinatorial means, we recover some formulas that were previously understood to be "topological". In this way, we extend the generality of those formulas and show that they are in fact "combinatorial".
format Preprint
id arxiv_https___arxiv_org_abs_2409_11559
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Decorated trees
Cassou-Noguès, Pierrette
Daigle, Daniel
Algebraic Geometry
Primary: 14Q05, 14H20, 14B05, 52-08, 05E14
We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and the decorations are required to satisfy certain conditions. The class of decorated trees includes different types of trees used in algebraic geometry, such as the Eisenbud and Neumann diagrams for links of singularities and the Neumann diagrams for links at infinity of algebraic plane curves. By purely combinatorial means, we recover some formulas that were previously understood to be "topological". In this way, we extend the generality of those formulas and show that they are in fact "combinatorial".
title Decorated trees
topic Algebraic Geometry
Primary: 14Q05, 14H20, 14B05, 52-08, 05E14
url https://arxiv.org/abs/2409.11559