SearcharxivSearch

arXiv · 2508.19171

Short presentations for crystallographic groups

Abstract

A practical approach is proposed to construct short presentations for Euclidean crystallographic groups in terms of generators and relations. For our purposes a short presentation is the one with a small number of short relators for a given generating set. The connection is emphasized between relators of a group presentation and cycles in the associated Cayley graph. It is shown by examples that a short presentation is usually the one where relators correspond to strong rings in the Cayley graph and therefore provide a natural upper bound for their size. Presentations are computed for vertex-transitive groups which act with trivial vertex stabilizers on a number of high-symmetry 2-, 3- and 4-periodic graphs. Higher-dimensional as well as subperiodic examples are also considered. Relations are explored between geodesics in periodic graphs and corresponding cycles in their quotients.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Igor A. Baburin. 2025-08-26. Short presentations for crystallographic groups. https://arxiv.org/abs/2508.19171

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

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR