UNDECIDABILITY AND THE DEVELOPABILITY OF PERMUTOIDS AND RIGID PSEUDOGROUPS
Forum of Mathematics, Sigma, Tome 5 (2017)
Voir la notice de l'article provenant de la source Cambridge University Press
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 permutoid based on a finite set can be completed to a finite permutation group. In this note we prove Cameron’s conjecture by relating it to our recent work on the profinite triviality problem for finitely presented groups. We also prove that the existence problem for finite developments of rigid pseudogroups is unsolvable. In an appendix, Steinberg recasts these results in terms of inverse semigroups.
@article{10_1017_fms_2017_6,
author = {MARTIN R. BRIDSON and HENRY WILTON},
title = {UNDECIDABILITY {AND} {THE} {DEVELOPABILITY} {OF} {PERMUTOIDS} {AND} {RIGID} {PSEUDOGROUPS}},
journal = {Forum of Mathematics, Sigma},
publisher = {mathdoc},
volume = {5},
year = {2017},
doi = {10.1017/fms.2017.6},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.1017/fms.2017.6/}
}
TY - JOUR AU - MARTIN R. BRIDSON AU - HENRY WILTON TI - UNDECIDABILITY AND THE DEVELOPABILITY OF PERMUTOIDS AND RIGID PSEUDOGROUPS JO - Forum of Mathematics, Sigma PY - 2017 VL - 5 PB - mathdoc UR - http://geodesic.mathdoc.fr/articles/10.1017/fms.2017.6/ DO - 10.1017/fms.2017.6 LA - en ID - 10_1017_fms_2017_6 ER -
MARTIN R. BRIDSON; HENRY WILTON. UNDECIDABILITY AND THE DEVELOPABILITY OF PERMUTOIDS AND RIGID PSEUDOGROUPS. Forum of Mathematics, Sigma, Tome 5 (2017). doi: 10.1017/fms.2017.6
Cité par Sources :