Related papers: Proof of a conjecture of B\'ar\'any, Katchalski an…

A set in $\mathbb R^d$ is called almost-equidistant if for any three distinct points in the set, some two are at unit distance apart. First, we give a short proof of the result of Bezdek and L\'angi claiming that an almost-equidistant set…

The Harary-Hill Conjecture states that for $n\geq 3$ every drawing of $K_n$ has at least \begin{align*} H(n) :=…

Let $A$ be an abelian variety over ${\bf C}_p$ ($p$ a prime number) and $V\hookrightarrow A$ a closed subvariety. The conjecture of Tate-Voloch predicts that the $p$-adic distance from a torsion point $T\not\in V({\bf C}_p)$ to the variety…

By theorems of Ferguson and Lacey (d=2) and Lacey and Terwilleger (d>2), Nehari's theorem is known to hold on the polydisc D^d for d>1, i.e., if H_\psi is a bounded Hankel form on H^2(D^d) with analytic symbol \psi, then there is a function…

In [5] I.P. Goulden, D.M. Jackson, and R. Vakil formulated a conjecture relating certain Hurwitz numbers (enumerating ramified coverings of the sphere) to the intersection theory on a conjectural Picard variety. We are going to use their…

We prove a Hardy inequality on convex sets, for fractional Sobolev-Slobodecki\u{\i} spaces of order $(s,p)$. The proof is based on the fact that in a convex set the distance from the boundary is a superharmonic function, in a suitable…

We establish a version of the bottleneck conjecture, which in turn implies a partial solution to the Mahler conjecture on the product $v(K) = (\Vol K)(\Vol K^\circ)$ of the volume of a symmetric convex body $K \in \R^n$ and its polar body…

In this paper we provide the complete classification of convex cocompact Kleinian group of Hausdorff dimensions less than $1.$ In particular, we prove that every convex cocompact Kleinian group of Hausdorff dimension $<1$ is a classical…

Let $X$ be a finite set of points in $\mathbb{R}^d$. The Tukey depth of a point $q$ with respect to $X$ is the minimum number $\tau_X(q)$ of points of $X$ in a halfspace containing $q$. In this paper we prove a depth version of…

This paper develops a unified framework for estimating the volume of a set in $\mathbb{R}^d$ based on observations of points uniformly distributed over the set. The framework applies to all classes of sets satisfying one simple axiom: a…

Paul Erd\H{o}s and L\'{a}szl\'{o} Lov\'{a}sz proved in a landmark article that, for any positive integer $k$, up to isomorphism there are only finitely many maximal intersecting families of $k-$sets (maximal $k-$cliques). So they posed the…

We prove a no-dimensional Helly theorem for affine spaces and convex sets using the unboundedness framework of Aronov, Goodman, and Pollack (Computational Geometry, 2002). This generalizes the fundamental result of Adiprasito, B\'ar\'any,…

The invisibility graph $I(X)$ of a set $X \subseteq \mathbb{R}^d$ is a (possibly infinite) graph whose vertices are the points of $X$ and two vertices are connected by an edge if and only if the straight-line segment connecting the two…

A $d$-simplex is defined to be a collection $A_1,\dots,A_{d+1}$ of subsets of size $k$ of $[n]$ such that the intersection of all of them is empty, but the intersection of any $d$ of them is non-empty. Furthermore, a $d$-cluster is a…

A well-known conjecture, often attributed to Ryser, states that the cover number of an $r$-partite $r$-uniform hypergraph is at most $r - 1$ times larger than its matching number. Despite considerable effort, particularly in the…

Let $A,B \subseteq \mathbb{R}^d $ both span $\mathbb{R}^d$ such that $\langle a, b \rangle \in \{0,1\}$ holds for all $a \in A$, $b \in B$. We show that $ |A| \cdot |B| \le (d+1) 2^d $. This allows us to settle a conjecture by Bohn, Faenza,…

The Kneser-Poulsen conjecture says that if a finite collection of balls in a d-dimensional Euclidean space is rearranged so that the distance between each pair of centers does not get smaller, then the volume of the union of these balls…

In this work, the classical Borsuk conjecture is discussed, which states that any set of diameter 1 in the Euclidean space $ {\mathbb R}^d $ can be divided into $ d+1 $ parts of smaller diameter. During the last two decades, many…

Generalizing the famous Bernstein-Kushnirenko Theorem, Khovanskii proved in 1978 a combinatorial formula for the arithmetic genus of the compactification of a generic complete intersection associated to a family of lattice polytopes.…

We consider the set of points chosen randomly, independently and uniformly in the $d$-dimensional spherical layer. A set of points is called $1$-convex if all its points are vertices of the convex hull of this set. In \cite{3} an estimate…