Improving Razmyslov's (1974) bound: the Nagata–Higman index is at most n² − 2 for n ≥ 3, and other miscellanea
Source: hexagonmath.org/abs/2611.00527v1
Let $d(n)$ be the least $m$ such that every associative algebra over a field of characteristic zero satisfying $x^n=0$ also satisfies $x_1x_2\cdots x_m=0$ (the Nagata–Higman index). Razmyslov proved $d(n)\le n^2$ in 1974, and the Kuzmin (1975) conjecture is $d(n)=n(n+1)/2$. We prove $d(n)\le n^2-1$ for $n\ge2$ and $d(n)\le n^2-2$ for $n\ge3$; in particular $d(6)\le34$. The proof uses Formanek's criterion in cycle form and studies, one isotypic block of $S_N$ at a time, the span of the $N$-cycles inside the block: a block with two corners meets this span exactly when its shape is a…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00527
curl -X POST /api/v1/records/hexagon/2611.00527/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00527/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'