Polynomials over strict semirings do not admit unique factorization
Alexander Agudelo

TL;DR
This paper proves that polynomials over strict semirings do not have unique factorization, highlighting a fundamental limitation in the algebraic structure of these semirings.
Contribution
It provides a formal proof that polynomials over strict semirings lack unique factorization, clarifying an important algebraic property.
Findings
Polynomials over strict semirings do not admit unique factorization.
The result clarifies limitations in algebraic structures of strict semirings.
The proof establishes a foundational property relevant to algebra and semiring theory.
Abstract
In this short note, we prove the claim of the title.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScheduling and Timetabling Solutions · Polynomial and algebraic computation · Scheduling and Optimization Algorithms
