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.
2020
Pubblicato
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v27i2p5
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.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11368/3037694
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 6
  • ???jsp.display-item.citation.isi??? 5
social impact