Related papers: Circle coverings driven by arithmetic sequences: a…

We establish that the optimal bound for the size of the smallest integral solution of the Oppenheim Diophantine approximation problem $\abs{Q(x)-\xi}< \epsilon$ for a generic ternary form $Q$ is $\abs{x}\ll \epsilon^{-1}$. We also establish…

Let $\{a_n\}_{n\in\mathbb{N}}$, $\{b_n\}_{n\in \mathbb{N}}$ be two infinite subsets of positive integers and $\psi:\mathbb{N}\to \mathbb{R}_{>0}$ be a positive function. We completely determine the Hausdorff dimensions of the set of all…

We study a random partial covering model on the $(d-1)$-dimensional unit sphere, where $N$ spherical caps are placed independently and uniformly at random, each covering a surface fraction of $1/N$. This model provides a continuous…

Let $E\subset [0,1)^{d}$ be a set supporting a probability measure $\mu$ with Fourier decay $|\widehat{\mu}({\bf{t}})|\ll (\log |{\bf{t}}|)^{-s}$ for some constant $s>d+1.$ Consider a sequence of expanding integral matrices…

We establish a connection between gaps problems in Diophantine approximation and the frequency spectrum of patches in cut and project sets with special windows. Our theorems provide bounds for the number of distinct frequencies of patches…

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 consider badly approximable numbers in the case of dyadic diophantine approximation. For the unit circle $\mathbb{S}$ and the smallest distance to an integer $\|\cdot\|$ we give elementary proofs that the set $F(c) = \{x \in \mathbb{S}:…

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…

There are two main interrelated goals of this paper. Firstly we investigate the sums \[ S_N(\alpha,\gamma):=\sum_{n=1}^N\frac{1}{n\|n\alpha-\gamma\|}~~~\text{and}~~~ R_N(\alpha,\gamma):=\sum_{n=1}^N\frac{1}{\|n\alpha-\gamma\|}\,, \] where…

A central problem in discrete geometry, known as Hadwiger's covering problem, asks what the smallest natural number $N\left(n\right)$ is such that every convex body in ${\mathbb R}^{n}$ can be covered by a union of the interiors of at most…

We consider the distribution of the orbits of the number 1 under the $\beta$-transformations $T_\beta$ as $\beta$ varies. Mainly, the size of the set of $\beta>1$ for which a given point can be well approximated by the orbit of 1 is…

In the maximum coverage problem, we are given subsets $T_1, \ldots, T_m$ of a universe $[n]$ along with an integer $k$ and the objective is to find a subset $S \subseteq [m]$ of size $k$ that maximizes $C(S) := \Big|\bigcup_{i \in S}…

Fundamental questions in Diophantine approximation are related to the Hausdorff dimension of sets of the form $\{x\in \mathbb{R}: \delta_x = \delta\}$, where $\delta \geq 1$ and $\delta_x$ is the Diophantine approximation rate of an…

Determining the minimum density of a covering of $\mathbb{R}^{n}$ by Euclidean unit balls as $n\to\infty$ is a major open problem, with the best known results being the lower bound of $\left(\mathrm{e}^{-3/2}+o(1)\right)n$ by Coxeter, Few…

Given a collection S of subsets of some set U, and M a subset of U, the set cover problem is to find the smallest subcollection C of S such that M is a subset of the union of the sets in C. While the general problem is NP-hard to solve,…

We consider approximation algorithms for covering integer programs of the form min $\langle c, x \rangle $ over $x \in \mathbb{N}^n $ subject to $A x \geq b $ and $x \leq d$; where $A \in \mathbb{R}_{\geq 0}^{m \times n}$, $b \in…

A \emph{chain} in the unit $n$-cube is a set $C\subset [0,1]^n$ such that for every $\mathbf{x}=(x_1,\ldots,x_n)$ and $\mathbf{y}=(y_1,\ldots,y_n)$ in $C$ we either have $x_i\le y_i$ for all $i\in [n]$, or $x_i\ge y_i$ for all $i\in [n]$.…

Let Q be an infinite set of positive integers. Denote by W_{\tau, n}(Q) (resp. W_{\tau, n}) the set of points in dimension n simultaneously \tau--approximable by infinitely many rationals with denominators in Q (resp. in N*). A non--trivial…

We show that the minimal number of skewed hyperplanes that cover the hypercube $\{0,1\}^{n}$ is at least $\frac{n}{2}+1$, and there are infinitely many $n$'s when the hypercube can be covered with $n-\log_{2}(n)+1$ skewed hyperplanes. The…

We develop a new technique for constructing sparse graphs that allow us to prove near-linear lower bounds on the round complexity of computing distances in the CONGEST model. Specifically, we show an $\widetilde{\Omega}(n)$ lower bound for…