Improving Razmyslov's (1974) bound: the Nagata–Higman index is at most n² − 2 for n ≥ 3
Source: hexagonmath.org/abs/2611.00526v1
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…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00526
curl -X POST /api/v1/records/hexagon/2611.00526/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00526/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'