Characterizing absolutely irreducible integer-valued polynomials over discrete valuation domains
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 element of this kernel, we explicitly construct non-trivial factorizations of , provided that , where depends on as well as the choice of . We further show that this bound cannot be improved in general. Additionally, we provide other (larger) lower bounds for , one of which only depends on the valuation of the denominator of and the size of the residue class field of .
Cite
@article{arxiv.2211.15981,
title = {Characterizing absolutely irreducible integer-valued polynomials over discrete valuation domains},
author = {Moritz Hiebler and Sarah Nakato and Roswitha Rissner},
journal= {arXiv preprint arXiv:2211.15981},
year = {2023}
}