Related papers: An algorithm for computing the centered Hausdorff …
In this paper, we consider a problem of counting rational points near self-similar sets. Let $n\geq 1$ be an integer. We shall show that for some self-similar measures on $\mathbb{R}^n$, the set of rational points $\mathbb{Q}^n$ is…
We consider the directed Hausdorff distance between point sets in the plane, where one or both point sets consist of imprecise points. An imprecise point is modelled by a disc given by its centre and a radius. The actual position of an…
A uniform approach to computing with infinite objects like real numbers, tuples of these, compacts sets, and uniformly continuous maps is presented. In work of Berger it was shown how to extract certified algorithms working with the signed…
Computer model calibration is a crucial step in building a reliable computer model. In the face of massive physical observations, a fast estimation for the calibration parameters is urgently needed. To alleviate the computational burden, we…
We present a machine learning algorithm for the prediction of molecule properties inspired by ideas from density functional theory. Using Gaussian-type orbital functions, we create surrogate electronic densities of the molecule from which…
We present an algorithm for constructing the fixed point of a general non-isometric similarity of the plane.
In this paper we prove an upper bound on the "size" of the set of multiplicatively $\psi$-approximable points in $\mathbb R^d$ for $d>1$ in terms of $f$-dimensional Hausdorff measure. This upper bound exactly complements the known lower…
Quantifying entanglement in quantum systems is an important yet challenging task due to its NP-hard nature. In this work, we propose an efficient algorithm for evaluating distance-based entanglement measures. Our approach builds on…
Quantifying coherence and entanglement is extremely important in quantum information processing. Here, we present numerical and analytical results for the geometric measure of coherence, and also present numerical results for the geometric…
Let $X=\{X(t),t\in\mathbb{R}^N\}$ be a random field with values in $\mathbb{R}^d$. For any finite Borel measure $\mu$ and analytic set $E\subset\mathbb{R}^N$, the Hausdorff and packing dimensions of the image measure $\mu_X$ and image set…
For a variant of the algorithm in [Pit19] (arXiv:1903.10816) to compute the approximate density or distribution function of a linear mixture of independent random variables known by a finite sample, it is presented a proof of the functional…
We present a certified algorithm based on subdivision for computing an isotopic approximation to any number of curves in the plane. Our algorithm is based on the certified curve approximation algorithm of Plantinga and Vegter. The main…
We present a certified algorithm based on subdivision for computing an isotopic approximation to any number of curves in the plane. Our algorithm is based on the certified curve approximation algorithm of Plantinga and Vegter. The main…
A method is developed for calculating effective sums of divergent series. This approach is a variant of the self-similar approximation theory. The novelty here is in using an algebraic transformation with a power providing the maximal…
We introduce general tools for designing efficient private estimation algorithms, in the high-dimensional settings, whose statistical guarantees almost match those of the best known non-private algorithms. To illustrate our techniques, we…
We prove a quantitative distortion theorem for iterated function systems that generate sets of continued fractions. As a consequence, we obtain upper and lower bounds on the Hausdorff dimension of any set of real or complex continued…
The clustering of a data set is one of the core tasks in data analytics. Many clustering algorithms exhibit a strong contrast between a favorable performance in practice and bad theoretical worst-cases. Prime examples are least-squares…
We consider (not self-similar) Cantor sets defined by a sequence of piecewise linear functions. We prove that the dimension of the harmonic measure on such a set is strictly smaller than its Hausdorff dimension. Some Hausdorff measure…
This paper deals with a method for the approximation of a spectral density function among the solutions of a generalized moment problem a` la Byrnes/Georgiou/Lindquist. The approximation is pursued with respect to the Kullback-Leibler…
Let $K \subset \mathbb{R}^{2}$ be a rotation and reflection free self-similar set satisfying the strong separation condition, with dimension $\dim K = s > 1$. Intersecting $K$ with translates of a fixed line, one can study the $(s -…