Irreducibility of integer-valued polynomials I

Abstract

Let S ⊂ R be an arbitrary subset of a unique factorization domain R and be the field of fractions of R. The ring of integer-valued polynomials over S is the set Int(S,R)= \ f ∈ K[x]: f(a) ∈ R\ ∀\ a ∈ S \. This article is an effort to study the irreducibility of integer-valued polynomials over arbitrary subsets of a unique factorization domain. We give a method to construct special kinds of sequences, which we call d-sequences. We then use these sequences to obtain a criteria for the irreducibility of the polynomials in Int(S,R). In some special cases, we explicitly construct these sequences and use these sequences to check the irreducibility of some polynomials in Int(S,R). At the end, we suggest a generalization of our results to an arbitrary subset of a Dedekind domain.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…