No CrossRef data available.
Article contents
The Fibonacci automorphismof free Burnside groups
Published online by Cambridge University Press: 26 August 2011
Abstract
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.
We prove that the Fibonacci morphism is an automorphism of infinite order of free Burnside groups for all odd $n\geq 665$
and even $n = 16k \geq 8000$
.
Keywords
Information
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 2011
References
S.I. Adian, The Burnside Problem and Identities in Groups. Nauka (1975); English translation, Springer-Verlag (1979) 1–336.
Atabekyan, V.S., Non-$\varphi$
-admissible normal subgroups of free Burnside groups. J. Contemp. Math. Anal. 45 (2010) 112–122.
CrossRef
-admissible normal subgroups of free Burnside groups. J. Contemp. Math. Anal. 45 (2010) 112–122.
CrossRefAtabekyan, V.S., Normal automorphisms of free Burnside groups. Izv. RAN. Ser. Math. 75 (2011) 3–18.
CrossRef
Cherepanov, E.A., Free semigroup in the group of automorphisms of the free Burnside group. Comm. Algebra 33 (2005) 539–547.
CrossRef
Cherepanov, E.A., Normal automorphisms of free Burnside groups of large odd exponents. Int. J. Algebra Comput. 16 (2006) 839–847.
CrossRef
Karhumäki, J., On cube-free $\omega$-words generated by binary morphisms. Disc. Appl. Math. 5 (1983) 279–297.
CrossRef
-words generated by binary morphisms. Disc. Appl. Math. 5 (1983) 279–297.
CrossRefKourovka Notebook, Unsolved Problems in Group Theory. Novosibirsk (2006).
Mignosi, F. and Pirillo, G., Repetitions in the Fibonacci infinite word. Informatique Théorique et Applications 26 (1992) 199–204.
CrossRef
You have Access