2000 character limit reached
Non-absolutely irreducible elements in the ring of Integer-valued polynomials (1910.10278v3)
Published 22 Oct 2019 in math.AC
Abstract: Let $R$ be a commutative ring with identity. An element $r \in R$ is said to be absolutely irreducible in $R$ if for all natural numbers $n>1$, $rn$ has essentially only one factorization namely $rn = r \cdots r$. If $r \in R$ is irreducible in $R$ but for some $n>1$, $rn$ has other factorizations distinct from $rn = r \cdots r$, then $r$ is called non-absolutely irreducible. In this paper, we construct non-absolutely irreducible elements in the ring $\text{Int}(\mathbb{Z}) = {f\in \mathbb{Q}[x] \mid f(\mathbb{Z}) \subseteq \mathbb{Z}}$ of integer-valued polynomials. We also give generalizations of these constructions.