The conjugacy problem in automaton groups is not solvable

Details The conjugacy problem in automaton groups is not solvable The conjugacy problem in automaton groups is not solvable

2010-10-11

arxiv.org/abs/1010.1993v2

Mathematics

Group Theory

Scientific paper

(Free-abelian)-by-free, self-similar groups generated by finite self-similar
sets of tree automorphisms having unsolvable conjugacy problem are constructed.
Along the way, orbit undecidable, free subgroups of GL_d(Z), for d > 5, and
Aut(F_d), for d > 4, are constructed as well.

Affiliated with

Also associated with

No associations

Rating

The conjugacy problem in automaton groups is not solvable does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The conjugacy problem in automaton groups is not solvable, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The conjugacy problem in automaton groups is not solvable will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-658156