On the number of times a root of \(f(n,x)=0\) generates a field containing a given number field (Q1273195): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3209230 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Squares in arithmetic progressions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Distribution of Galois Groups and Hilbert's Irreducibility Theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4319817 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3309989 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the prime ideal theorem and irregularities in the distribution of primes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Diophantine approximations and diophantine equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4233886 / rank | |||
Normal rank |
Revision as of 16:37, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the number of times a root of \(f(n,x)=0\) generates a field containing a given number field |
scientific article |
Statements
On the number of times a root of \(f(n,x)=0\) generates a field containing a given number field (English)
0 references
10 November 1999
0 references
Let \(f(x,y)\) be a polynomial with rational coefficients. The author obtains upper bounds for the number \(N(T)\) of integers \(n\leq T\) such that there exists a root of \(f(n,y)=0\) generating a field which contains a given algebraic number field \(E\). In the case when \(f\) is irreducible over the rationals and monic in \(y\) and \(E\) is not contained in the algebraic closure \({\mathcal C}\) of the rationals in the splitting field \(\Lambda\) of \(f\) over \(\mathbb{Q}(x)\), then \(N(T)\) does not exceed \(c^{\log T/\log\log T}\sqrt T\) with \(c\) being dependent only on \(f\) but not on \(E\). If moreover every intermediate field \({\mathcal C}(x)\subset\Omega\subset\Lambda\) (\(\Omega\neq{\mathcal C}(x)\)) has positive genus and is ramified above at least one irrational point then the factor \(\sqrt T\) in this bound can be omitted. As an application one obtains a uniform version of Hilbert's irreducibility theorem for number fields.
0 references
Hilbert's irreducibility theorem
0 references
field extensions
0 references
polynomials
0 references