On the number of times a root of \(f(n,x)=0\) generates a field containing a given number field

DOI10.1006/jnth.1998.2243zbMath0928.11043OpenAlexW2006160689MaRDI QIDQ1273195

Umberto Zannier

Publication date: 10 November 1999

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jnth.1998.2243

zbMATH Keywords

polynomialsfield extensionsHilbert's irreducibility theorem

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Polynomials (irreducibility, etc.) (11R09) Algebraic numbers; rings of algebraic integers (11R04) Hilbertian fields; Hilbert's irreducibility theorem (12E25)

Related Items (4)

Diversity in Parametric Families of Number Fields ⋮ Hilbert irreducibility, the Malle conjecture and the Grunwald problem ⋮ On pseudo-random subsets of the set of the integers not exceeding \(N\) ⋮ Average distribution of prime ideals in families of number fields

Cites Work

• Diophantine approximations and diophantine equations
• Squares in arithmetic progressions
• On the prime ideal theorem and irregularities in the distribution of primes
• The Distribution of Galois Groups and Hilbert's Irreducibility Theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of times a root of \(f(n,x)=0\) generates a field containing a given number field