Related papers: A randomized version of the Littlewood Conjecture
We prove a Diophantine approximation inequality for rational points in varieties of any dimension, in the direction of Vojta's conjecture with truncated counting functions. Our results also provide a bound towards the $abc$ conjecture which…
Consider a quadratic polynomial $f\left(\xi_{1},\dots,\xi_{n}\right)$ of independent Bernoulli random variables. What can be said about the concentration of $f$ on any single value? This generalises the classical Littlewood--Offord problem,…
This article deals with plausible reasoning from incomplete knowledge about large-scale spatial properties. The availableinformation, consisting of a set of pointwise observations,is extrapolated to neighbour points. We make use of belief…
A basic question of Diophantine approximation, which is the first issue we discuss, is to investigate the rational approximations to a single real number. Next, we consider the algebraic or polynomial approximations to a single complex…
A known Hardy-Littlewood theorem asserts that if both the function and its conjugate are of bounded variation, then their Fourier series are absolutely convergent. It is proved in the paper that the same result holds true for functions on…
We give $L^1$-norm estimates for exponential sums of a finite sets $A$ consisting of integers or lattice points. Under the assumption that $A$ possesses sufficient multidimensional structure, our estimates are stronger than those of…
Randomized higher-order computation can be seen as being captured by a lambda calculus endowed with a single algebraic operation, namely a construct for binary probabilistic choice. What matters about such computations is the probability of…
In this paper, we present a possible theoretical explanation for benford's law. We develop a recursive relation between the probabilities, using simple intuitive ideas. We first use numerical solutions of this recursion and verify that the…
Given a knot in 3-space, one can associate a sequence of Laurrent polynomials, whose $n$th term is the $n$th colored Jones polynomial. The Generalized Volume Conjecture states that the value of the $n$-th colored Jones polynomial at $\exp(2…
The article presents a generalization of the classical Hardy-Littlewood conjecture concerning the density of prime tuples to the case of tuples consisting of almost-prime numbers (numbers with a specified quantity of prime divisors). The…
We study problems on covering $[0,1)$ by shrinking intervals centered at the points $\{q_n x\}$, where $(q_n)_{n\in \mathbb{N}}$ is a given real-valued sequence and $x \in [0,1)$ is random. For real-valued lacunary sequences…
Expectation thresholds arise from a class of integer linear programs (LPs) that are fundamental to the study of thresholds in large random systems. An avenue towards estimating expectation thresholds comes from the fractional relaxation of…
In this paper, we study the mixed Littlewood conjecture with pseudo-absolute values. For any pseudo absolute value sequence $\mathcal{D}$, we obtain the sharp criterion such that for almost every $\alpha$ the inequality \begin{equation*}…
We investigate in this paper the distribution of the discrepancy of various lattice counting functions. In particular, we prove that the number of lattice points contained in certain domains defined by products of linear forms satisfies a…
We consider rational points on the sphere and investigate their equidistribution in shrinking spherical caps. For the two-dimensional sphere, we leverage Hecke operators to obtain a significantly improved small-scale equidistribution bound,…
We study approximation in the unit interval by rational numbers whose numerators are selected randomly with certain probabilities. Previous work showed that an analogue of Khintchine's Theorem holds in a similar random model and raised the…
Linearly repetitive cut and project sets are mathematical models for perfectly ordered quasicrystals. In a previous paper we presented a characterization of linearly repetitive cut and project sets. In this paper we extend the classical…
This paper investigates integer multiplication of continued fractions using geometric structures. In particular, this paper shows that integer multiplication of a continued fraction can be represented by replacing one triangulation of an…
We present a class of lattices in R^d (d >= 2) which we call GL-lattices and conjecture that any lattice is such. This conjecture is referred to as GLC. Littlewood's conjecture amounts to saying that Z^2 is GL. We then prove existence of GL…
Hardy conjectured that the error term arising from approximating the number of lattice points lying in a radius-$R$ disc by its area is $O(R^{1/2+o(1)})$. One source of support for this conjecture is a folklore heuristic that uses i.i.d.…