Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T14:43:53.852Z Has data issue: false hasContentIssue false

On the complexity of a putative counterexample to the $p$-adic Littlewood conjecture

Published online by Cambridge University Press:  19 May 2015

Dmitry Badziahin
Affiliation:
University of Durham, Department of Mathematical Sciences, South Rd, Durham DH1 3LE, UK email dzmitry.badziahin@durham.ac.uk
Yann Bugeaud
Affiliation:
Université de Strasbourg, Mathématiques, 7 rue René Descartes, 67084 Strasbourg Cedex, France email bugeaud@math.unistra.fr
Manfred Einsiedler
Affiliation:
ETH Zürich, Departement Mathematik, Rämistrasse 101, CH-8092 Zürich, Switzerland email manfred.einsiedler@math.ethz.ch
Dmitry Kleinbock
Affiliation:
Brandeis University, Department of Mathematics, Waltham, MA 02454, USA email kleinboc@brandeis.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let $\Vert \cdot \Vert$ denote the distance to the nearest integer and, for a prime number $p$, let $|\cdot |_{p}$ denote the $p$-adic absolute value. Over a decade ago, de Mathan and Teulié [Problèmes diophantiens simultanés, Monatsh. Math. 143 (2004), 229–245] asked whether $\inf _{q\geqslant 1}$$q\cdot \Vert q{\it\alpha}\Vert \cdot |q|_{p}=0$ holds for every badly approximable real number ${\it\alpha}$ and every prime number $p$. Among other results, we establish that, if the complexity of the sequence of partial quotients of a real number ${\it\alpha}$ grows too rapidly or too slowly, then their conjecture is true for the pair $({\it\alpha},p)$ with $p$ an arbitrary prime.

Information

Type
Research Article
Copyright
© The Authors 2015