Related papers: Covering Hypercube $mB^n$

We prove a new, tight upper bound on the number of incidences between points and hyperplanes in Euclidean d-space. Given n points, of which k are colored red, there are O_d(m^{2/3}k^{2/3}n^{(d-2)/3} + kn^{d-2} + m) incidences between the k…

Let $\mbox{$\cal V$} \subseteq {\mathbb F}^n$ be a finite set of points in an affine space. A finite set of affine hyperplanes $\{H_1, \ldots ,H_m\}$ is said to be an almost cover of $\mbox{$\cal V$}$ and $\mathbf{v}$, if their union…

While equivariant methods have seen many fruitful applications in geometric combinatorics, their inability to answer the now settled Topological Tverberg Conjecture has made apparent the need to move beyond the use of Borsuk--Ulam type…

We prove that at least $\Omega(n^{0.51})$ hyperplanes are needed to slice all edges of the $n$-dimensional hypercube. We provide a couple of applications: lower bounds on the computational complexity of parity, and a lower bound on the…

An almost cover of a finite set in the affine space is a collection of hyperplanes that together cover all points of the set except one. Using the polynomial method, we determine the minimum size of an almost cover of the vertex set of the…

We show that among any $n$ points in the unit cube one can find a triangle of area at most $n^{-2/3-c}$ for some absolute constant $c >0$. This gives the first non-trivial upper bound for the three-dimensional version of Heilbronn's…

The $k$-coverage problem is to find the minimum number of disks such that each point in a given plane is covered by at least $k$ disks. Under unit disk condition, when $k$=1, this problem has been solved by Kershner in 1939. However, when…

First we consider families in the hypercube $Q_n$ with bounded VC dimension. Frankl raised the problem of estimating the number $m(n,k)$ of maximal families of VC dimension $k$. Alon, Moran and Yehudayoff showed that…

In the Line Cover problem a set of n points is given and the task is to cover the points using either the minimum number of lines or at most k lines. In Curve Cover, a generalization of Line Cover, the task is to cover the points using…

Let f:{-1,1}^n -> R be a real function on the hypercube, given by its discrete Fourier expansion, or, equivalently, represented as a multilinear polynomial. We say that it is Boolean if its image is in {-1,1}. We show that every function on…

Consider the $n$-cube graph with vertices $\{-1,1\}^n$ and edges connecting vertices with hamming distance $1$. How many hyperplanes in $\mathbb{R}^n$ are needed in order to dissect all edges? We show that at least…

Let $M$ be an $n$-dimensional smooth oriented complete embedded minimal hypersurface in $\mathbb{R}^{n+1}$ with Euclidean volume growth. We show that if the image under the Gauss map of $M$ avoids some neighborhood of a half-equator, then…

We note that the recent polynomial proofs of the spherical and complex plank covering problems by Zhao and Ortega-Moreno give some general information on zeros of real and complex polynomials restricted to the unit sphere. As a corollary of…

We provide a monotone non increasing sequence of upper bounds $f^H_k$ ($k\ge 1$) converging to the global minimum of a polynomial $f$ on simple sets like the unit hypercube. The novelty with respect to the converging sequence of upper…

In this paper we discuss a result similar to the polynomial version of the Alon-F\"uredi theorem. We prove that if you want to cover the vertices of the $n$-dimensional unit cube, except those of weight at most $r$ then you need an…

We prove an effective version of a theorem of Dufresnoy: For any set of 2n+1 hyperplanes in general position in n-dimensional complex projective space, we find an explicit constant K such that for every holomorphic map f from the unit disc…

We explicitly characterize when the Milnor number at the origin of a polynomial or power series (over an algebraically closed field k of arbitrary characteristic) is the minimum of all polynomials with the same Newton diagram, which…

We establish an improved upper bound for the number of incidences between m points and n circles in three dimensions. The previous best known bound, originally established for the planar case and later extended to any dimension $\ge 2$, is…

In this short note we study two questions about the existence of subgraphs of the hypercube $Q_n$ with certain properties. The first question, due to Erd\H{o}s--Hamburger--Pippert--Weakley, asks whether there exists a bounded degree…

We present a new lower bound on the Bowen-Radin maximal density of radius-R ball packings in the m-dimensional hyperbolic space, improving on the basic covering bound by factor \Omega(m(R+\ln m)) as m tends to infinity. This is done by…