Related papers: Sets resilient to erosion

Let a $R$-body be a closed set, complement of union of open balls of radius $R$ in the Euclidean space. Properties generalizing similar ones for convex sets are proved for the family of $R$-bodies; properties for the family of sets…

A standard way of approximating or discretizing a metric space is by taking its Rips complexes. These approximations for all parameters are often bound together into a filtration, to which we apply the fundamental group or the first…

The medial axis of a closed set is well established tool in pattern recognition, cherished for its power of reconstruction of domains. In this article we fill this gap answering the question which sets precisely are reconstructible from the…

We consider the collection of uniformly discrete point sets in Euclidean space equipped with the vague topology. For a point set in this collection, we characterise minimality of an associated dynamical system by almost repetitivity of the…

We address the problem of one dimensional segment detection and estimation, in a regression setup. At each point of a fixed or random design, one observes whether that point belongs to the unknown segment or not, up to some additional…

Properties of several sorts of lattices of convex subsets of R^n are examined. The lattice of convex sets containing the origin turns out, for n>1, to satisfy a set of identities strictly between those of the lattice of all convex subsets…

It is proved that vertical graphs and radial graphs are strongly stable for a certain type of densities in Euclidean space ${\mathbb R}^{n+1}$. Particular cases of these densities include translators, expanders and singular minimal…

We introduce and investigate a new notion of resilience in graph spanners. Let $S$ be a spanner of a graph $G$. Roughly speaking, we say that a spanner $S$ is resilient if all its point-to-point distances are resilient to edge failures.…

This paper treats the variation of sets. We attempt to formulate convergence and continuity of set-valued functions in a different way from the theories on sequences of sets and correspondence. In the final section, we also attempt to…

One considers geometry with the intransitive equaivalence relation. Such a geometry is a physical geometry, i.e. it is described completely by the world function, which is a half of the squared distance function. The physical geometry…

In this work, we prove that if a uniformly separated sequence in $\mathbb{R}^d$ is uniformly quasicrystalline and converges rapidly enough to a discrete set $X$ in $\mathbb{R}^d$ having the same separation radius as the sequence, then $X$…

We consider the set of pairs of orthogonal vectors in Hilbert space, which is also called the cross because it is the union of the horizontal and vertical axes in the Euclidean plane when the underlying space is the real line. Crosses,…

Let L be a compact convex set in R^n, and let 1 <= d <= n-1. The set L is defined to be d-decomposable if L is a direct Minkowski sum (affine Cartesian product) of two or more convex bodies each of dimension at most d. A compact convex set…

For a Euclidean building $X$ of type $A_{2}$, we classify the 0-dimensional subbuildings $A$ of $\partial_{T}X$ that occur as the asymptotic boundary of closed convex subsets. In particular, we show that triviality of the holonomy of a…

The present article introduces a reference framework for discussing resilience of computational systems. Rather than a property that may or may not be exhibited by a system, resilience is interpreted here as the emerging result of a dynamic…

A finite subset $X$ of the Euclidean space is called an $m$-distance set if the number of distances between two distinct points in $X$ is equal to $m$. An $m$-distance set $X$ is said to be maximal if any vector cannot be added to $X$ while…

We show that if the rotation set of a homeomorphism of the torus is stable under small perturbations of the dynamics, then it is a convex polygon with rational vertices. We also show that such homeomorphisms are $C^0$-generic and have…

A spherical set is called convex if for every pair of its points there is at least one minimal geodesic segment that joins these points and lies in the set. We prove that for n >= 3 a complete locally-convex (topological) immersion of a…

This article contains a self-contained proof of the stability under convolution of the space of resurgent functions associated with a closed discrete subset of the complex plane (the set of possible singularities), under the assumption that…

A subset of Euclidean space will be said to be $n$-smooth if it has an $n$-dimensional tangent plane at each of its points. Let ${\frak d}_n$ denote the least number $n$-smooth sets into which $n+1$-dimensional Euclidean space can be…