Two-sided estimates for essential height in Shirshov's height theorem. (Q355290)

The paper is concerned with two-sided estimates for the essential height in Shirshov's height theorem. The author introduces the notions of selective height and strong \(n\)-divisibility that are directly related to height and \(n\)-divisibility. The author proves lower and upper bounds for the selective height over non-strongly \(n\)-divisible words of length 2. For any \(n\) and sufficiently large \(l\) these bounds differ at most twice. The case of words of length 3 is also studied. The case of words of length 2 can be generalized to the proof of an upper exponential estimate in Shirshov's height theorem. The proof uses the idea of Latyshev related to the application of Dilworth's theorem to the study of \(n\)-divisible words.