Related papers: Coverage of space in Boolean models
It is well-known that entire functions whose spectrum belongs to a fixed bounded set $S$ admit real uniformly discrete uniqueness sets $\Lambda$. We show that the same is true for much wider spaces of continuous functions. In particular,…
We study completeness of the spaces $\mathcal{P}_s^=$ of probability measures in $\mathbb{R}^N$ which have equal (prescribed) moments up to order $s \in \mathbb{N}$, endowed with the metric $d_s(\mu,\nu)=\sup_{x \in \mathbb{R}^N\setminus…
Suppose $\Lambda$ is a discrete infinite set of nonnegative real numbers. We say that $ {\Lambda}$ is of type 1 if the series $s(x)=\sum_{\lambda\in\Lambda}f(x+\lambda)$ satisfies a zero-one law. This means that for any non-negative…
We provide a characterization of discrete sets $\Lambda \subset \mathbb{R}$ that admit a function whose $\Lambda$-translates are complete in the Hardy space $H^1(\mathbb{R})$. In particular, we show that such a set cannot be uniformly…
We develop a general framework for the probabilistic analysis of random finite point clouds in the context of topological data analysis. We extend the notion of a barcode of a finite point cloud to compact metric spaces. Such a barcode…
The symplectic spectral metric on the set of Lagrangian submanifolds or Hamiltonian maps can be used to define a completion of these spaces. For an element of such a completion, we define its $\gamma$-support. We also define the notion of…
This paper approaches the construction of the universal completion of the Riesz space $\mathrm{C}(L)$ of continuous real functions on a completely regular frame $L$ in two different ways. Firstly as the space of continuous real functions on…
As Deep Learning (DL) models are increasingly applied in safety-critical domains, ensuring their quality has emerged as a pressing challenge in modern software engineering. Among emerging validation paradigms, coverage-guided testing (CGT)…
In this paper, we address the random sampling problem for the class of Mellin band-limited functions BT which is concentrated on a bounded cube. It is established that any function in BT can be approximated by an element in a…
We give error bounds which demonstrate optimal rates of convergence in the CLT for the total covered volume and the number of isolated shapes, for germ-grain models with fixed grain radius over a binomial point process of $n$ points in a…
Simple random coverage models, well studied in Euclidean space, can also be defined on a general compact metric space. By analogy with the geometric models, and with the discrete coupon collector's problem and with cover times for finite…
It is well-known that a metric space $(X, d)$ is complete iff the set $X$ is closed in every metric superspace of $(X, d)$. For a given pseudometric space $(Y, \rho)$, we describe the maximal class $\mathbf{CEC}(Y, \rho)$ of superspaces of…
In this paper we use finite vector spaces (finite dimension, over finite fields) as a non-standard computational model of linear logic. We first define a simple, finite PCF-like lambda-calculus with booleans, and then we discuss two finite…
We present algorithms for the Max-Cover and Max-Unique-Cover problems in the data stream model. The input to both problems are $m$ subsets of a universe of size $n$ and a value $k\in [m]$. In Max-Cover, the problem is to find a collection…
Suppose that each proper subset of a set $S$ of points in a vector space is contained in the union of planes of specified dimensions, but $S$ itself is not contained in any such union. How large can $|S|$ be? We prove a general upper bound…
Consider an iterated function system consisting of similarities on the complex plane of the form $g_{i}(z) = \lambda_i z + t_i,\ \lambda_i, t_i \in \mathbb{C},\ |\lambda_i|<1, i=1,\ldots, k$. We prove that for almost every choice of…
We prove that the covering radius of an $N$-point subset $X_N$ of the unit sphere $S^d \subset R^{d+1}$ is bounded above by a power of the worst-case error for equal weight cubature $\frac{1}{N}\sum_{\mathbf{x} \in X_N}f(\mathbf{x}) \approx…
Finite unions of convex sets are a central object of study in discrete and computational geometry. In this paper we initiate a systematic study of complements of such unions -- i.e., sets of the form $S=\mathbb{R}^d \setminus (\cup_{i=1}^n…
A \emph{covering array} is an $N \times k$ array of elements from a $v$-ary alphabet such that every $N \times t$ subarray contains all $v^t$ tuples from the alphabet of size $t$ at least $\lambda$ times; this is denoted as $\CA_\lambda(N;…
The space $D'_\Lambda$ of distributions having their $C^\infty$ wavefront set in a cone $\Lambda$ has become important in physics because of its role in the formulation of quantum field theory in curved spacetime. It is also a basic object…