On permutations with decidable cycles

From MaRDI portal
Publication:6280896



Abstract: Recursive permutations whose cycles are the classes of a decidable equivalence relation are studied; the set of these permutations is called mathrmPerm, the group of all recursive permutations mathcalG. Multiple equivalent computable representations of decidable equivalence relations are provided. mathcalG-conjugacy in mathrmPerm is characterised by computable isomorphy of cycle equivalence relations. This result parallels the equivalence of cycle type equality and conjugacy in the full symmetric group of the natural numbers. Conditions are presented for a permutation finmathcalG to be in mathrmPerm and for a decidable equivalence relation to appear as the cycle relation of a member of mathcalG. In particular, two normal forms for the cycle structure of permutations are defined and it is shown that conjugacy to a permutation in the first normal form is equivalent to membership in mathrmPerm. mathrmPerm is further characterised as the set of maximal permutations in a family of preordered subsets of automorphism groups of decidable equivalences. Conjugacy to a permutation in the second normal form corresponds to decidable cycles plus decidable cycle finiteness problem. Cycle decidability and cycle finiteness are both shown to have the maximal one-one degree of the Halting Problem. Cycle finiteness is used to prove that conjugacy in mathrmPerm cannot be decided and that it is impossible to compute cycle deciders for products of members of mathrmPerm and finitary permutations. It is also shown that mathrmPerm is not recursively enumerable and that it is not a group.














This page was built for publication: On permutations with decidable cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6280896)