Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1405.4368

Undecidability and the developability of permutoids and rigid pseudogroups

Martin R. Bridson·Henry Wilton
View original source ↗Read source document ↗Export metadata ↓

Abstract

A permutoid is a set of partial permutations that contains the identity and is such that partial compositions, when defined, have at most one extension in the set. In 2004 Peter Cameron conjectured that there can exist no algorithm that determines whether or not a finite permutoid based on a finite set can be completed to a finite permutation group, and he related this problem to the study of groups that have no non-trivial finite quotients. This note explains how our recent work on the profinite triviality problem for finitely presented groups can be used to prove Cameron's conjecture. We also prove that the existence problem for finite developments of rigid pseudogroups is unsolvable.

Explore related subjects

math.GRmath.COmath.LO

Keep this discovery

BibTeXRIS

Martin R. Bridson, Henry Wilton. 2014-05-17. Undecidability and the developability of permutoids and rigid pseudogroups. https://arxiv.org/abs/1405.4368

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↗