Search arXivSearch

arXiv · 2308.15305

Calligraphs and sphere realizations

Abstract

We introduce a recursive procedure for computing the number of realizations of a minimally rigid graph on the sphere up to rotations. We accomplish this by combining two ingredients. The first is a framework that allows us to think of such realizations as of elements of a moduli space of stable rational curves with marked points. The second is the idea of splitting a minimally rigid graph into two subgraphs, called calligraphs, that admit one degree of freedom and that share only a single edge and a further vertex. This idea has been recently employed for realizations of graphs in the plane up to isometries. The key result is that we can associate to a calligraph a triple of natural numbers with a special property: whenever a minimally rigid graph is split into two calligraphs, the number of realizations of the former equals the product of the two triples of the latter, where this product is specified by a fixed quadratic form. These triples and quadratic form codify the fact that we express realizations as intersections of two curves on the blowup of a sphere along two pairs of complex conjugate points.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Matteo Gallet, Georg Grasegger, Niels Lubbes, Josef Schicho. 2023-08-29. Calligraphs and sphere realizations. https://arxiv.org/abs/2308.15305

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO