Related papers: Spherical Discrepancy Minimization and Algorithmic…
This paper has two agendas. Firstly, we exhibit new results for coverage processes. Let $p(n,m,\alpha)$ be the probability that $n$ spherical caps of angular radius $\alpha$ in $S^m$ do not cover the whole sphere $S^m$. We give an exact…
Integer least-squares problems, concerned with solving a system of equations where the components of the unknown vector are integer-valued, arise in a wide range of applications. In many scenarios the unknown vector is sparse, i.e., a large…
For most optimisation methods an essential assumption is the vector space structure of the feasible set. This condition is not fulfilled if we consider optimisation problems over the sphere. We present an algorithm for solving a special…
A range counting problem is specified by a set $P$ of size $|P| = n$ of points in $\mathbb{R}^d$, an integer weight $x_p$ associated to each point $p \in P$, and a range space ${\cal R} \subseteq 2^{P}$. Given a query range $R \in {\cal…
The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping unit balls which cover as much space as possible. We define a generalized version of the problem, where we allow each ball a limited amount of…
Two different versions of an optical theorem for a scattering body embedded inside a lossy background medium are derived in this paper. The corresponding fundamental upper bounds on absorption are then obtained in closed form by elementary…
Most of the work on checking spherical symmetry assumptions on the distribution of the $p$-dimensional random vector $Y$ has its focus on statistical tests for the null hypothesis of exact spherical symmetry. In this paper, we take a…
How to distribute a set of points uniformly on a spherical surface is a very old problem that still lacks a definite answer. In this work, we introduce a physical measure of uniformity based on the distribution of distances between points,…
We prove upper and lower bounds on the minimal spherical dispersion, improving upon previous estimates obtained by Rote and Tichy [Spherical dispersion with an application to polygonal approximation of curves, Anz. \"Osterreich. Akad. Wiss.…
We consider a variant of the set covering problem with uncertain parameters, which we refer to as the chance-constrained set multicover problem (CC-SMCP). In this problem, we assume that there is uncertainty regarding whether a selected set…
In this paper, we consider the upper bound of the probabilistic star discrepancy based on Hilbert space filling curve sampling. This problem originates from the multivariate integral approximation, but the main result removes the strict…
In [1], the author considered the problem of the optimal approximation of symmetric surfaces by biquadratic B\'ezier patches. Unfortunately, the results therein are incorrect, which is shown in this paper by considering the optimal…
In this paper we study the geometric discrepancy of explicit constructions of uniformly distributed points on the two-dimensional unit sphere. We show that the spherical cap discrepancy of random point sets, of spherical digital nets and of…
A new lower bound on the average reconstruction error variance of multidimensional sampling and reconstruction is presented. It applies to sampling on arbitrary lattices in arbitrary dimensions, assuming a stochastic process with constant,…
We prove an optimal $\Omega(n)$ lower bound on the randomized communication complexity of the much-studied Gap-Hamming-Distance problem. As a consequence, we obtain essentially optimal multi-pass space lower bounds in the data stream model…
This paper develops approximate message passing algorithms to optimize multi-species spherical spin glasses. We first show how to efficiently achieve the algorithmic threshold energy identified in our companion work, thus confirming that…
In this work, we study the tensor ring decomposition and its associated numerical algorithms. We establish a sharp transition of algorithmic difficulty of the optimization problem as the bond dimension increases: On one hand, we show the…
Given $N$ geodesic caps on the unit sphere in $\mathbb{R}^d$, and whose total normalized surface area sums to one, what is the maximal surface area their union can cover? In this work, we provide an asymptotically sharp upper bound for an…
Spherical regression explores relationships between variables on spherical domains. We develop a nonparametric model that uses a diffeomorphic map from a sphere to itself. The restriction of this mapping to diffeomorphisms is natural in…
Various real-world problems consist of partitioning a set of locations into disjoint subsets, each subset spread in a way that it covers the whole set with a certain radius. Given a finite set S, a metric d, and a radius r, define a subset…