Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · math/9406204

Applications of substring searching to group presentations

George Havas·Mark Ollila
View original source ↗Read source document ↗Export metadata ↓

Abstract

An important way for describing groups is by finite presentations. Large presentations arise in practice which are poorly suited for either human or computer use. Presentation simplification processes which take bad presentations and produce good presentations have been developed. Substantial use is made of substring searching and appropriate techniques for this context are described. Effective use is made of signatures and change flags. Change flags are shown to be the most beneficial of the methods tested here, with very significant performance improvement. Experimental performance figures are given.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

George Havas, Mark Ollila. 1994-06-15. Applications of substring searching to group presentations. https://arxiv.org/abs/math/9406204

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗