On multiplicatively badly approximable numbers.
@article{Badziahin2011OnMB, title={On multiplicatively badly approximable numbers.}, author={Dzmitry Badziahin}, journal={Mathematika}, year={2011}, volume={59}, pages={31-55} }
The Littlewood Conjecture states that liminf_{q\to \infty} q . ||qx|| . ||qy|| = 0 for all pairs (x,y) of real numbers. We show that with the additional factor of log q . loglog q the statement is false. Indeed, our main result implies that the set of (x,y) for which liminf_{q\to\infty} q . log q . loglog q . ||qx|| . ||qy|| > 0 is of full dimension.
15 Citations
Computation of the Infimum in the Littlewood Conjecture
- Mathematics, Computer Science
- Exp. Math.
- 2016
- 1
- PDF
Multiplicatively badly approximable matrices up to logarithmic factors
- Mathematics
- 2020
- Highly Influenced
- PDF
SOME REFINED RESULTS ON THE MIXED LITTLEWOOD CONJECTURE FOR PSEUDO-ABSOLUTE VALUES
- Mathematics
- 2017
- 1
- Highly Influenced
- PDF
Littlewood and Duffin--Schaeffer-type problems in diophantine approximation.
- Mathematics
- 2020
- 1
- Highly Influenced
- PDF
Lattice-based integration algorithms: Kronecker sequences and rank-1 lattices
- Mathematics, Computer Science
- ArXiv
- 2016
- 2
- Highly Influenced
- PDF
References
SHOWING 1-10 OF 10 REFERENCES
Fractal geometry - mathematical foundations and applications
- Mathematics, Computer Science
- 1990
- 5,752
- PDF
Velani: Multiplicatively badly approximable numbers and generalised Cantor sets. Pre-print: arXiv:1007.1848
- 2010
Velani: On a problem in simultaneously Diophantine approximation: Schmidt’s conjecture. Pre-print
- 2010
Moshchevitin: Badly approximable numbers and Littlewood-type problems. Pre-print: arXiv:0905.0830v1
- 2009
Velani: On a problem in simultaneously Diophantine approximation: Littlewood’s conjecture
- Acta Math
- 2000