|国家预印本平台
首页|Irreducible integer-valued polynomials with prescribed minimal power that factors non-uniquely

Irreducible integer-valued polynomials with prescribed minimal power that factors non-uniquely

Irreducible integer-valued polynomials with prescribed minimal power that factors non-uniquely

来源:Arxiv_logoArxiv
英文摘要

We study the question up to which power an irreducible integer-valued polynomial that is not absolutely irreducible can factor uniquely. For example, for integer-valued polynomials over principal ideal domains with square-free denominator, already the third power has to factor non-uniquely or the element is absolutely irreducible. Recently, it has been shown that for any $N\in\mathbb{N}$, there exists a discrete valuation domain $D$ and a polynomial $F\in\operatorname{Int}(D)$ such that the minimal $k$ for which $F^k$ factors non-uniquely is greater than $N$. In this paper, we show that, over principal ideal domains with infinitely many maximal ideals of finite index, the minimal power for which an irreducible but not absolutely irreducible element has to factor non-uniquely depends on the $p$-adic valuations of the denominator and cannot be bounded by a constant.

Sarah Nakato、Roswitha Rissner

10.1007/978-3-031-75326-8_17

数学

Sarah Nakato,Roswitha Rissner.Irreducible integer-valued polynomials with prescribed minimal power that factors non-uniquely[EB/OL].(2025-07-12)[2025-07-22].https://arxiv.org/abs/2405.16131.点此复制

评论