Infinitely integer-valued polynomials over an algebraic number field
نویسندگان
چکیده
منابع مشابه
Integer-valued Polynomials over Quaternion Rings
When D is an integral domain with field of fractions K, the ring Int(D) = {f(x) ∈ K[x] | f(D) ⊆ D} of integer-valued polynomials over D has been extensively studied. We will extend the integer-valued polynomial construction to certain noncommutative rings. Specifically, let i, j, and k be the standard quaternion units satisfying the relations i = j = −1 and ij = k = −ji, and define ZQ := {a+bi+...
متن کاملInteger-valued Polynomials
Let R be a Krull ring with quotient field K and a1, . . . , an in R. If and only if the ai are pairwise incongruent mod every height 1 prime ideal of infinite index in R does there exist for all values b1, . . . , bn in R an interpolating integer-valued polynomial, i.e., an f ∈ K[x] with f(ai) = bi and f(R) ⊆ R. If S is an infinite subring of a discrete valuation ring Rv with quotient field K a...
متن کاملFactoring Multivariate Polynomials over Algebraic Number Fields
The algorithm for factoring polynomials over the integers by Wang and Rothschild is generalized to an algorithm for the irreducible factorization of multivariate polynomials over any given algebraic number field. The extended method makes use of recent ideas in factoring univariate polynomials over large finite fields due to Berlekamp and Zassenhaus. The procedure described has been implemented...
متن کاملFactoring Multivariate Polynomials over Algebraic Number Fields
The algorithm for factoring polynomials over the integers by Wang and Rothschild is generalized to an algorithm for the irreducible factorization of multivariate polynomials over any given algebraic number field. The extended method makes use of recent ideas in factoring univariate polynomials over large finite fields due to Berlekamp and Zassenhaus. The procedure described has been implemented...
متن کاملIn-place Arithmetic for Univariate Polynomials over an Algebraic Number Field
We present a C library of in-place subroutines for univariate polynomial multiplication, division and GCD over Lp where Lp is an algebraic number field L with multiple field extensions reduced modulo a machine prime p. We assume elements of Lp and L are represented using a recursive dense representation. The main feature of our algorithms is that we eliminate the storage management overhead whi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1985
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1985.118.507