Distances from differences of roots of polynomials to the nearest integers

DOI10.1016/0020-0190(92)90006-HMaRDI QIDQ1199554zbMATH OpenOpenAlexFDO

Authors V. I. Galiev, A. F. Polupanov, Igor E. Shparlinski

Publication date 16 January 1993

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(92)90006-h

zbMATH Keywords

computational complexityroots of polynomialsroot separationpower series solutions of ordinary differential equations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polynomials over commutative rings (13B25) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Polynomials (irreducibility, etc.) (11R09) Number-theoretic algorithms; complexity (11Y16) Polynomials, factorization in commutative rings (13P05) Numerical computation of solutions to single equations (65H05)

Recommendations

• Polynomials with a root close to an integer
• Polynomial minimum root separation
• On Integer Polynomials with Multiple Roots
• ON THE DISTANCE BETWEEN ROOTS OF INTEGER POLYNOMIALS
• On a problem of Nesterenko: when is the closest root of a polynomial a real number?

Cites work

• scientific article; zbMATH DE number 3756887 (Why is no real title available?)
• scientific article; zbMATH DE number 3785018 (Why is no real title available?)
• scientific article; zbMATH DE number 41614 (Why is no real title available?)
• scientific article; zbMATH DE number 3270885 (Why is no real title available?)
• scientific article; zbMATH DE number 3280972 (Why is no real title available?)
• scientific article; zbMATH DE number 3104956 (Why is no real title available?)
• Algebraic complexity of computing polynomial zeros
• An inequality about irreducible factors of integer polynomials
• Computational problems, methods, and results in algebraic number theory
• Computing Rational Zeros of Integral Polynomials by p-Adic Expansion
• Diophantine approximation
• Irreducibility of multivariate polynomials
• On the construction of solutions of systems of linear ordinary differential equations in the neighbourhood of a regular singularity
• Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
• The Calculation of Multivariate Polynomial Resultants

Cited in

(10)

• On the distance between the roots of a polynomial
• Polynomials with a root close to an integer
• scientific article; zbMATH DE number 4023492 (Why is no real title available?)
• Values of polynomials with integer coefficients and distance to their common zeros
• The distance to a squarefree polynomial over $\mathbb F_2[x]$
• ON THE DISTANCE BETWEEN ROOTS OF INTEGER POLYNOMIALS
• On the distance to a root of polynomials
• Squeezing polynomial roots a nonuniform distance
• The number of integer points close to a polynomial
• On real and complex roots of integer polynomials in a neighborhood of their small values

This page was built for publication: Distances from differences of roots of polynomials to the nearest integers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1199554)