The conjugacy problem in automaton groups is not solvable. (Q1936130): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1010.1993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5488870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orbit decidability and the conjugacy problem for some extensions of groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the conjugacy problem for finite-state automorphisms of regular rooted trees. With an appendix by Raphaël M. Jungers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Generation of GL(n, Z) by Finite State Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Burnside's problem on periodic groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2783052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2783053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Burnside problem for periodic groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugacy problem in a class of \(2\)-groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The conjugacy problem in the Grigorchuk group is polynomial time decidable. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free subgroups in groups acting on rooted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugacy problem in an automorphism group of an infinite tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite automata of polynomial growth do not generate a free group. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free subgroups in linear groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugacy separability of certain torsion groups / rank
 
Normal rank

Latest revision as of 05:46, 6 July 2024

scientific article
Language Label Description Also known as
English
The conjugacy problem in automaton groups is not solvable.
scientific article

    Statements

    The conjugacy problem in automaton groups is not solvable. (English)
    0 references
    0 references
    0 references
    21 February 2013
    0 references
    0 references
    automaton groups
    0 references
    self-similar groups
    0 references
    (free Abelian)-by-free groups
    0 references
    conjugacy problem
    0 references
    orbit decidability
    0 references
    free subgroups
    0 references
    0 references
    0 references