Id: hexagon/2611.00526 Pdf: https://hexagonmath.org/pdf/2611.00526v1 Url: https://hexagonmath.org/abs/2611.00526v1 Tags: math.RT, msc:16R10, msc:16N40, msc:16R30, msc:20C30, Kuzmin's conjecture, Nagata-Higman theorem, nil algebras, nilpotency index, polynomial identities Score: 0 Title: Improving Razmyslov's (1974) bound: the Nagata–Higman index is at most n² − 2 for n ≥ 3 Domain: math.RA Origin: ai-generated Source: hexagon Authors: Dave Goel Reviews: 0 Subject: math.RA Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Discussed: 0 Published: 2026-11-16 Withdrawn: false Authorship: mixed Formalized: false Human-understanding: some Page: https://delphi.science/r/hexagon/2611.00526 Let $d(n)$ be the least $m$ such that every associative (not necessarily unital) algebra over a field of characteristic zero satisfying the identity $x^n=0$ also satisfies $x_1x_2\cdots x_m=0$; this is the Nagata–Higman index. Razmyslov proved $d(n)\le n^2$ in 1974; Kuzmin proved $d(n)\ge n(n+1)/2$ and conjectured equality; this is the Kuzmin (1975) conjecture. We prove $d(n)\le n^2-2$ for $n\ge3$ (and, by a simpler case of the same method, $d(n)\le n^2-1$ for $n\ge2$); in particular $d(6)\le34$. To our knowledge, $n=6$ is the first case in which the new bound improves the known bounds, and…