Related papers: Quantitative pyjama

We present a method to obtain upper bounds on covering numbers. As applications of this method, we reprove and generalize results of Rogers on economically covering Euclidean $n$-space with translates of a convex body, or more generally,…

The problem of fitting concentric ellipses is a vital problem in image processing, pattern recognition, and astronomy. Several methods have been developed but all address very special cases. In this paper, this problem has been investigated…

Suppose $A \in \mathbb{R}^{n \times n}$ is invertible and we are looking for the solution of $Ax = b$. Given an initial guess $x_1 \in \mathbb{R}$, we show that by reflecting through hyperplanes generated by the rows of $A$, we can generate…

We solve two problems posed by Krape\v{z} by finding a basis of seven independent axioms for the variety of rectangular loops. Six of these axioms form a basis for the variety of rectangular quasigroups. The proofs of the lemmas showing…

In algorithms for finite metric spaces, it is common to assume that the distance between two points can be computed in constant time, and complexity bounds are expressed only in terms of the number of points of the metric space. We…

We study approximation in the unit interval by rational numbers whose numerators are selected randomly with certain probabilities. Previous work showed that an analogue of Khintchine's Theorem holds in a similar random model and raised the…

Let $\mathbb{F}_p$ be a prime field, and ${\mathcal E}$ a set in $\mathbb{F}_p^2$. Let $\Delta({\mathcal E})=\{||x-y||: x,y \in {\mathcal E} \}$, the distance set of ${\mathcal E}$. In this paper, we provide a quantitative connection…

We consider the $(1+\epsilon)$-approximate nearest neighbor search problem: given a set $X$ of $n$ points in a $d$-dimensional space, build a data structure that, given any query point $y$, finds a point $x \in X$ whose distance to $y$ is…

We first describe a reduction from the problem of lower-bounding the number of distinct distances determined by a set $S$ of $s$ points in the plane to an incidence problem between points and a certain class of helices (or parabolas) in…

There has been a surge of progress in recent years in developing algorithms for testing and learning quantum states that achieve optimal copy complexity. Unfortunately, they require the use of entangled measurements across many copies of…

For $\Omega_\e=(0,\e)\times (0,1)$ a thin rectangle, we consider minimization of the two-dimensional nonlocal isoperimetric problem given by \[ \inf_u E^{\gamma}_{\Omega_\e}(u)\] where \[ E^{\gamma}_{\Omega_\e}(u):=…

This paper investigates the soft covering lemma under both the relative entropy and the total variation distance as the measures of deviation. The exact order of the expected deviation of the random i.i.d. code for the soft covering problem…

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$…

Exact results are derived, specifically the perihelion shift and the Kepler orbit, for a bound test particle in the Schwarzschild metric with cosmological constant $\Lambda=0$. A series expansion, of $\Delta\phi = 2(2(1-2M/p(3-e))^{-1/2}…

We study a random matching problem on closed compact $2$-dimensional Riemannian manifolds (with respect to the squared Riemannian distance), with samples of random points whose common law is absolutely continuous with respect to the volume…

We revisit the classic task of finding the shortest tour of $n$ points in $d$-dimensional Euclidean space, for any fixed constant $d \geq 2$. We determine the optimal dependence on $\varepsilon$ in the running time of an algorithm that…

In this work we study systems consisting of a group of moving particles. In such systems, often some important parameters are unknown and have to be estimated from observed data. Such parameter estimation problems can often be solved via a…

The Ulam distance of two permutations on $[n]$ is $n$ minus the length of their longest common subsequence. In this paper, we show that for every $\varepsilon>0$, there exists some $\alpha>0$, and an infinite set $\Gamma\subseteq…

We establish a structure theorem for minimizing sequences for the isoperimetric problem on noncompact $\mathsf{RCD}(K,N)$ spaces $(X,\mathsf{d},\mathcal{H}^N)$. Under the sole (necessary) assumption that the measure of unit balls is…

The Orbit Problem consists of determining, given a matrix $A\in \mathbb{R}^{d\times d}$ and vectors $x,y\in \mathbb{R}^d$, whether there exists $n\in \mathbb{N}$ such that $A^n=y$. This problem was shown to be decidable in a seminal work of…