Related papers: Exact hyperplane covers for subsets of the hypercu…
We investigate how many hyperplanes with independent standard Gaussian directions one needs to produce a $\delta$-uniform tessellation of a subset $S$ of the Euclidean sphere, meaning that for any pair of points in $S$ the fraction of…
We prove that in any strictly convex symmetric cone $\Omega$ there exists a non empty locus where the WDVV equation is satisfied (i.e. there exists a hyperplane being a Frobenius manifold). This result holds over any real division algebra…
We introduce a family of nonnegative integer vectors - primitive vectors - defining hyperplanes of the real affine cube over $C^n:=\{-1,1\}^n$ and study their properties with respect to the rectangles of the cube. As a consequence we give a…
Consider the hyperplanes at a fixed distance $t$ from the center of the hypercube $[0,1]^d$. Significant attention has been given to determining the hyperplanes $H$ among these such that the $(d-1)$-dimensional volume of $H\cap[0,1]^d$ is…
A facet of an hyperplane arrangement is called external if it belongs to exactly one bounded cell. The set of all external facets forms the envelope of the arrangement. The number of external facets of a simple arrangement defined by $n$…
We find tight estimates for the minimum number of proper subspaces needed to cover all lattice points in an n-dimensional convex body symmetric about the origin. We also find the order of magnitude of the number of (n-1)-dimensional…
Given a universe $\mathcal{U}=R \cup B$ of a finite set of red elements $R$, and a finite set of blue elements $B$ and a family $\mathcal{F}$ of subsets of $\mathcal{U}$, the \RBSC problem is to find a subset $\mathcal{F}'$ of $\mathcal{F}$…
We consider the problem of identifying n points in the plane using disks, i.e., minimizing the number of disks so that each point is contained in a disk and no two points are in exactly the same set of disks. This problem can be seen as an…
Given positive integers $k\leq d$ and a finite field $\mathbb{F}$, a set $S\subset\mathbb{F}^{d}$ is $(k,c)$-subspace evasive if every $k$-dimensional affine subspace contains at most $c$ elements of $S$. By a simple averaging argument, the…
Erd\H{o}s and Fishburn studied the maximum number of points in the plane that span $k$ distances and classified these configurations, as an inverse problem of the Erd\H{o}s distinct distances problem. We consider the analogous problem for…
Given a sphere of any radius $r$ in an $n$-dimensional Euclidean space, we study the coverings of this sphere with solid spheres of radius one. Our goal is to design a covering of the lowest covering density, which defines the average…
We study problems on covering $[0,1)$ by shrinking intervals centered at the points $\{q_n x\}$, where $(q_n)_{n\in \mathbb{N}}$ is a given real-valued sequence and $x \in [0,1)$ is random. For real-valued lacunary sequences…
Characterizations are given for 1-complemented hyperplanes of strictly monotone real Lorentz spaces and 1-complemented finite codimensional subspaces (which contain at least one basis element) of real Orlicz spaces equipped with either…
Let $S$ be a set of $n$ points in $\mathbb{R}^3$, no three collinear and not all coplanar. If at most $n-k$ are coplanar and $n$ is sufficiently large, the total number of planes determined is at least $1 + k…
We provide the currently fastest randomized (1+epsilon)-approximation algorithm for the closest vector problem in the infinity norm. The running time of our method depends on the dimension n and the approximation guarantee epsilon by 2^O(n)…
For various triple systems $F$, we give tight lower bounds on the number of copies of $F$ in a triple system with a prescribed number of vertices and edges. These are the first such results for hypergraphs, and extend earlier theorems of…
Let $S$ be a set of $n$ points in $\mathbb{R}^d$, where $d \geq 2$ is a constant, and let $H_1,H_2,\ldots,H_{m+1}$ be a sequence of vertical hyperplanes that are sorted by their first coordinates, such that exactly $n/m$ points of $S$ are…
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…
In a projective plane over a finite field, complete $(k,n)$-arcs with few characters are rare but interesting objects with several applications to finite geometry and coding theory. Since almost all known examples are large, the…
We introduce and study certain notions which might serve as substitutes for maximum density packings and minimum density coverings. A body is a compact connected set which is the closure of its interior. A packing $\cal P$ with congruent…