Research output: Working paper

100 KB, PDF document

Date | Published - 25 Oct 2016 |
---|---|

Original language | Undefined/Unknown |

The Littlewood Conjecture in Diophantine approximation can be thought of as a problem about covering the plane by a union of hyperbolas centered at rational points. In this paper we consider the problem of translating the center of each hyperbola by a random amount which depends on the denominator of the corresponding rational. Using a randomized covering argument we prove that, not only is this randomized version of the Littlewood Conjecture true for almost all choices of centers, an even stronger statement with an extra factor of a logarithm also holds.

6 pages, newer version: added reference [1]

- math.NT, 11J13, 60D05

## Gaps theorems and statistics of patterns in quasicrystals

Project: Research project (funded) › Research

## Diophantine approximation, chromatic number, and equivalence classes of separated nets

Project: Research project (funded) › Research

## Career Acceleration Fellowship: Circle rotations and their generalisation in Diophantine approximation

Project: Research project (funded) › Research

Find related publications, people, projects, datasets and more using interactive charts.