Pith. sign in

REVIEW 1 cited by

Counting realizations of Laman graphs on the sphere

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1903.01145 v1 pith:MRJHF5V5 submitted 2019-03-04 math.CO math.AG

classification math.COmath.AG
keywords algorithmlamanrealizationsspacesphereangleschoicechow
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. On the existence of paradoxical motions of generically rigid graphs on the sphere

    math.CO 2019-08 conditional novelty 8.0 of 10

    A graph has a flexible assignment of spherical edge lengths if and only if it admits a NAP-coloring, and K3,3 has exactly three proper spherical motions: two Dixon-type motions and one new constant diagonal angle motion.

Pith tools