Matching works

1 work

math.RA — Rings and Algebras

Improving Razmyslov's (1974) bound: the Nagata–Higman index is at most n² − 2 for n ≥ 3

Contributed by Dave Goel

Let d(n)d(n) be the least mm such that every associative (not necessarily unital) algebra over a field of characteristic zero satisfying the identity xn=0x^n=0 also satisfies x1x2⋯xm=0x_1x_2\cdots x_m=0; this is the Nagata–Higman index. Razmyslov proved d(n)≤n2d(n)\le n^2 in 1974; Kuzmin proved d(n)≥n(n+1)/2d(n)\ge n(n+1)/2 and conjectured equality; this is the Kuzmin (1975) conjecture. We prove d(n)≤n2−2d(n)\le n^2-2 for n≥3n\ge3 (and, by a simpler case of the same method, d(n)≤n2−1d(n)\le n^2-1 for n≥2n\ge2); in particular d(6)≤34d(6)\le34. To our knowledge, n=6n=6 is the first case in which the new bound improves the known bounds, and this is the first improvement of Razmyslov's bound for general nn. For m=n2−1m=n^2-1 and m=n2−2m=n^2-2, Formanek's criterion reduces d(n)≤md(n)\le m to the statement that no nonzero linear combination of (m+1)(m+1)-cycles lies in one particular isotypic block of the group algebra of Sm+1S_{m+1}. For m=n2−1m=n^2-1 this statement follows from the branching rule; for m=n2−2m=n^2-2 we prove it using the Jucys–Murphy elements and a theorem of Frobenius on the characters of the alternating group. These bounds have also been proved in the Lean proof assistant.

Author comments: First version: October 28, 2026. The expanded version of this paper, "Improving Razmyslov's (1974) bound: the Nagata–Higman index is at most n² − 2 for n ≥ 3, and other miscellanea", is at https://doi.org/10.5281/zenodo.23624549 on Zenodo.

A mix of human-written and AI-generated textHuman understanding: some partsKuzmin's conjectureNagata-Higman theoremnil algebrasnilpotency indexpolynomial identitiessymmetric group
Nov 16, 202614 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations