Polynomials with roots modulo every integer

DOI10.1090/S0002-9939-96-03210-8zbMath1055.11523OpenAlexW2132287244MaRDI QIDQ4890219

Yuri F. Bilu, Daniel Berend

Publication date: 11 July 2001

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9939-96-03210-8

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Density theorems (11R45) Polynomials (irreducibility, etc.) (11R09) Exponential Diophantine equations (11D61)

Related Items (24)

On polynomials with roots modulo almost all primes ⋮ The Classification of Integral Domains in Which the Relation of Being an Ideal Is Transitive ⋮ On squares in polynomial products ⋮ Polynomials over ring of integers of global fields that have roots modulo every finite indexed subgroup ⋮ Polynomials with roots in ℚ_{𝕡} for all 𝕡 ⋮ On the arithmetic of polynomials with coefficients in Mordell-Weil type groups ⋮ Galois groups over rational function fields and explicit Hilbert irreducibility ⋮ On a generalization of the recurrence defining the number of derangements ⋮ Compositions of n satisfying some coprimality conditions ⋮ Multiple ergodic averages for three polynomials and applications ⋮ Intersective polynomials and the polynomial Szemerédi theorem ⋮ On polynomial-factorial diophantine equations ⋮ On Galois Realizations of the 2-Coverable Symmetric and Alternating Groups ⋮ Squarefree parts of polynomial values ⋮ Geometry and arithmetic of verbal dynamical systems on simple groups (with an appendix by Nathan Jones) ⋮ Normal coverings of finite symmetric and alternating groups. ⋮ Intersective polynomials and the primes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Two remarks on the inverse Galois problem for intersective polynomials ⋮ Intersective polynomials arising from sums of powers ⋮ Intersective polynomials and Diophantine approximation. II ⋮ Problems and Results on Intersective Sets ⋮ Finite primitive permutation groups containing a permutation having at most four cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Construction and estimation of bases in function fields
• On the equation \(P(x)=n!\) and a question of Erdős
• Solving diophantine problems over all residue class fields of a number field and all finite fields
• Van der Corput's difference theorem
• A bound for the least prime ideal in the Chebotarev density theorem
• Sets of primes determined by systems of polynomial congruences
• Solving diophantine problems modulo every prime
• Explicit Bounds for Primality Testing and Related Problems
• Die Primteilerdichte von ganzzahligen Polynomen. III.
• On difference sets of sequences of integers. I
• On difference sets of sequences of integers. III
• Die Primteilerdichte von ganzzahligen Polynomen. I.
• Die Primteilerdichte von ganzzahligen Polynomen.
• On polynomial-factorial diophantine equations
• Unsolved problems in number theory

This page was built for publication: Polynomials with roots modulo every integer