Subexponential estimations in Shirshov's height theorem

Mathematics – Rings and Algebras

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

In Russian, 22 pages. The current version of this paper differs from the previous versions by the better estimation

Scientific paper

In 1993 E. I. Zelmanov asked the following question in Dniester Notebook: "Suppose that F_{2, m} is a 2-generated associative ring with the identity x^m=0. Is it true, that the nilpotency degree of F_{2, m} has exponential growth?" We show that the nilpotency degree of l-generated associative algebra with the identity x^d=0 is smaller than Psi(d,d,l), where Psi(n,d,l)=2^{18} l (nd)^{3 log_3 (nd)+13}d^2. We give the definitive answer to E. I. Zelmanov by this result. It is the consequence of one fact, which is based on combinatorics of words. Let l, n and d>n be positive integers. Then all the words over alphabet of cardinality l which length is greater than Psi(n,d,l) are either n-divided or contain d-th power of subword, where a word W is n-divided, if it can be represented in the following form W=W_0 W_1...W_n such that W_1 >' W_2>'...>'W_n. The symbol >' means lexicographical order here. A. I. Shirshov proved that the set of non n-divided words over alphabet of cardinality l has bounded height h over the set Y consisting of all the words of degree

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Subexponential estimations in Shirshov's height theorem 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 Subexponential estimations in Shirshov's height theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Subexponential estimations in Shirshov's height theorem will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-543743

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.