Results 61 to 70 of about 59,442 (147)

On Lehmer’s question for integer-valued polynomials

Journal de théorie des nombres de Bordeaux
We solve a Lehmer-type question about the Mahler measure of integer-valued polynomials.
openaire   +4 more sources

Integer-valued polynomials

, 1973
Integer-valued ...
openaire   +1 more source

Sets that determine integer-valued polynomials

Journal of Number Theory, 1989
The main result of this paper describes necessary and sufficients conditions for a subset S of \({\mathbb{Z}}\) to determine the set of the integer valued polynomials on \({\mathbb{Z}}\). This is an answer to a problem considered by the author and \textit{W. W. Smith} [J. Algebra 81, 150-164 (1983; Zbl 0515.13016)].
openaire   +1 more source

Integer values of polynomials

, 2008
Let $f(X)$ be a polynomial with rational coefficients, $S$ be an infinite subset of the rational numbers and consider the image set $f(S)$. If $g(X)$ is a polynomial such that $f(S)=g(S)$ we say that $g$ \emph{parametrizes} the set $f(S)$. Besides the obvious solution $g=f$ we may want to impose some conditions on the polynomial $g$; for example, if $f(
openaire   +1 more source

Sequence domains and integer-valued polynomials

Journal of Pure and Applied Algebra, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Integer-valued polynomials satisfying growth constraints

We consider polynomials which take integer values on the integers (IVPs), and satisfy an additional growth condition on the natural numbers. Elkies and Speyer, answering a question by Dimitrov, showed there is a critical exponential growth threshold, such that there are infinitely many IVPs with growth above the threshold and finitely many IVPs below ...
Kiro, Avner, Nishry, Alon
openaire   +2 more sources

Polynomials which take Gaussian integer values at Gaussian integers

Journal of Number Theory, 1977
AbstractA factorial set for the Gaussian integers is a set G = {g1, g2 … gn} of Gaussian integers such that G(z) = Πk (z − gk)gk takes Gaussian integer values at Gaussian integers. We characterize factorial sets and give a lower bound for max∥z∥2=nπ ∥ G(z)∥. It is conjectured that there are infinitely many factorial sets.
openaire   +2 more sources

Lengths of factorizations of integer-valued polynomials on Krull domains with prime elements. [PDF]

Arch Math
Fadinger-Held V, Windisch D.
europepmc   +1 more source

Applications of representation theory and of explicit units to Leopoldt's conjecture. [PDF]

Res Number Theory
Ferri F, Johnston H.
europepmc   +1 more source

Generalized Euler method to study the vaccination effects on dynamics of measles infection model under non-singular kernel. [PDF]

Sci Rep
Yadav LK, Gour MM, Purohit SD, Al-Mdallal Q, Suthar DL.   +4 more
europepmc   +1 more source