SearcharxivSearch

arXiv · 2502.09536

Triangle Presentations Encoded by Perfect Difference Sets

Abstract

When James Singer exhibited projective planes for all prime power orders in 1938, he realized these using the trace function of cubic extensions of a finite field and linked trace=0 to perfect difference sets. In 1993, Cartwright, Mantero, Steger, and Zappa found that this trace function can be used to create a triangle presentation, which determines the structure of an ~A_2 building. We demonstrate a new, intrinsic connection between the perfect different sets of Singer and the triangle presentations of Cartwright et al., and show that this connection improves the efficiency of algorithms that generate these triangle presentations. Moreover, we translate the panel-regular groups of Essert (2013) and Witzel (2017) using triangle presentation nomenclature. This translation creates a uniform understanding of the panel-regular groups and vertex-regular groups via triangle presentations.

Explore related subjects

Keep this discovery

BibTeXRIS

Amy Herron. 2025-02-13. Triangle Presentations Encoded by Perfect Difference Sets. https://arxiv.org/abs/2502.09536

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