Characterizing absolutely irreducible integer-valued polynomials over discrete valuation domains
Moritz Hiebler, Sarah Nakato, Roswitha Rissner

TL;DR
This paper characterizes absolutely irreducible integer-valued polynomials over discrete valuation domains, providing explicit criteria and bounds for their factorization properties and connecting these to linear algebraic structures.
Contribution
It introduces a method to determine absolute irreducibility via a fixed divisor kernel and establishes bounds for when powers of polynomials become uniquely factorable.
Findings
Explicit characterization of absolute irreducibility using the fixed divisor kernel.
Construction of non-trivial factorizations for powers of polynomials beyond a certain bound.
Identification of bounds depending on valuation and residue field size, with proof of their optimality.
Abstract
Rings of integer-valued polynomials are known to be atomic, non-factorial rings furnishing examples for both irreducible elements for which all powers factor uniquely (\emph{absolutely irreducibles}) and irreducible elements where some power has a factorization different from the trivial one. In this paper, we study irreducible polynomials where is a discrete valuation domain with finite residue field and show that it is possible to explicitly determine a number that reduces the absolute irreducibility of to the unique factorization of . To this end, we establish a connection between the factors of powers of and the kernel of a certain linear map that we associate to . This connection yields a characterization of absolute irreducibility in terms of this so-called \emph{fixed divisor kernel}. Given a non-trivial…
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
TopicsRings, Modules, and Algebras · Polynomial and algebraic computation · Commutative Algebra and Its Applications
