Polynomials with roots modulo every integer

DOI10.1090/S0002-9939-96-03210-8zbMATH Open1055.11523OpenAlexW2132287244MaRDI QIDQ4890219FDOQ4890219

Authors: Daniel Berend, Yuri Bilu 

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

Recommendations

• Integer polynomials with roots mod \(p\) for all primes \(p\)
• Polynomials with roots mod \(p\) for all primes \(p\)
• Polynomials consisting of quadratic factors with roots modulo any positive integer
• Roots of polynomials modulo prime powers
• Irreducible polynomials with many roots of equal modulus
• Polynomials with a root close to an integer
• Polynomials with values which are powers of integers.
• On polynomials with roots modulo almost all primes
• Root sets of polynomials modulo prime powers

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (29)

• Finite primitive permutation groups containing a permutation having at most four cycles
• Polynomials with roots mod \(p\) for all primes \(p\)
• Polynomials with roots in ℚ_{𝕡} for all 𝕡
• Polynomials consisting of quadratic factors with roots modulo any positive integer
• Integer polynomials with roots mod \(p\) for all primes \(p\)
• Normal coverings of finite symmetric and alternating groups.
• On squares in polynomial products
• Title not available (Why is that?)
• A statistical relation of roots of a polynomial in different local fields. III
• Galois groups over rational function fields and explicit Hilbert irreducibility
• Polynomials over ring of integers of global fields that have roots modulo every finite indexed subgroup
• Multiple ergodic averages for three polynomials and applications
• Problems and Results on Intersective Sets
• On a generalization of the recurrence defining the number of derangements
• Minimally intersective polynomials with arbitrarily long factorization
• Compositions of n satisfying some coprimality conditions
• On polynomial-factorial diophantine equations
• Title not available (Why is that?)
• Intersective polynomials and Diophantine approximation. II
• On the arithmetic of polynomials with coefficients in Mordell-Weil type groups
• Two remarks on the inverse Galois problem for intersective polynomials
• On polynomials with roots modulo almost all primes
• Intersective polynomials and the polynomial Szemerédi theorem
• On Galois realizations of the 2-coverable symmetric and alternating groups
• The Classification of Integral Domains in Which the Relation of Being an Ideal Is Transitive
• Geometry and arithmetic of verbal dynamical systems on simple groups (with an appendix by Nathan Jones)
• Intersective polynomials arising from sums of powers
• Intersective polynomials and the primes
• Squarefree parts of polynomial values

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

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