Search arXivSearch

arXiv · 2308.16305

Sequences related to Lehmer's problem

Abstract

The Mahler measure of a monic polynomial $P(x) = a_dx^d + a_{d-1}x^{d-1} + \dots + a_1x + a_0$ is defined as $M(P) := |a_d| \prod_{P(α)=0} \max\{1, |α|\}$, where the product runs over all roots of $P$. Lehmer's problem asks whether there exists a constant $C>1$ such that $M(P) \geq C$ for all noncyclotomic polynomials in $\mathbb{Z}[x]$. In this thesis, we examine the properties of various integer sequences related to this problem, with special focus on how these sequences might help solving Lehmer's problem.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Björn Johannesson. 2023-08-18. Sequences related to Lehmer's problem. https://arxiv.org/abs/2308.16305

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT