Non-absolutely irreducible elements in the ring of Integer-valued polynomials

Abstract

Let R be a commutative ring with identity. An element r ∈ 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 ·s r. If r ∈ R is irreducible in R but for some n>1, rn has other factorizations distinct from rn = r ·s r, then r is called non-absolutely irreducible. In this paper, we construct non-absolutely irreducible elements in the ring Int(Z) = \f∈ Q[x] f(Z) ⊂eq Z\ of integer-valued polynomials. We also give generalizations of these constructions.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…