Related papers: Circle coverings driven by arithmetic sequences: a…
We study the distribution of sequences of the form $(q_ny)_{n=1}^\infty$, where $(q_n)_{n=1}^\infty$ is some increasing sequence of integers. In particular, we study the Lebesgue measure and find bounds on the Hausdorff dimension of the set…
Let $(a_n)_{n \in \mathbb{N}}$ be a Hadamard lacunary sequence. We give upper bounds for the maximal gap of the set of dilates $\{a_n \alpha\}_{n \leq N}$ modulo 1, in terms of $N$. For any lacunary sequence $(a_n)_{n \in \mathbb{N}}$ we…
Motivated by the random covering problem and the study of Dirichlet uniform approximable numbers, we investigate the uniform random covering problem. Precisely, consider an i.i.d. sequence $\omega=(\omega_n)_{n\geq 1}$ uniformly distributed…
In this paper, we study the Dvoretzky covering problem with non-uniformly distributed centers. When the probability law of the centers admits an absolutely continuous density which satisfies a regular condition on the set of essential…
$\delta$-Covering, for some covering range $\delta>0$, is a continuous facility location problem on undirected graphs where all edges have unit length. The facilities may be positioned on the vertices as well as on the interior of the…
Let $\varepsilon>0$. We construct an explicit, full-measure set of $\alpha \in[0,1]$ such that if $\gamma \in \mathbb{R}$ then, for almost all $\beta \in[0,1]$, if $\delta \in \mathbb{R}$ then there are infinitely many integers $n\geq 1$…
We exploit dynamical properties of diagonal actions to derive results in Diophantine approximations. In particular, we prove that the continued fraction expansion of almost any point on the middle third Cantor set (with respect to the…
We study approximability of subdense instances of various covering problems on graphs, defined as instances in which the minimum or average degree is Omega(n/psi(n)) for some function psi(n)=omega(1) of the instance size. We design new…
Let C_n be the origin-containing cluster in subcritical percolation on the lattice (1/n) Z^d, viewed as a random variable in the space Omega of compact, connected, origin-containing subsets of R^d, endowed with the Hausdorff metric delta.…
For any $\beta > 1$, denoted by $r_n(x,\beta)$ the maximal length of consecutive zeros amongst the first $n$ digits of the $\beta$-expansion of $x\in[0,1]$. The limit superior (respectively limit inferior) of $\frac{r_n(x,\beta)}{n}$ is…
We prove that almost any pair of real numbers a,b, satisfies the following inhomogeneous uniform version of Littlewood's conjecture: (*) forall x,y in R, liminf_{|n|\to\infty} |n|<na - x> <nb - y> = 0, where <-> denotes the distance from…
A covering code is a subset $\mathcal{C} \subseteq \{0,1\}^n$ with the property that any $z \in \{0,1\}^n$ is close to some $c \in \mathcal{C}$ in Hamming distance. For every $\epsilon,\delta>0$, we show a construction of a family of codes…
For estimating a lower bounded location or mean parameter for a symmetric and logconcave density, we investigate the frequentist performance of the $100(1-\alpha)%$ Bayesian HPD credible set associated with priors which are truncations of…
Given a conic $\mathcal{C}$ over $\mathbb{Q}$, it is natural to ask what real points on $\mathcal{C}$ are most difficult to approximate by rational points of low height. For the analogous problem on the real line (for which the least…
We prove that almost all real numbers (with respect to Lebesgue measure) are approximated by the convergents of their $\beta$-expansions with the exponential order $\beta^{-n}$. Moreover, the Hausdorff dimensions of sets of the real numbers…
We provide the currently fastest randomized (1+epsilon)-approximation algorithm for the closest vector problem in the infinity norm. The running time of our method depends on the dimension n and the approximation guarantee epsilon by 2^O(n)…
The classic lower bound of Kuhn, Moscibroda and Wattenhofer [JACM 2016] states that approximate maximum matching and approximate vertex cover (among other problems) in the LOCAL model require $\Omega(\min\{\sqrt{\frac{\log n}{\log\log n}},…
Let $X_1,X_2, \ldots $ be independent random uniform points in a bounded domain $A \subset \mathbb{R}^d$ with smooth boundary. Define the coverage threshold $R_n$ to be the smallest $r$ such that $A$ is covered by the balls of radius $r$…
Given a sphere of any radius $r$ in an $n$-dimensional Euclidean space, we study the coverings of this sphere with solid spheres of radius one. Our goal is to design a covering of the lowest covering density, which defines the average…
The classical Dvoretzky covering problem asks for conditions on the sequence of lengths $\{\ell_n\}_{n\in \mathbb{N}}$ so that the random intervals $I_n : = (\omega_n -(\ell_n/2), \omega_n +(\ell_n/2))$ where $\omega_n$ is a sequence of…