We present an algorithm that computes the number of realizations of a Laman graph on a sphere for a general choice of the angles between the vertices. The algorithm is based on the interpretation of such a realization as a point in the moduli space of stable curves of genus zero with marked points, and on the explicit description, due to Keel, of the Chow ring of this space.
Counting Realizations of Laman Graphs on the Sphere
GALLET M
;
2020-01-01
Abstract
We present an algorithm that computes the number of realizations of a Laman graph on a sphere for a general choice of the angles between the vertices. The algorithm is based on the interpretation of such a realization as a point in the moduli space of stable curves of genus zero with marked points, and on the explicit description, due to Keel, of the Chow ring of this space.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Counting realizations of Laman graphs on the sphere.pdf
accesso aperto
Tipologia:
Documento in Versione Editoriale
Licenza:
Creative commons
Dimensione
1.14 MB
Formato
Adobe PDF
|
1.14 MB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
