Disproof of the uniform Littlewood conjecture
Johannes Schleischitz

TL;DR
This paper disproves the uniform Littlewood Conjecture by showing counterexamples form a residual set and establishing positive Hausdorff dimension, also disproving related p-adic and S-arithmetic variants.
Contribution
It provides the first disproof of the uniform Littlewood Conjecture and related variants, using semi-constructive methods involving Zaremba's conjecture and finite field estimates.
Findings
Counterexamples form a residual set for ULC
Hausdorff dimension of solutions is at least 1
Disproves uniform p-adic and S-arithmetic Littlewood problems
Abstract
We show that the uniform Littlewood Conjecture (ULC) recently introduced by Bandi, Fregoli and Kleinbock is false. More precisely the counterexamples form a residual set, the method further suggests positive Hausdorff dimension. For a mildly twisted problem, we indeed separately show that the Hausdorff dimension is at least . Moreover, we disprove a uniform version of the -adic Littlewood problem, as well as some twisted weaker version of a more general -arithmetic setting, for any proper subset (possible infinite) of primes . The latter contrasts the classical (non-uniform) case where the answer is known to be affirmative when has at least two elements. The disproof of ULC, our main new result, is semi-constructive; the non-constructive part involves effective results on Zaremba's famous conjecture by Bourgain and Kontorovich, as well as estimates for the cardinality of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Limits and Structures in Graph Theory · Computability, Logic, AI Algorithms
