Integer-valued polynomial

Known as: Integral-valued polynomial, Bunyakovsky property, Integer valued polynomial 
In mathematics, an integer-valued polynomial (also known as a numerical polynomial) P(t) is a polynomial whose value P(n) is an integer for every… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1998-2018
02419982018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Summary form only given. The polynomial numerical homotopy continuation method has gained quite some attention from the power… (More)
Is this relevant?
2010
2010
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… (More)
Is this relevant?
2009
2009
Numerical algebraic geometry uses numerical data to describe algebraic varieties. It is based on numerical polynomial homotopy… (More)
  • figure 1
Is this relevant?
2009
2009
This talk will provide a snapshot of contemporary commutative algebra. In classical commutative algebra and algebraic number… (More)
Is this relevant?
2008
2008
Integer-valued polynomials on subsets of discrete valuation domains are well studied. We undertake here a systematical study of… (More)
Is this relevant?
2005
2005
Let p be a prime, and let f(x) be an integer-valued polynomial. By a combinatorial approach, we obtain a nontrivial lower bound… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
 
Is this relevant?
2004
2004
MULTROOT is a collection of Matlab modules for accurate computation of polynomial roots, especially roots with high… (More)
Is this relevant?
2003
2003
We study the problem of bounding a polynomial away from polynomials which are absolutely irreducible. Such separation bounds are… (More)
  • figure 1
Is this relevant?
1999
1999
This paper describes a probabilistic method for verifying the equivalence of two multiple-valued functions. Each function is… (More)
Is this relevant?