TY - JOUR
T1 - Subexponential estimates in Shirshov's theorem on height
AU - Belov, A. Ya
AU - Kharitonov, M. I.
PY - 2012
Y1 - 2012
N2 - Suppose that F2,m is a free 2-generated associative ring with the identity xm = 0. In 1993 Zelmanov put the following question: is it true that the nilpotency degree of F2,m has exponential growth? We give the defnitive answer to Zelmanov's question by showing that the nilpotency class of an l-generated associative algebra with the identity xd = 0 is smaller than Ψ(d,d,l), where (equation) This result is a consequence of the following fact based on combinatorics of words. Let l, n and d ≥ n be positive integers. Then all words over an alphabet of cardinality l whose length is not less than Ψ(n,d,l) are either n-divisible or contain xd; a word W is n-divisible if it can be represented in the form W = W 0W1 · · · Wn so that W1,., Wn are placed in lexicographically decreasing order. Our proof uses Dilworth's theorem (according to V. N. Latyshev's idea). We show that the set of not n-divisible words over an alphabet of cardinality l has height h < Φ(n, l) over the set of words of degree ≤ n-1, where 87 12 logc, n+48 Φ(n, l) = 287l · n12log 3n+48 Bibliography: 40 titles.
AB - Suppose that F2,m is a free 2-generated associative ring with the identity xm = 0. In 1993 Zelmanov put the following question: is it true that the nilpotency degree of F2,m has exponential growth? We give the defnitive answer to Zelmanov's question by showing that the nilpotency class of an l-generated associative algebra with the identity xd = 0 is smaller than Ψ(d,d,l), where (equation) This result is a consequence of the following fact based on combinatorics of words. Let l, n and d ≥ n be positive integers. Then all words over an alphabet of cardinality l whose length is not less than Ψ(n,d,l) are either n-divisible or contain xd; a word W is n-divisible if it can be represented in the form W = W 0W1 · · · Wn so that W1,., Wn are placed in lexicographically decreasing order. Our proof uses Dilworth's theorem (according to V. N. Latyshev's idea). We show that the set of not n-divisible words over an alphabet of cardinality l has height h < Φ(n, l) over the set of words of degree ≤ n-1, where 87 12 logc, n+48 Φ(n, l) = 287l · n12log 3n+48 Bibliography: 40 titles.
KW - Burnside-type problems
KW - Dilworth theorem
KW - Shirshov theorem on height
KW - Word combinatorics
KW - n-divisibility
UR - http://www.scopus.com/inward/record.url?scp=84862633662&partnerID=8YFLogxK
U2 - 10.1070/SM2012v203n04ABEH004233
DO - 10.1070/SM2012v203n04ABEH004233
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84862633662
SN - 1064-5616
VL - 203
SP - 534
EP - 553
JO - Sbornik Mathematics
JF - Sbornik Mathematics
IS - 4
ER -