Related papers: The intersection of algorithmically random closed …
We study the numerical integration problem for functions with infinitely many variables. The function spaces of integrands we consider are weighted reproducing kernel Hilbert spaces with norms related to the ANOVA decomposition of the…
We characterize the existence of certain geometric configurations in the fractal percolation limit set $A$ in terms of the almost sure dimension of $A$. Some examples of the configurations we study are: homothetic copies of finite sets,…
Shimizu and Takahashi have shown that every decreasing sequence of nonempty, bounded, closed, convex subsets of a complete, uniformly Takahashi convex metric space has nonempty intersection. It is well known that the Menger convexity is a…
The Hausdorff distance is a measure of (dis-)similarity between two sets which is widely used in various applications. Most of the applied literature is devoted to the computation for sets consisting of a finite number of points. This has…
Let $\psi:\mathbb{N}\rightarrow\mathbb{R}_+$ be a monotonically non-increasing function, and let $\psi_v:\mathbb{N}\rightarrow\mathbb{R}_+$ be defined by $\psi_v(q)=1/q^v$. In this article, we consider self-similar sets whose iterated…
Given a point and an expanding map on the unit interval, we consider the set of points for which the forward orbit under this map is bounded away from the given point. For maps like multiplication by an integer modulo 1, such sets have full…
Set intersection is a fundamental operation in information retrieval and database systems. This paper introduces linear space data structures to represent sets such that their intersection can be computed in a worst-case efficient way. In…
The topic of this paper is the distributed and incremental generation of long executions of concurrent systems, uniformly or more generally with weights associated to elementary actions. Synchronizing sequences of letters on alphabets…
We characterize the algorithmic dimensions (i.e., the lower and upper asymptotic densities of information) of infinite binary sequences in terms of the inability of learning functions having an algorithmic constraint to detect patterns in…
We study random subcube intersection graphs, that is, graphs obtained by selecting a random collection of subcubes of a fixed hypercube $Q_d$ to serve as the vertices of the graph, and setting an edge between a pair of subcubes if their…
We provide lower error bounds for randomized algorithms that approximate integrals of functions depending on an unrestricted or even infinite number of variables. More precisely, we consider the infinite-dimensional integration problem on…
Many inference problems, such as sequential decision problems like A/B testing, adaptive sampling schemes like bandit selection, are often online in nature. The fundamental problem for online inference is to provide a sequence of confidence…
Generalising a construction of Falconer, we consider classes of $G_\delta$-subsets of $\mathbb{R}^d$ with the property that sets belonging to the class have large Hausdorff dimension and the class is closed under countable intersections. We…
For a finite poset $P$, we study the expected size of the intersection of two independent uniformly random antichains. Equivalently, we evaluate the sum of $|A\cap A'|$ over all ordered pairs of antichains. For general posets this statistic…
In this paper, using the concept of natural density, we have introduced the notion of rough statistical convergence which is an extension of the notion of rough convergence in a partial metric space. We have defined the set of rough…
Randomized dimensionality reduction has been recognized as one of the fundamental techniques in handling high-dimensional data. Starting with the celebrated Johnson-Lindenstrauss Lemma, such reductions have been studied in depth for the…
For $n \in \mathbb{N}$ and $\varepsilon > 0$, given a sufficiently long sequence of events in a probability space all of measure at least $\varepsilon$, some $n$ of them will have a common intersection. A more subtle pattern: for any $0 < p…
This paper demonstrates that random, independently chosen equi-dimensional subspaces with a unitarily invariant distribution in a real Hilbert space provide nearly tight, nearly equiangular fusion frames. The angle between a pair of…
We introduce a definition of thickness in $\mathbb{R}^d$ and obtain a lower bound for the Hausdorff dimension of the intersection of finitely or countably many thick compact sets using a variant of Schmidt's game. As an application we prove…
This is a survey on recent developments on the Hausdorff dimension of projections and intersections for general subsets of Euclidean spaces, with an emphasis on estimates of the Hausdorff dimension of exceptional sets and on restricted…