SearcharxivSearch

arXiv · 2605.26199

On partial groups of small order

Abstract

We explain a computer enumeration of all partial groups (in the sense of Chermak) of order at most 10. An accompanying dataset contains a full list, consisting of 123,650 partial groups of order at most 9 and 178,937,003 partial groups of order 10; the paper itself contains a complete list of indecomposable partial groups of order at most 5. Inspection of the data led us to conjecture and then prove two results: that indecomposable partial groups of dimension two less than their order are precisely skeleta of groups of that order, and partial groups of (higher Segal) degree at most 2 are 2-coskeletal.

Explore related subjects

Keep this discovery

BibTeXRIS

Philip Hackney. 2026-05-25. On partial groups of small order. https://arxiv.org/abs/2605.26199

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