Related papers: A randomized version of the Littlewood Conjecture
In this paper we adopt a geometric point of view regarding a famous conjecture due to Littlewood in diophantine approximation of real numbers. Following the spirit of the geometric theory of continued fractions, we give a sufficient…
We prove new results, related to the Littlewood and Mixed Littlewood conjectures in Diophantine approximation.
For any given real number $\alpha$ with bounded partial quotients, we construct explicitly continuum many real numbers $\beta$ with bounded partial quotients for which the pair $(\alpha, \beta)$ satisfies a strong form of the Littlewood…
We prove that the Littlewood conjecture is satisfied for a restricted class of pairs $(\alpha,\beta)$ of badly approximable numbers. We use the localization of the roots of a cubic equation with coefficients depending on the diophantine…
The main goal of this note is to develop a metrical theory of Diophantine approximation within the framework of the de Mathan-Teulie Conjecture, also known as the `Mixed Littlewood Conjecture'. Let p be a prime. A consequence of our main…
In a previous paper, we studied certain sequences of simultaneous rational approximations in ${\bf R}^2$ which present some analogy with the continued fractions. We got results around the Littlewood conjecture by using such approximations.…
Motivated by the inverse Littlewood-Offord problem for linear forms, we study the concentration of quadratic forms. We show that if this form concentrates on a small ball with high probability, then the coefficients can be approximated by a…
A long-standing conjecture of Littlewood about simultaneous Diophantine approximation has an analogous problem for a field of formal Laurent series $\mathbb{F}(\!(t^{-1})\!)$. That is, we can ask whether for any series $\Theta$, $\Phi$ and…
We discuss several open problems in Diophantine approximation. Among them there are famous Littlewood's and Zaremba's conjectures as well as some new and not so famous problems.
Diophantine approximation is the problem of approximating a real number by rational numbers. We propose a version of this in which the numerators are approximately related to the denominators by a Laurent polynomial. Our definition is…
The goal of this paper is to describe an elementary combinatorial heuristic that predicts Hardy and Littlewood's extended Goldbach's conjecture. We examine common features of other heuristics in additive prime number theory, such as…
Diophantine approximation is traditionally the study of how well real numbers are approximated by rationals. We propose a model for studying Diophantine approximation in an arbitrary totally bounded metric space where the rationals are…
We establish a strong form of Littlewood's conjecture with inhomogeneous shifts, for a full-dimensional set of pairs of badly approximable numbers on a vertical line. We also prove a uniform assertion of this nature, generalising a strong…
We show that Lang's conjecture on error terms in Diophantine approximation implies Honda's conjecture on ranks of elliptic curves over number fields. We also show that even a very weak version of Lang's error term conjecture would be enough…
We relate a previous result of ours on families of Diophantine equations having only trivial solutions with a result on the approximation of an algebraic number by products of rational numbers and units. We compare this approximation with a…
Fix an irrational number $\alpha$, and consider a random walk on the circle in which at each step one moves to $x+\alpha$ or $x-\alpha$ with probabilities $1/2, 1/2$ provided the current position is $x$. If an observable is given we can…
We prove the $l^2$ Decoupling Conjecture for compact hypersurfaces with positive definite second fundamental form and also for the cone. This has a wide range of important consequences. One of them is the validity of the Discrete…
We give elementary proof of stronger versions of several recent results on intrinsic Diophantine approximation on rational quadric hypersurfaces $X\subset \mathbb{P}^n(\mathbb{R})$. The main tool is a refinement of the simplex lemma, which…
We investigate the number of integer solutions to a multiplicative Diophantine approximation problem and show that the associated counting function converges in distribution to a normal law. Our approach relies on the analysis of…
Diophantine approximation explores how well irrational numbers can be approximated by rationals, with foundational results by Dirichlet, Hurwitz, and Liouville culminating in Roth's theorem. Schmidt's subspace theorem extends Roth's results…