Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
140 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Counting real algebraic numbers with bounded derivative of minimal polynomial (1811.10664v1)

Published 26 Nov 2018 in math.NT

Abstract: In this paper we consider the problem of counting algebraic numbers $\alpha$ of fixed degree $n$ and bounded height $Q$ such that the derivative of the minimal polynomial $P_{\alpha}(x)$ of $\alpha$ is bounded, $|P_{\alpha}'(\alpha)| < Q{1-v}$. This problem has many applications to the problems of the metric theory of Diophantine approximation. We prove that the number of $\alpha$ defined above on the interval $\left(-\frac12, \frac12\right)$ doesn't exceed $c_1(n)Q{n+1-\frac{1}{7}v}$ for $Q>Q_0(n)$ and $1.4 \le v \le \frac{7}{16}(n+1)$. Our result is based on an improvement to the lemma on the order of zero approximation by irreducible divisors of integer polynomials from A. Gelfond's monograph "Transcendental and algebraic numbers". The improvement provides a stronger estimate for the absolute value of the divisor in real points which are located far enough from all algebraic numbers of bounded degree and height and it's based on the representation of the resultant of two polynomials as the determinant of Sylvester matrix for the shifted polynomials. Keywords: Diophantine approximation, Hausdorff dimension, transcendental numbers, resultant, Sylvester matrix, irreducible divisor, Gelfond's lemma.

Summary

We haven't generated a summary for this paper yet.