Estimates in Shirshov height theorem

is a constant. 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

P s i (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} d o t s W_{n}

such that

W_{n} p r e c W_{n - 1} p r e c c d o t s p r e c W_{1}

. The symbol

p r e c

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

< n

. Original Shirshov's estimation was just recursive, in 1982 double exponent was obtained by A. G. Kolotov and in 1993 A. Ya. Belov obtained exponential estimation. We show, that

h < P h i (n, l)

, where

P h i (n, l) = n^{C l o g n} l

and

C

is a constant. Our proof uses Latyshev idea of Dilworth theorem application.

Recommendations

Cites work

Cited in

(7)

This page was built for publication: Estimates in Shirshov height theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5239608)