Related papers: Quantitative visibility estimates for unrectifiabl…

We consider the problem of reconstruction of planar domains from their moments. Specifically, we consider domains with boundary which can be represented by a union of a finite number of pieces whose graphs are solutions of a linear…

Given a finite set of points $S\subset\mathbb{R}^d$, a $k$-set of $S$ is a subset $A \subset S$ of size $k$ which can be strictly separated from $S \setminus A $ by a hyperplane. Similarly, a $k$-facet of a point set $S$ in general position…

The main result of this paper is that for any $1/2 \leq s < 2 - \sqrt{2} \approx 0.5858$, there is a number $\sigma = \sigma(s) < s$ with the following property. Let $\delta > 0$ be small, assume that $A \subset [0,1]$ is a…

We characterize uniform $k$-rectifiability in Euclidean spaces in terms of a Carleson-type geometric lemma for a new notion of flatness coefficients, which we call $\iota$-numbers. The characterization follows from an abstract statement…

For a set $S$ of $n$ disjoint line segments in $\mathbb{R}^{2}$, the visibility counting problem is to preprocess $S$ such that the number of visible segments in $S$ from any query point $p$ can be computed quickly. There have been…

The Reifenberg theorem \cite{reif_orig} tells us that if a set $S\subseteq B_2\subseteq \mathbb R^n$ is uniformly close on all points and scales to a $k$-dimensional subspace, then $S$ is H\"older homeomorphic to a $k$-dimensional Euclidean…

We establish some relations between the perimeter, the area and the visual angle of a planar compact convex set. Our first result states that Crofton's formula is the unique universal formula relating the visual angle, length and area.…

A set in the Euclidean plane is said to be biconvex if, for some angle $\theta\in[0,\pi/2)$, all its sections along straight lines with inclination angles $\theta$ and $\theta+\pi/2$ are convex sets (i.e, empty sets or segments).…

A visibility representation is a classical drawing style of planar graphs. It displays the vertices of a graph as horizontal vertex-segments, and each edge is represented by a vertical edge-segment touching the segments of its end vertices;…

We present a model of set theory, in which, for a given $n\ge2$, there exists a non-ROD-uniformizable planar lightface $\varPi^1_n$ set in $\mathbb R\times\mathbb R$, whose all vertical cross-sections are countable sets (and in fact Vitali…

A pair of probability distributions over $\{0,1\}^n$ is said to be $(k,\delta)$-wise indistinguishable if all of the size $k$ marginals are within statistical distance at most $\delta$. Previous works introduced this concept and study when…

The equidistant set of two nonempty subsets $K$ and $L$ in the Euclidean plane is a set all of whose points have the same distance from $K$ and $L$. Since the classical conics can be also given in this way, equidistant sets can be…

Here we analyze three dimensional analogues of the classical Crofton's formula for planar compact convex sets. In this formula a fundamental role is played by the visual angle of the convex set from an exterior point. A generalization of…

A spiral in $\mathbb{R}^{d+1}$ is defined as a set of the form $\left\{\sqrt[d+1]{n}\cdot\boldsymbol{u}_n\right\}_{n\ge 1},$ where $\left(\boldsymbol{u}_n\right)_{n\ge 1}$ is a spherical sequence. Such point sets have been extensively…

We define the quantile set of order $\alpha \in \left[ 1/2,1\right) $ associated to a law $P$ on $\mathbb{R}^{d}$ to be the collection of its directional quantiles seen from an observer $O\in \mathbb{R}^{d}$. Under minimal assumptions these…

Two lattice points are visible from one another if there is no lattice point on the open line segment joining them. Let $S$ be a finite subset of $\mathbb{Z}^k$. The asymptotic density of the set of lattice points, visible from all points…

It is a well-known result that the proportion of lattice points visible from the origin is given by $\frac{1}{\zeta(2)}$, where $\zeta(s)=\sum_{n=1}^\infty\frac{1}{n^s}$ denotes the Riemann zeta function. Goins, Harris, Kubik and Mbirika,…

The main goal of the paper is to provide a quantitative lower bound greater than $1$ for the relative projection constant $\lambda(Y, X)$, where $X$ is a subspace of $\ell_{2p}^m$ space and $Y \subset X$ is an arbitrary hyperplane. As a…

This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the…

A planar point set of $n$ points is called {\em $\gamma$-dense} if the ratio of the largest and smallest distances among the points is at most $\gamma\sqrt{n}$. We construct a dense set of $n$ points in the plane with…