Related papers: On a topological version of Pach's overlap theorem

In 1974, Witsenhausen asked for the maximum possible density $\alpha_n$ of a measurable subset $A$ of the unit sphere $\mathbb{S}^{n-1}\subset \mathbb{R}^n$ such that $A$ contains no pair of orthogonal vectors. For $n=3$, the best known…

Building on results of Arthur and Mok, we extend to (finite volume) complex and quaternionic hyperbolic manifolds the results of arXiv:1004.1085. For the spherical spectrum our results are optimal. Finally, as an application we prove a…

We prove that if a complete connected $n$-dimensional Riemannian manifold $M$ has radial sectional curvature at a base point $p\in M$ bounded from below by the radial curvature function of a two-sphere of revolution $\widetilde M$ belonging…

Let $A \subset \mathbb{Z}^d$ be a finite set. It is known that $NA$ has a particular size ($\vert NA\vert = P_A(N)$ for some $P_A(X) \in \mathbb{Q}[X]$) and structure (all of the lattice points in a cone other than certain exceptional…

Let $P$ be a set of $n$ points in real projective $d$-space, not all contained in a hyperplane, such that any $d$ points span a hyperplane. An ordinary hyperplane of $P$ is a hyperplane containing exactly $d$ points of $P$. We show that if…

There exist myriads of off-shell worldline supermultiplets for (N{\leq}32)-extended supersymmetry in which every supercharge maps a component field to precisely one other component field or its derivative. A subset of these extends to…

An $\epsilon$-net theorem for a hypergraph upper bounds the minimum size of a vertex set that pierces all $\epsilon$-heavy hyperedges. A $(p,2)$-theorem bounds from above the minimum size of a vertex set that pierces all hyperedges, in…

Let $r_k(N)$ denote the size of the largest subset of $[N] = \{1,\ldots,N\}$ with no $k$-term arithmetic progression. We show that for $k\ge 5$, there exists $c_k>0$ such that \[r_k(N)\ll N\exp(-(\log\log N)^{c_k}).\] Our proof is a…

The set of matrix tuples with invariant subspaces whose dimensions sum up to the dimension of the space, but which do not span the whole space form an algebraic hypersurface. We found the equation of this hypersurface. This generalizes…

Let D_1 be a subdomain of D_2 in the complex plane CC. Under very mild conditions on D_2 we show that there exist holomorphic functions f, defined on D_1 with the property that $f$ is nowhere extendible across the boundary of D_1, while the…

We generalize the classic definition of Delaunay triangulation and prove that for a locally finite and coarsely dense generic point set, $A \subseteq \mathbb{R}^d$, the $d$-simplices whose vertices belong to $A$ and whose circumscribed…

Park and Pham's recent proof of the Kahn-Kalai conjecture was a major breakthrough in the field of graph and hypergraph thresholds. Their result gives an upper bound on the threshold at which a probabilistic construction has a $1-\epsilon$…

Finite unions of convex sets are a central object of study in discrete and computational geometry. In this paper we initiate a systematic study of complements of such unions -- i.e., sets of the form $S=\mathbb{R}^d \setminus (\cup_{i=1}^n…

The main aim of this paper is to show that a cyclic cover of $\mathbb{P}^n$ branched along a very general divisor of degree $d$ is not stably rational provided that $n \ge 3$ and $d \ge n+1$. This generalizes the result of…

We characterize the largest point sets in the plane which define at most 1, 2, and 3 angles. For $P(k)$ the largest size of a point set admitting at most $k$ angles, we prove $P(2)=5$ and $P(3)=5$. We also provide the general bounds of $k+2…

Let $X^n$ be a hypersurface in $\mathbb{P}^{n+1}$ with $n\geq 1$ defined over a finite field $\mathbb{F}_q$ of $q$ elements. In this note, we classify, up to projective equivalence, hypersurfaces $X^n$ as above which reach two elementary…

In this paper we prove an infinite-dimensional version of Sard's theorem for Fr\'{e}chet manifolds. Let $ M $ and $ N $ be bounded Fr\'{e}chet manifolds such that the topologies of their model Fr\'{e}chet spaces are defined by metrics with…

We study the smallest possible number of points in a topological space having k open sets. Equivalently, this is the smallest possible number of elements in a poset having k order ideals. Using efficient algorithms for constructing a…

The famous Erd\H{o}s-Gallai Theorem on the Tur\'an number of paths states that every graph with $n$ vertices and $m$ edges contains a path with at least $\frac{2m}{n}$ edges. In this note, we first establish a simple but novel extension of…

Given two convex polygons $P$ and $Q$ with $n$ and $m$ edges, the maximum overlap problem is to find a translation of $P$ that maximizes the area of its intersection with $Q$. We give the first randomized algorithm for this problem with…