Characterizing absolutely irreducible integer-valued polynomials over discrete valuation domains

DOI10.1016/J.JALGEBRA.2023.06.026zbMATH Open1521.13029arXiv2211.15981OpenAlexW4384133827MaRDI QIDQ6170773FDOQ6170773

Authors: Moritz Hiebler, Sarah Nakato, Roswitha Rissner 

Publication date: 10 August 2023

Published in: Journal of Algebra (Search for Journal in Brave)

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 $FinoperatornameInt(R)$ where $R$ is a discrete valuation domain with finite residue field and show that it is possible to explicitly determine a number $SinmathbbN$ that reduces the absolute irreducibility of $F$ to the unique factorization of $F^S$. To this end, we establish a connection between the factors of powers of $F$ and the kernel of a certain linear map that we associate to $F$. 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 $F^k$, provided that $kgeL$, where $L$ depends on $F$ 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 $k$, one of which only depends on the valuation of the denominator of $F$ and the size of the residue class field of $R$.

Full work available at URL: https://arxiv.org/abs/2211.15981

Recommendations

• Split absolutely irreducible integer-valued polynomials over discrete valuation domains
• Non-absolutely irreducible elements in the ring of integer-valued polynomials
• Absolute irreducibility of the binomial polynomials
• Irreducibility of integer-valued polynomials. I
• A graph-theoretic criterion for absolute irreducibility of integer-valued polynomials with square-free denominator

zbMATH Keywords

contentabsolutely irreducible elementfixed divisor kernel

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Polynomials (11S05) Divisibility and factorizations in commutative rings (13A05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Integer-valued polynomials
• Title not available (Why is that?)
• A classification of all 𝐷 such that {𝐼𝑛𝑡}(𝐷) is a Prüfer domain
• Non-unique factorizations: a survey
• Strong atoms in monadically Krull monoids
• About Euclidean rings
• Elasticity for integral-valued polynomials
• Irreducible polynomials and full elasticity in rings of integer-valued polynomials
• A construction of integer-valued polynomials with prescribed sets of lengths of factorizations
• Title not available (Why is that?)
• Interpolation domains
• Completely irreducible numbers in algebraic number fields
• Sets of lengths of factorizations of integer-valued polynomials on Dedekind domains with finite residue fields
• What you should know about integer-valued polynomials
• Absolute irreducibility of the binomial polynomials
• A new characterization of half-factorial Krull monoids
• Relative polynomial closure and monadically Krull monoids of integer-valued polynomials
• On monoids and domains whose monadic submonoids are Krull
• A graph-theoretic criterion for absolute irreducibility of integer-valued polynomials with square-free denominator
• Non-absolutely irreducible elements in the ring of integer-valued polynomials
• Factorization of integer-valued polynomials with square-free denominator
• Split absolutely irreducible integer-valued polynomials over discrete valuation domains
• A closer look at non-unique factorization via atomic decay and strong atoms

Cited In (5)

• Irreducibility of integer-valued polynomials. I
• Integer-valued polynomials on valuation rings of global fields with prescribed lengths of factorizations
• Split absolutely irreducible integer-valued polynomials over discrete valuation domains
• A graph-theoretic criterion for absolute irreducibility of integer-valued polynomials with square-free denominator
• Non-absolutely irreducible elements in the ring of integer-valued polynomials

This page was built for publication: Characterizing absolutely irreducible integer-valued polynomials over discrete valuation domains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6170773)