# UNDECIDABILITY AND THE DEVELOPABILITY OF PERMUTOIDS AND RIGID PSEUDOGROUPS

@article{Bridson2017UNDECIDABILITYAT, title={UNDECIDABILITY AND THE DEVELOPABILITY OF PERMUTOIDS AND RIGID PSEUDOGROUPS}, author={Martin R. Bridson and Henry Wilton}, journal={Forum of Mathematics, Sigma}, year={2017}, volume={5} }

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…

## References

SHOWING 1-10 OF 50 REFERENCES

### On the extension problem for partial permutations

- Mathematics
- 2003

A family of pseudovarieties of solvable groups is constructed, each of which has decidable membership and undecidable extension problem for partial permutations. Included are a pseudovariety U…

### Extending partial automorphisms and the profinite topology on free groups

- Mathematics
- 1999

A class of structures C is said to have the extension property for partial automorphisms (EPPA) if, whenever C1 and C2 are structures in C, C1 finite, C1 ⊆ C2, and p1, p2, . . . , pn are partial…

### The triviality problem for profinite completions

- Mathematics
- 2014

We prove that there is no algorithm that can determine whether or not a finitely presented group has a non-trivial finite quotient; indeed, this property remains undecidable among the fundamental…

### The uniform word problem for groups and finite Rees quotients of E-unitary inverse semigroups

- Mathematics
- 2003

### Closed Subgroups in Pro-V Topologies and the Extension Problem for Inverse Automata

- Mathematics, Computer ScienceInt. J. Algebra Comput.
- 2001

We relate the problem of computing the closure of a finitely generated subgroup of the free group in the pro-V topology, where V is a pseudovariety of finite groups, with an extension problem for…

### Inverse semigroups with zero: covers and their structure

- MathematicsJournal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
- 1999

Abstract We obtain analogues, in the setting of semigroups with zero, of McAlister's convering theoren and the structure theorems of McAlister, O'Carroll, and Margolis and Pin. The covers come from a…

### A non-cyclic one-relator group all of whose finite quotients are cyclic

- MathematicsJournal of the Australian Mathematical Society
- 1969

Let G be a group on two generators a and b subject to the single defining relation a = [a, ab]: . As usual [x, y] = x−1y−1xy and xy = y−1xy if x and y are elements of a group. The object of this note…

### ON A GROUPOID CONSTRUCTION FOR ACTIONS OF CERTAIN INVERSE SEMIGROUPS

- Mathematics
- 1993

We consider a version of the notion of F-inverse semigroup (studied in the algebraic theory of inverse semigroups). We point out that an action of such an inverse semigroup on a locally compact space…

### The Groups of Richard Thompson and Complexity

- MathematicsInt. J. Algebra Comput.
- 2004

It is shown that V contains all finite direct products of finitely generated free groups as subgroups with linear distortion, and that up to polynomial equivalence of functions, the following three sets are the same: the set of distortions of V, theSet of Dehn functions offinitely presented groups, and theset of time complexity functions of nondeterministic Turing machines.

### The Structure of 0-E-unitary inverse semigroups I: the monoid case

- MathematicsProceedings of the Edinburgh Mathematical Society
- 1999

This is the first of three papers in which we generalise the classical McAlister structure theory for E-unitary inverse semigroups to those 0-E-unitary inverse semigroups which admit a 0-restricted,…