Split absolutely irreducible integer-valued polynomials over discrete valuation domains
Abstract
Regarding non-unique factorization of integer-valued polynomials over a discrete valuation domain with finite residue field, it is known that there exist absolutely irreducible elements, that is, irreducible elements all of whose powers factor uniquely, and non-absolutely irreducible elements. We completely and constructively characterize the absolutely irreducible elements among split integer-valued polynomials. They correspond bijectively to finite sets, which we call \emph{balanced}, characterized by a combinatorial property regarding the distribution of their elements among residue classes of powers of . For each such balanced set as the set of roots of a split polynomial, there exists a unique vector of multiplicities and a unique constant so that the corresponding product of monic linear factors times the constant is an absolutely irreducible integer-valued polynomial. This also yields sufficient criteria for integer-valued polynomials over Dedekind domains to be absolutely irreducible.
Cite
@article{arxiv.2107.14276,
title = {Split absolutely irreducible integer-valued polynomials over discrete valuation domains},
author = {Sophie Frisch and Sarah Nakato and Roswitha Rissner},
journal= {arXiv preprint arXiv:2107.14276},
year = {2022}
}
Comments
This version comes with the shortened introduction as it appears in the journal version. [v2] contains an extended introduction, the remaining sections are identical to [v3]