Roots of polynomials over semirings and hyperfields
Abstract
We lay the groundwork for the theory of roots of polynomials over semirings and hyperfields, employing a property of a ``surpassing relation'' ⪯ on semirings and hyperfields that we call strong ⪯-reversibility. There are three kinds of roots generalizing roots in classical algebraic theory --- ``null roots,'' ``⪯-roots,'' and ``factor-roots.'' The theory works best when all null roots are also factor-roots. The ensuing results include the fundamental theorem of algebra for pairs, asserting that tangible polynomials with enough roots ``⪯-split,'' sometimes uniquely, into linear factors. We also examine to what extent polynomials are determined by their null roots. Next, we obtain ⪯-roots over extension systems, and construct integrally closed systems over various base systems, including hyperfield systems over a group. The point is that whereas hyper-polynomials behave poorly, polynomial systems remain strongly ⪯-reversible, so one can compose chains of ⪯-finitely spanned extensions. Next, we introduce real pairs, focusing on square roots and quadratic closure. In the appendix we recast the theory by considering equivalence classes of tangible polynomials which agree on almost all substitutions.
Related
- A combinatorial criterion for detecting roots of Bernstein-Sato polynomials
- A separating identity for matrix semirings over S7
- Convergence for Small-Order Derivatives of Random Polynomials with Independent Roots
- Real-rooted flow polynomials have only integral roots
- Repeated differentiation of random polynomials with i.i.d. rotationally invariant roots
BibTeX
@misc{rowen2026roots,
title = {{Roots of polynomials over semirings and hyperfields}},
author = {Louis Halle Rowen},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2606.13330},
eprint = {2606.13330},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2606.13330},
}
RIS
TY - UNPB
TI - Roots of polynomials over semirings and hyperfields
AU - Louis Halle Rowen
PY - 2026
DA - 2026/10/25
PB - arXiv
DO - 10.48550/arxiv.2606.13330
UR - https://arxiv.org/abs/2606.13330
AB - We lay the groundwork for the theory of roots of polynomials over semirings and hyperfields, employing a property of a ``surpassing relation'' ⪯ on semirings and hyperfields that we call strong ⪯-reversibility. There are three kinds of roots generalizing roots in classical algebraic theory --- ``null roots,'' ``⪯-roots,'' and ``factor-roots.'' The theory works best when all null roots are also factor-roots. The ensuing results include the fundamental theorem of algebra for pairs, asserting that tangible polynomials with enough roots ``⪯-split,'' sometimes uniquely, into linear factors. We also examine to what extent polynomials are determined by their null roots. Next, we obtain ⪯-roots over extension systems, and construct integrally closed systems over various base systems, including hyperfield systems over a group. The point is that whereas hyper-polynomials behave poorly, polynomial systems remain strongly ⪯-reversible, so one can compose chains of ⪯-finitely spanned extensions. Next, we introduce real pairs, focusing on square roots and quadratic closure. In the appendix we recast the theory by considering equivalence classes of tangible polynomials which agree on almost all substitutions.
ER -