Related papers: Sets resilient to erosion
Resilience is a concept of rising interest in computer science and software engineering. For systems in which correctness w.r.t. a safety condition is unachievable, fast recovery is demanded. We investigate resilience problems of graph…
Extending results of Suss and Hadwiger (proved by them for the case of convex bodies and positive ratios), we show that compact (respectively, closed) convex sets in the Euclidean space of dimension n are homothetic provided for any given…
A convex subset X of a linear topological space is called compactly convex if there is a continuous compact-valued map $\Phi:X\to exp(X)$ such that $[x,y]\subset\Phi(x)\cup \Phi(y)$ for all $x,y\in X$. We prove that each convex subset of…
The field of numerical algebraic geometry consists of algorithms for numerically solving systems of polynomial equations. When the system is exact, such as having rational coefficients, the solution set is well-defined. However, for a…
A closed convex subset of a normed linear space is said to have the strong separation property if it can be strongly separated from every other disjoint closed and convex set by a closed hyperplane. In this paper we give some results on the…
Let $\Pi$ be a convex decomposition of a set $P$ of $n\geq 3$ points in general position in the plane. If $\Pi$ consists of more than one polygon, then either $\Pi$ contains a deletable edge or $\Pi$ contains a contractible edge.
It is widely believed that point sets in the plane which determine few distinct distances must have some special structure. In particular, such sets are believed to be similar to a lattice. This note considers two different ways to quantify…
The surface reconstruction problem from sets of planar parallel slices representing cross sections through 3D objects is presented. The final result of surface reconstruction is always based on the correct estimation of the structure of the…
A closure system with the anti-exchange axiom is called a convex geometry. One geometry is called a sub-geometry of the other if its closed sets form a sublattice in the lattice of closed sets of the other. We prove that convex geometries…
A common representation of a three dimensional object in computer applications, such as graphics and design, is in the form of a triangular mesh. In many instances, individual or groups of triangles in such representation need to satisfy…
The geometry of closed surfaces equipped with a Euclidean metric with finitely many conical points of arbitrary angle is studied. The main result is that the image of a non-closed geodesic has 0 distance from the set of conical points.…
On a flat plane, convexity of a set is preserved by both radial expansion and contraction of the set about any point inside it. Using the Poincar\'e disk model of hyperbolic geometry, we prove that radial expansion of a hyperbolic convex…
Resilience is an ability of a system with which the system can adjust its activity to maintain its functionality when it is perturbed. To study resilience of dynamics on networks, Gao et al. proposed a theoretical framework to reduce…
We consider the class of weakly porous sets in Euclidean spaces. As our main goal, we give a precise characterization in terms of dyadic covering of these sets. Also, we obtain the Carleson embedding inequality for porous sets.
We construct convex bodies that can be "captured by nets." More precisely, for each dimension $n \geq 2$, we construct a family of Riemannian $n$-spheres, each with a stable geodesic net, which is a stable 1-dimensional integral varifold.…
We prove that if two finitely generated groups act on a metrically complete 2-dimensional Euclidean building, then the distance between their fixed-point sets is realised. Our proof uses the geometry of Euclidean buildings, which we view as…
A relational structure $\mathbb{X}$ is called reversible iff each bijective homomorphism from $\mathbb{X}$ onto $\mathbb{X}$ is an isomorphism, and linear orders are prototypical examples of such structures. One way to detect new reversible…
One of the most well known random fractals is the so-called Fractal percolation set. This is defined as follows: we divide the unique cube in $\mathbb{R}^d$ into $M^d$ congruent sub-cubes. For each of these cubes a certain retention…
This paper establishes connections between three of the most prominent metrics used in the analysis of persistence diagrams in topological data analysis: the bottleneck distance, Patel's erosion distance, and Bubenik's landscape distance.…
Using a recent description of the geometric stability manifold, we show the geometric stability manifold associated to any smooth projective complex surface is contractible. We then use this result to demonstrate infinitely many new…