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

We consider the boundary crossing problem for time-homogeneous diffusions and general curvilinear boundaries. Bounds are derived for the approximation error of the one-sided (upper) boundary crossing probability when replacing the original…

For each $1\leq i \le n$, let $k_i\geq 1$ and let $\Delta_i$ be a set of vertices of a non-degenerate simplex of $k_i+1$ points in $\mathbb{R}^{k_i+1}$. If $A\subseteq [0,1]^{k_1+1}\times \cdots \times [0,1]^{k_n+1}$ is a Lebesgue…

In 2004, J.C. Tong found bounds for the approximation quality of a regular continued fraction convergent of a rational number, expressed in bounds for both the previous and next approximation. We sharpen his results with a geometric method…

Let $\mu$ be a Gibbs measure of the doubling map $T$ of the circle. For a $\mu$-generic point $x$ and a given sequence $\{r_n\} \subset \R^+$, consider the intervals $(T^nx - r_n \pmod 1, T^nx + r_n \pmod 1)$. In analogy to the classical…

We study diophantine equations of the form ${a_1 + \ldots + a_n = 0}$ where the $a_i$'s are assumed to be coprime and to satisfy certain subsum conditions. We are interested in the limit superior of the qualities of the admissible solutions…

As the main problem, we consider covering of a $d$-dimensional cube by $n$ balls with reasonably large $d$ (10 or more) and reasonably small $n$, like $n=100$ or $n=1000$. We do not require the full coverage but only 90\% or 95\% coverage.…

Given $n\in\mathbb{N}$ and $\tau>\frac1n$, let $\mathcal{S}_n(\tau)$ denote the classical set of $\tau$-approximable points in $\mathbb{R}^n$, which consists of ${\bf x}\in \mathbb{R}^n$ that lie within distance $q^{-\tau-1}$ from the…

We investigate approximation to a given real number by algebraic numbers and algebraic integers of prescribed degree. We deal with both best and uniform approximation, and highlight the similarities and differences compared with the…

In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of them are generalized or specialized versions of set-cover and…

The present paper establishes upper and lower bounds on the speed of approximation in a wide range of natural Diophantine approximation problems. The upper and lower bounds coincide in many cases, giving rise to optimal results in…

Given a sequence of complex square matrices, $a_n$, consider the sequence of their partial products, defined by $p_n=p_{n-1}a_{n}$. What can be said about the asymptotics as $n\to\infty$ of the sequence $f(p_n)$, where $f$ is a continuous…

We show that Set Cover on instances with $N$ elements cannot be approximated within $(1-\gamma)\ln N$-factor in time exp($N^{\gamma-\delta})$, for any $0 < \gamma < 1$ and any $\delta > 0$, assuming the Exponential Time Hypothesis. This…

This survey hinges on the interplay between regularity and approximation for linear and quasi-linear fractional elliptic problems on Lipschitz domains. For the linear Dirichlet integral Laplacian, after briefly recalling H\"older regularity…

We show how the Stefan type free boundary problem with random diffusion in one space dimension can be approximated by the corresponding free boundary problem with nonlocal diffusion. The approximation problem is a slightly modified version…

We establish effective convergence rates in the Doeblin-Lenstra law, describing the limiting distribution of approximation coefficients arising from continued fraction convergents of a typical real number. More generally, we prove…

We investigate the densities of the sets of abundant numbers and of covering numbers, integers $n$ for which there exists a distinct covering system where every modulus divides $n$. We establish that the set $\mathcal{C}$ of covering…

An almost $k$-cover of the hypercube $Q^n = \{0,1\}^n$ is a collection of hyperplanes that avoids the origin and covers every other vertex at least $k$ times. When $k$ is large with respect to the dimension $n$, Clifton and Huang…

We establish arithmetical properties and provide essential bounds for bi-sequences of approximation coefficients associated with the natural extension of maps, leading to continued fraction-like expansions. These maps are realized as the…

For estimating a positive normal mean, Zhang and Woodroofe (2003) as well as Roe and Woodroofe (2000) investigate 100($1-\alpha)%$ HPD credible sets associated with priors obtained as the truncation of noninformative priors onto the…

The paper is devoted to the problem of estimating the constant of the best Diophantine approximations. The estimates of lower bound $ C_n $ for $ n = 5 $ and $ n = 6 $ was improved. The first chapter gives an overview of the history of…