Related papers: Small Strong Epsilon Nets

We define the infinite dimensional simplex to be the closure of the convex hull of the standard basis vectors in R^infinity, and prove that this space has the 'fixed point property': any continuous function from the space into itself has a…

A family of random matrices is said to converge strongly to a limiting family of operators if the operator norm of every noncommutative polynomial of the matrices converges to that of the limiting operators. Recent developments surrounding…

Similarly to the classic notion in $E^d$, a subset of a positive diameter below $\frac{\pi}{2}$ of a hemisphere of the sphere $S^d$ is called complete, provided adding any extra point increases its diameter. Complete sets are convex bodies…

In 2008, Bukh, Matousek, and Nivasch conjectured that for every n-point set S in R^d and every k, 0 <= k <= d-1, there exists a k-flat f in R^d (a "centerflat") that lies at "depth" (k+1) n / (k+d+1) - O(1) in S, in the sense that every…

Steinitz's theorem states that if a point $a \in \mathrm{int\,conv\,} X$ for a set $X \subset \mathbb{R}^d$, then $X$ contains a subset $Y$ of size at most $2d$ such that $a \in \mathrm{int\,conv\,}Y$. The bound $2d$ is best possible here.…

A strong submeasure on a compact metric space X is a sub-linear and bounded operator on the space of continuous functions on X. A strong submeasure is positive if it is non-decreasing. By Hahn-Banach theorem, a positive strong submeasure is…

According to a well known theorem of Haussler and Welzl (1987), any range space of bounded VC-dimension admits an $\eps$-net of size $O\left(\frac{1}{\eps}\log\frac1{\eps}\right)$. Using probabilistic techniques, Pach and Woeginger (1990)…

For a set $S$ of vertices and the vertex $v$ in a connected graph $G$, $\displaystyle\max_{x \in S}d(x,v)$ is called the $S$-eccentricity of $v$ in $G$. The set of vertices with minimum $S$-eccentricity is called the $S$-center of $G$. Any…

Let P be a polygon with rational vertices in the plane. We show that for any finite odd-sized collection of translates of P, the area of the set of points lying in an odd number of these translates is bounded away from 0 by a constant…

Let $P$ be a finite set of points in the plane in general position, that is, no three points of $P$ are on a common line. We say that a set $H$ of five points from $P$ is a $5$-hole in $P$ if $H$ is the vertex set of a convex $5$-gon…

Let $F$ be an $n$-point set in $\mathbb{K}^d$ with $\mathbb{K}\in\{\mathbb{R},\mathbb{Z}\}$ and $d\geq 2$. A (discrete) X-ray of $F$ in direction $s$ gives the number of points of $F$ on each line parallel to $s$. We define…

The Axion Weak Gravity Conjecture provides one of the most effective quantum gravity tools for constraining particle physics and cosmology, but it has long been thought of as a slightly fuzzy statement: given an axion with decay constant…

Let $\mathcal{S}$ be a set of $n$ points in real four-dimensional space, no four coplanar and spanning the whole space. We prove that if the number of solids incident with exactly four points of $\mathcal{S}$ is less than $Kn^3$ for some…

Let $E\subset \mathbb R^n$, $n\ge 2$, be a set of finite perimeter with $|E|=|B|$, where $B$ denotes the unit ball. When $n=2$, since convexification decreases perimeter (in the class of open connected sets), it is easy to prove the…

$\newcommand{\eps}{\varepsilon}\newcommand{\tldO}{\widetilde{O}}$Consider the problem of constructing weak $\eps$-nets where the stabbing elements are lines or $k$-flats instead of points. We study this problem in the simplest setting where…

Let $C$ be a convex subset of a locally convex space. We provide optimal approximate fixed point results for sequentially continuous maps $f\colon C\to\bar{C}$. First we prove that if $f(C)$ is totally bounded, then it has an approximate…

A strong triangle blocking arrangement is a geometric arrangement of some line segments in a triangle with certain intersection properties. It turns out that they are closely related to blocking sets. Our aim in this paper is to prove a…

The present work concerns generalized convex sets in the real multi-dimensional Euclidean space, known as weakly $1$-convex and weakly $1$-semiconvex sets. An open set is called weakly $1$-convex (weakly $1$-semiconvex) if, through every…

A strong mode of a probability measure on a normed space $X$ can be defined as a point $u$ such that the mass of the ball centred at $u$ uniformly dominates the mass of all other balls in the small-radius limit. Helin and Burger weakened…

Let $S\subset \mathbb{R}^d$ $(d\geq 2)$. A set $S$ is said to be $m$-point convex, if for every $m$ distinct points in $S$, at least one of the line-segments determined by them lies in $S$. We also say that $S$ has property $P_m$. Let…