Related papers: Covering Hypercube $mB^n$

We try to find all quadruples of positive integers $(m,a,b,c)$ with $a \geq b \geq c$ such that there exists a distinct covering system with minimum modulus $m$ and least common multiple of the moduli $2^a 3^b 5^c$. We obtain complete…

Let $M$ and $N$ be two closed hyperbolic Riemann surfaces. The Ehrenpreis Conjecture (proved by Kahn-Markovic) asserts that for any $\epsilon>0$ there are finite covers $M_\epsilon \to M$, and $N_\epsilon \to N$, such that the Teichmuller…

We develop a new simple approach to prove upper bounds for generalizations of the Heilbronn's triangle problem in higher dimensions. Among other things, we show the following: for fixed $d \ge 1$, any subset of $[0, 1]^d$ of size $n$…

In this paper we prove that, given an open Riemann surface $M$ and an integer $n\ge 3$, the set of complete conformal minimal immersions $M\to\mathbb{R}^n$ with $\overline{X(M)}=\mathbb{R}^n$ forms a dense subset in the space of all…

We show that if $M^n$ is a properly immersed, two-sided, stable minimal hypersurface in $B^{n+1}_1(0)\setminus S$, where $S$ is closed with $\mathcal{H}^{n-2}(S)=0$, then $\text{dim}_{\mathcal{H}}\text{sing}(M)\leq n-7$, namely…

We prove that every set of $n$ red and $n$ blue points in the plane contains a red and a blue point such that every circle through them encloses at least $n(1-\frac{1}{\sqrt{2}}) -o(n)$ points of the set. This is a two-colored version of a…

For a set of permutations (patterns) $\Pi$ in $S_k$, consider the set of all permutations in $S_n$ that avoid all patterns in $\Pi$. An important problem in current algebraic combinatorics is to find pattern sets $\Pi$ such that the…

For any affine hypersurface defined by a complete symmetric polynomial in $k\geq 3$ variables of degree $m$ over the finite field $\mathbb{F}_{q}$ of $q$ elements, a special case of our theorem says that this hypersurface has at least…

Determining the minimum density of a covering of $\mathbb{R}^{n}$ by Euclidean unit balls as $n\to\infty$ is a major open problem, with the best known results being the lower bound of $\left(\mathrm{e}^{-3/2}+o(1)\right)n$ by Coxeter, Few…

In this paper, we show that a set of q+a hyperplanes, q>13, a<(q-10)/4, that does not cover PG(n,q), does not cover at least q^(n-1)-aq^(n-2) points, and show that this lower bound is sharp. If the number of non- covered points is at most…

A classical open problem in combinatorial geometry is to obtain tight asymptotic bounds on the maximum number of k-level vertices in an arrangement of n hyperplanes in d dimensions (vertices with exactly k of the hyperplanes passing below…

The classical Bertini theorem on generic intersection of an algebraic set with hyperplanes states the following: \emph{Let X be a nonsingular closed subvariety of $\mathbb{P}^n_k$, where $k$ is an algebraically closed field. Then there…

We prove that for any fixed integer \( n \geq 3 \) and nonzero integer \( m \), the proportion of integral binary forms of degree \( n \) that represent \( m \) tends to zero as the height tends to infinity. In fact, almost all such forms…

We say that a finite set of red and blue points in the plane in general position can be $K_{1,3}$-covered if the set can be partitioned into subsets of size $4$, with $3$ points of one color and $1$ point of the other color, in such a way…

We provide the final step in the resolution of Bourgain's slicing problem in the affirmative. Thus we establish the following theorem: for any convex body $K \subseteq \mathbb{R}^n$ of volume one, there exists a hyperplane $H \subseteq…

In this paper, we study complete $\delta$-stable minimal hypersurfaces in $\mathbf R^{n+1}$. We prove that complete two-sided $\delta$-stable minimal hypersurfaces have Euclidean volume growth if $3\leq n\leq 5$ and $\delta>\delta_0(n)$,…

We prove that a minimal $t$-fold blocking set in a finite projective plane of order $n$ has cardinality at most \[\frac{1}{2} n\sqrt{4tn - (3t + 1)(t - 1)} + \frac{1}{2} (t - 1)n + t.\] This is the first general upper bound on the size of…

In this paper we establish an improved bound for the number of incidences between a set $P$ of $m$ points and a set $H$ of $n$ planes in $\mathbb R^3$, provided that the points lie on a two-dimensional nonlinear irreducible algebraic…

For a $d$-dimensional polytope with $v$ vertices, $d+1\le v\le2d$, we calculate precisely the minimum possible number of $m$-dimensional faces, when $m=1$ or $m\ge0.62d$. This confirms a conjecture of Gr\"unbaum, for these values of $m$.…

The minimum number of bicliques needed to cover the edge set of the complete graph on $n$ vertices is $\lceil \log_2 n \rceil$. The Graham-Pollak theorem states that at least $n-1$ bicliques are required to partition the edge set of the…