On Galois groups of type-1 minimally rigid graphs
Combinatorics
2024-01-17 v2 Metric Geometry
Abstract
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.
Keywords
Cite
@article{arxiv.2306.04392,
title = {On Galois groups of type-1 minimally rigid graphs},
author = {Mehdi Makhul and Josef Schicho and Audie Warren},
journal= {arXiv preprint arXiv:2306.04392},
year = {2024}
}