Group-theoretic orbit decidability.
From MaRDI portal
In this survey the author explains several results closely related to the concept of orbit decidability. This is a new quite general algorithmic notion connected with the study of the conjugacy problem for extensions of groups.
Recommendations
- Orbit decidability and the conjugacy problem for some extensions of groups.
- Orbits in finite group actions.
- Orbits of the actions of finite solvable groups.
- Decidable Properties of Polycyclic Groups
- scientific article; zbMATH DE number 1944134
- Oligomorphic groups and orbit enumeration.
- ORBIT-HOMOGENEITY IN PERMUTATION GROUPS
- On orbit closures of groups.
- On decidability results of the holomorph of a finite cyclic group.
- Orbits of finite solvable groups on characters.
Cited in
(9)- Algorithmic recognition of infinite cyclic extensions
- Orbit decidability and the conjugacy problem for some extensions of groups.
- On generalized conjugacy and some related problems
- Computable Scott sentences and the weak Whitehead problem for finitely presented groups
- Quantifying orbit detection: \(\varphi\)-order and \(\varphi\)-spectrum
- Translation-like actions by \(\mathbb{Z} \), the subgroup membership problem, and Medvedev degrees of effective subshifts
- Subsets of groups in public-key cryptography
- On the intersection of fixed subgroups of F_n F_m
- Automorphic orbits in free groups: recent progress
This page was built for publication: Group-theoretic orbit decidability.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q472161)
