相关论文: Almost covers of finite sets of points
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…
In this paper, we consider the following problem: what is the minimum number of affine hyperplanes in $\mathbb{R}^n$, such that all the vertices of $\{0, 1\}^n \setminus \{\vec{0}\}$ are covered at least $k$ times, and $\vec{0}$ is…
We prove that if $G$ is an abelian group and $H_1x_1,\dots,H_{k}x_k$ is an irredundant (minimal) cover of $G$ with cosets, then $$|G:\bigcap_{i=1}^{k}H_{i}|=2^{O(k)}.$$ This bound is the best possible up to the constant hidden in the…
We prove a new lower bound for the almost 20 year old problem of determining the smallest possible size of an essential cover of the $n$-dimensional hypercube $\{\pm 1\}^n$, i.e. the smallest possible size of a collection of hyperplanes…
A quasiplane $f(V)$ is the image of an $n$-dimensional Euclidean subspace $V$ of ${\Bbb R}^N$ ($1\leq n\leq N-1$) under a quasiconformal map $f:{\Bbb R}^N\to{\Bbb R}^N$ . We give sufficient conditions in terms of the weak quasisymmetry…
Finite covers are a technique for building new structures from simpler ones. The original motivation to study finite covers is in the Ladder theorem of Zilber which describes how totally categorical structures are built from strictly…
An almost $k$-cover of the hypercube $Q^n = \{0,1\}^n$ is a collection of hyperplanes that avoids the origin and covers every other vertex at least $k$ times. When $k$ is large with respect to the dimension $n$, Clifton and Huang…
We study hyperplane covering problems for finite grid-like structures in $\mathbb{R}^d$. We call a set $\mathcal{C}$ of points in $\mathbb{R}^2$ a conical grid if the line $y = a_i$ intersects $\mathcal{C}$ in exactly $i$ points, for some…
Alon and F\"uredi (European J. Combin. 1993) gave a tight bound for the following hyperplane covering problem: find the minimum number of hyperplanes required to cover all points of the n-dimensional hypercube {0,1}^n except the origin.…
We prove various results on the size and structure of subsets of vector spaces over finite fields which, in some sense, have too many mutually orthogonal pairs of vectors. In particular, we obtain sharp finite field variants of a theorem of…
We study covers of the multiplicative group of an algebraically closed field as quasiminimal pregeometry structures and prove that they satisfy the axioms for Zariski-like structures presented in \cite{lisuriart}, section 4. These axioms…
We show that the minimal number of skewed hyperplanes that cover the hypercube $\{0,1\}^{n}$ is at least $\frac{n}{2}+1$, and there are infinitely many $n$'s when the hypercube can be covered with $n-\log_{2}(n)+1$ skewed hyperplanes. The…
An essential cover of the vertices of the $n$-cube $\{0,1\}^n$ by hyperplanes is a minimal covering where no hyperplane is redundant and every variable appears in the equation of at least one hyperplane. Linial and Radhakrishnan gave a…
Alon and F\"{u}redi (1993) showed that the number of hyperplanes required to cover $\{0,1\}^n\setminus \{0\}$ without covering $0$ is $n$. We initiate the study of such exact hyperplane covers of the hypercube for other subsets of the…
A celebrated result of Alon and F\"{u}redi gives a tight lower bound on the number of hyperplanes required to cover all points of the Boolean cube $B^n$ except the origin $\bm{0}$. Recent breakthroughs by Sauermann and Wigderson generalized…
We give a direct proof of a result due to Karasev (2008), Karasev-Matschke (2014) and Schnider-Sober\'on (2023). Given $m+1$ Borel probability measures on the space of affine hyperplanes in a real vector space $V$ of dimension $m+1$, there…
Let $X$ be a normal proper variety over a perfect field $k$. We describe abelian coverings of X in terms of the functor $\underline{\rm HDiv}_X$ of principal relative Cartier divisors on $X$. If the base field $k$ is finite, the geometric…
We prove that finite perimeter subsets of $\mathbb{R}^{n+1}$ with small isoperimetric deficit have boundary Hausdorff-close to a sphere up to a subset of small measure. We also refine this closeness under some additional a priori integral…
For a smooth quasi-affine variety $X$, the affine closure $\overline{T^*X} := \text{Spec}(\mathbb{K}[T^*X])$ contains $T^*X$ as an open subset, and its smooth locus carries a symplectic structure. A natural question is whether…
Suppose that each proper subset of a set $S$ of points in a vector space is contained in the union of planes of specified dimensions, but $S$ itself is not contained in any such union. How large can $|S|$ be? We prove a general upper bound…