SearcharxivSearch

arXiv · 1510.06680

Conway groupoids, regular two-graphs and supersimple designs

Abstract

A $2-(n,4,λ)$ design $(Ω, \mathcal{B})$ is said to be supersimple if distinct lines intersect in at most two points. From such a design, one can construct a certain subset of Sym$(Ω)$ called a "Conway groupoid". The construction generalizes Conway's construction of the groupoid $M_{13}$. It turns out that several infinite families of groupoids arise in this way, some associated with 3-transposition groups, which have two additional properties. Firstly the set of collinear point-triples forms a regular two-graph, and secondly the symmetric difference of two intersecting lines is again a line. In this paper, we show each of these properties corresponds to a group-theoretic property on the groupoid and we classify the Conway groupoids and the supersimple designs for which both of these two additional properties hold.

Explore related subjects

Keep this discovery

BibTeXRIS

Nick Gill, Neil I. Gillespie, Cheryl E. Praeger, Jason Semeraro. 2015-10-22. Conway groupoids, regular two-graphs and supersimple designs. https://arxiv.org/abs/1510.06680

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