2010
DOI: 10.1007/s10958-010-9885-1
|View full text |Cite
|
Sign up to set email alerts
|

The normalizers of free subgroups in free burnside groups of odd period n ≥ 1003

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
7
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 8 publications
(7 citation statements)
references
References 11 publications
0
7
0
Order By: Relevance
“…According to one other theorem of S.I.Adyan (see [1,Theorem 3.21]) for m > 1 and odd periods n ≥ 665 the center of B(m, n) is trivial and hence, B(m, n) is isomorphic to the inner automorphism subgroup Inn(B(m, n)) of the automorphism group Aut(B(m, n)). Other results on automorphisms and monomorphisms of the groups B(m, n) appeared relatively recently in [2]- [10]. In this paper we describe the automorphism groups of the endomorphism semigroups of B(m, n) for odd exponents n ≥ 1003.…”
mentioning
confidence: 94%
“…According to one other theorem of S.I.Adyan (see [1,Theorem 3.21]) for m > 1 and odd periods n ≥ 665 the center of B(m, n) is trivial and hence, B(m, n) is isomorphic to the inner automorphism subgroup Inn(B(m, n)) of the automorphism group Aut(B(m, n)). Other results on automorphisms and monomorphisms of the groups B(m, n) appeared relatively recently in [2]- [10]. In this paper we describe the automorphism groups of the endomorphism semigroups of B(m, n) for odd exponents n ≥ 1003.…”
mentioning
confidence: 94%
“…If n ≥ 1039 is an arbitrary odd number and a and b are two non commuting elements of the group B(2, n), then for some p = 2 k , where 0 ≤ k ≤ 9, the words u(a p , b), v(a p , b) freely generate a free Burnside subgroup of the group B(2, n), where the words u(x, y) and v(x, y) are defined by equalities (1) and (2). P r o o f. The starting point for proving Theorem 2 is the following assertion, proved in [7] (see also [8,9]).…”
Section: P R O O F Let For Some Word T We Havementioning
confidence: 97%
“…In [11], it was shown that Adyan's conjecture is valid for all odd n ≥ 1003. For prime 665 < n ≤ 997, the question is still open.…”
Section: Adyan's Conjecturementioning
confidence: 99%