Related papers: Littlewood's problem for sets with multidimensiona…
We show that the $L^1$ norm of an exponential sum of length $X$ and with coefficients equal to the Liouville or M\"{o}bius function is at least $\gg_{\varepsilon} X^{1/4 - \varepsilon}$ for any given $\varepsilon$. For the Liouville…
In this article we compare the set of integer points in the homothetic copy $n\Pi$ of a lattice polytope $\Pi\subseteq\R^d$ with the set of all sums $x_1+\cdots+x_n$ with $x_1,...,x_n\in \Pi\cap\Z^d$ and $n\in\N$. We give conditions on the…
We study the problem of counting lattice points of a polytope that are weighted by an Ehrhart quasi-polynomial of a family of parametric polytopes. As applications one can compute integrals and maximum values of such quasi-polynomials, as…
Let $\mathfrak{L}_1$, $\mathfrak{L}_2$, $\mathfrak{L}_3$ be finite collections of $L_1$, $L_2$, $L_3$, respectively, lines in $\mathbb{R}^3$, and $J(\mathfrak{L}_1, \mathfrak{L}_2,\mathfrak{L}_3)$ the set of multijoints formed by them, i.e.…
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…
The Littlewood-Offord problem is a classical question in probability theory and discrete mathematics, proposed, firstly by Littlewood and Offord in the 1940s. Given a set $A$ of integer, this problem asks for an upper bound on the…
We give an explicit upper bound on the volume of lattice simplices with fixed positive number of interior lattice points. The bound differs from the conjectural sharp upper bound only by a linear factor in the dimension. This improves…
We establish new estimates for the size and structure of the nodal set $\{u=0\}$ and the singular set $\{u=|\nabla u|=0\}$ of solutions $u$ to parabolic inequalities with parabolic Lipschitz coefficients. In particular, we show that almost…
The Hardy--Littlewood inequalities for $m$-linear forms on $\ell_{p}$ spaces are known just for $p>m$. The critical case $p=m$ was overlooked for obvious technical reasons and, up to now, the only known estimate is the trivial one. In this…
In 1961, P. Erd\H{o}s, A. Ginzburg, and A. Ziv proved a remarkable theorem stating that each set of $2n-1$ integers contains a subset of size $n$, the sum of whose elements is divisible by $n$. We will prove a similar result for pairs of…
The Hardy--Littlewood inequalities for multilinear forms on sequence spaces state that for all positive integers $m,n\geq2$ and all $m$-linear forms $T:\ell_{p_{1}}^{n}\times\cdots\times\ell_{p_{m}}^{n}\rightarrow\mathbb{K}$…
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…
Erd\H{o}s posed the question whether there exist infinitely many sets of consecutive numbers whose least common multiple (lcm) exceeds the lcm of another, larger set with greater consecutive numbers. In this paper, we answer this question…
We present a new proof of Thurston's theorem that the unit ball of a seminorm on $\mathbf{R}^d$ taking integer values on $\mathbf{Z}^d$ is a polyhedra defined by finitely many inequalities with integer coefficients.
We prove several results related to the theorem of Logvinenko and Sereda on determining sets for functions with Fourier transforms supported in an interval. We obtain a polynomial instead of exponential bound in this theorem, and we extend…
Shnirel'man's inequality and Shnirel'man's basis theorem are fundamental results about sums of sets of positive integers in additive number theory. It is proved that these results are inherently order-theoretic and extend to partially…
Motivated by problems of uncertainty propagation and robust estimation we are interested in computing a polynomial sublevel set of fixed degree and minimum volume that contains a given semialgebraic set K. At this level of generality this…
In this paper we study multi-parameter projection theorems for fractal sets. With the help of these estimates, we recover results about the size of $A \cdot A+...+A \cdot A$, where $A$ is a subset of the real line of a given Hausdorff…
A famous conjecture of Littlewood (c. 1930) concerns approximating two real numbers by rationals of the same denominator, multiplying the errors. In a lesser-known paper, Wang and Yu (1981) established an asymptotic formula for the number…
In this paper, we consider universal sums of generalized polygonal numbers. Fixing $m\in\mathbb{N}_{\geq 3}$, we show two finiteness theorems for universal sums of generalized polygonal numbers whose inputs have a restricted number $L$ of…