On Galois groups of type-1 minimally rigid graphs

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Makhul, Mehdi, Schicho, Josef, Warren, Audie
Format: Preprint
Published: 2023
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913195112792064
author Makhul, Mehdi
Schicho, Josef
Warren, Audie
author_facet Makhul, Mehdi
Schicho, Josef
Warren, Audie
contents For every graph that is mimimally rigid in the plane, its Galois group is defined as the Galois group generated by the coordinates of its planar realizations, assuming that the edge lengths are transcendental and algebraically independent. Here we compute the Galois group of all minimally rigid graphs that can be constructed from a single edge by repeated Henneberg 1-steps. It turns out that any such group is totally imprimitive, i.e., it is determined by all the partitions it preserves.
format Preprint
id arxiv_https___arxiv_org_abs_2306_04392
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle On Galois groups of type-1 minimally rigid graphs
Makhul, Mehdi
Schicho, Josef
Warren, Audie
Combinatorics
Metric Geometry
For every graph that is mimimally rigid in the plane, its Galois group is defined as the Galois group generated by the coordinates of its planar realizations, assuming that the edge lengths are transcendental and algebraically independent. Here we compute the Galois group of all minimally rigid graphs that can be constructed from a single edge by repeated Henneberg 1-steps. It turns out that any such group is totally imprimitive, i.e., it is determined by all the partitions it preserves.
title On Galois groups of type-1 minimally rigid graphs
topic Combinatorics
Metric Geometry
url https://arxiv.org/abs/2306.04392