Every algebraic number is a critical value of an integer polynomial
We arrived at an independent proof of Petrov's theorem. For every irreducible $f \in \mathbb{Z}[x]$ of positive degree there are $g \in \mathbb{Z}[x]$ and an irreducible $F \in \mathbb{Z}[x]$ of positive degree with $F \mid g'$ and $F^{2} \mid f \circ g$. Equivalently, every algebraic number is a critical value of an integer polynomial, so the set of critical values of $\mathbb{Z}[x]$ is exactly $\overline{\mathbb{Q}}$. The construction is explicit. We classify $g \in \mathbb{Z}[x]$ with critical value $\alpha$, and find a lower bound for $\deg g$. The proof was assisted by AI, and has been…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2610.00428
curl -X POST /api/v1/records/hexagon/2610.00428/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2610.00428/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'