Related papers: On the error bounds for visible points in some cut…
Light from `point sources' such as supernovae is observed with a beam width of order of the sources' size - typically less than 1 AU. Such a beam probes matter and curvature distributions that are very different from coarse-grained…
In this paper we are proving the following fact. Let P be an arbitrary simple polygon, and let S be an arbitrary set of 15 points inside P. Then there exists a subset T of S that is not "visually discernible", that is, T is not equal to the…
We construct a general framework for deriving error bounds for conic feasibility problems. In particular, our approach allows one to work with cones that fail to be amenable or even to have computable projections, two previously challenging…
The inverse of the star-discrepancy problem asks for point sets $P_{N,s}$ of size $N$ in the $s$-dimensional unit cube $[0,1]^s$ whose star-discrepancy $D^\ast(P_{N,s})$ satisfies $$D^\ast(P_{N,s}) \le C \sqrt{s/N},$$ where $C> 0$ is a…
We investigate the asymptotic density of error-correcting codes with good distance properties and prescribed linearity degree, including sublinear and nonlinear codes. We focus on the general setting of finite translation-invariant metric…
We propose a new method to count objects of specific categories that are significantly smaller than the ground sampling distance of a satellite image. This task is hard due to the cluttered nature of scenes where different object categories…
We briefly review the diffraction of quasicrystals and then give an elementary alternative proof of the diffraction formula for regular cut-and-project sets, which is based on Bochner's theorem from Fourier analysis. This clarifies a common…
Kernel density estimation is a popular method for estimating unseen probability distributions. However, the convergence of these classical estimators to the true density slows down in high dimensions. Moreover, they do not define meaningful…
The theory of regular model sets is highly developed, but does not cover examples such as the visible lattice points, the k-th power-free integers, or related systems. They belong to the class of weak model sets, where the window may have a…
We prove two conjectures from [M. R. Douglas, B. Shiffman and S. Zelditch, Critical points and supersymmetric vacua, II: Asymptotics and extremal metrics. J. Differential Geom. 72 (2006), no. 3, 381-427] concerning the expected number of…
This article consists in two independent parts. In the first one, we investigate the geometric properties of almost periodicity of model sets (or cut-and-project sets, defined under the weakest hypotheses); in particular we show that they…
Quantitative dynamical models of galaxies require deprojecting the observed surface brightness to determine the luminosity density of the galaxy. Existing deprojection methods for axisymmetric galaxies assume that a unique deprojection…
We present a new object representation, called Dense RepPoints, that utilizes a large set of points to describe an object at multiple levels, including both box level and pixel level. Techniques are proposed to efficiently process these…
Computable and sharp error bounds are derived for asymptotic expansions for linear differential equations having a simple turning point. The expansions involve Airy functions and slowly varying coefficient functions. The sharpness of the…
We are given a set of $n$ points that might be uniformly distributed in the unit square $[0,1]^2$. We wish to test whether the set, although mostly consisting of uniformly scattered points, also contains a small fraction of points sampled…
The deprojection of the surface brightness of axisymmetric galaxies is indeterminate unless the galaxy is seen edge-on. In practice, this problem is often circumvented by making ad hoc assumptions about the density distribution. However,…
We study the problem of testing the existence of a dense subhypergraph. The null hypothesis is an Erdos-Renyi uniform random hypergraph and the alternative hypothesis is a uniform random hypergraph that contains a dense subhypergraph. We…
In this article we establish an asymptotic formula for the number of rational points, with bounded denominators, within a given distance to a compact submanifold $\mathcal{M}$ of $\mathbb{R}^M$ with a certain curvature condition. Our result…
The observed values of density parameters inevitably involve uncertainties. We study the conditions for detectability and undetectability of cosmic topology in presence of such uncertainties. We present closed analytical forms of…
Given S_1, a finite set of points in the plane, we define a sequence of point sets S_i as follows: With S_i already determined, let L_i be the set of all the line segments connecting pairs of points of the union of S_1,...,S_i, and let…