Search arXivSearch

arXiv · 2608.20995

Complete Resolution Of A Family Of Twisted Thue Equations

Abstract

One of the first infinite families of Thue equations, $$F_n(X)=X^3 - (n-1) X^2Y - (n+2)XY^2 - Y^3 = \pm 1$$ for $n\in \mathbb{Z}$, was solved by Thomas in 1990. This family is associated to the simplest cubic fields $\mathbb{Q}(λ)$ of Shanks, where $λ$ is a root of $F_n(X,1)$. Levesque and Waldschmidt twisted the Thue equations by an exponent $t$ and looked at the equation $$N_{\mathbb{Q}(λ)/\mathbb{Q}}(X-λ^t Y)=\pm 1,$$ where $t\in \mathbb{Z}$ with $t\neq 0$. In this paper, we find all solutions $(X,Y,n,t)\in \mathbb{Z}^4$ with $n,t\in\mathbb{Z}$ and $t\neq 0$ to this family of twisted Thue equations, thereby answering a question of Levesque and Waldschmidt.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tobias Hilgart, Carina Premstaller, Volker Ziegler. 2026-08-21. Complete Resolution Of A Family Of Twisted Thue Equations. https://arxiv.org/abs/2608.20995

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