Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1601.00604

A new test for asphericity and diagrammatic reducibility of group presentations

Jonathan Ariel Barmak·Elias Gabriel Minian
View original source ↗Read source document ↗Export metadata ↓

Abstract

We present a new test for studying asphericity and diagrammatic reducibility of group presentations. Our test can be applied to prove diagrammatic reducibility in cases where the classical weight test fails. We use this criterion to generalize results of J. Howie and S.M. Gersten on asphericity of LOTs and of Adian presentations, and derive new results on solvability of equations over groups. We also use our methods to investigate a conjecture of S.V. Ivanov related to Kaplansky's problem on zero divisors: we strengthen Ivanov's result for locally indicable groups and prove a weak version of the conjecture.

Explore related subjects

math.GRmath.GT

Keep this discovery

BibTeXRIS

Jonathan Ariel Barmak, Elias Gabriel Minian. 2016-10-04. A new test for asphericity and diagrammatic reducibility of group presentations. https://arxiv.org/abs/1601.00604

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↗