Forum Problem Lists Definitions FAQ

16.109 (2006)

Solved

Is there a polynomial time algorithm for solving the word problem in the group $\text{Aut } F_n$ (with respect to some particular finite presentation), where $F_n$ is the free group of rank $n \geqslant 2$?

Contributor: V. E. Shpilrain

Progress

Yes, there is (S. Schleimer, Comment. Math. Helv., 83 (2008), 741–765).

Comments

All comments are the responsibility of the user. Comments appearing on this page are not verified for correctness. Please keep posts mathematical and on topic. If you want to submit a proof (or a partial proof), please use the dedicated proof submission form rather than posting it in the comments.
Order by newest first or oldest first.

No comments yet. Be the first to comment.

Proof claims

Proof claims are the responsibility of the submitter. Appearance here does not mean the claim has been checked for mathematical correctness. Moderators only screen for spam, abuse, and obviously low-effort submissions.

No proof claims yet.