English
Related papers

Related papers: Covering points by hyperplanes and related problem…

200 papers

In this paper we study the number of four-rich points defined by pencils of certain algebraic objects. Our main result concerns the number of four-rich points defined by four sheaves of planes; under certain non-degeneracy conditions, we…

Combinatorics · Mathematics 2025-08-27 Michalis Kokkinos , Audie Warren

We show that a generic real projective $n$-dimensional hypersurface of odd degree $d$, such that $4(n-2)=\binom{d+3}3$, contains "many" real 3-planes, namely, in the logarithmic scale their number has the same rate of growth, $d^3\log d$,…

Algebraic Geometry · Mathematics 2015-07-30 Sergey Finashin , Viatcheslav Kharlamov

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…

Combinatorics · Mathematics 2012-01-10 Ben D. Lund , George B. Purdy , Justin W. Smith

Given a finite set of points $\Gamma$ in $\mathbb P^{k-1}$ not all contained in a hyperplane, the "fitting problem" asks what is the maximum number $hyp(\Gamma)$ of these points that can fit in some hyperplane and what is (are) the…

Commutative Algebra · Mathematics 2012-04-09 Stefan O. Tohaneanu

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…

Combinatorics · Mathematics 2025-09-08 Herbert Edelsbrunner , Alexey Garber , Morteza Saghafian

For all integers $k,d$ such that $k \geq 3$ and $k/2\leq d \leq k-1$, let $n$ be a sufficiently large integer {\rm(}which may not be divisible by $k${\rm)} and let $s\le \lfloor n/k\rfloor-1$. We show that if $H$ is a $k$-uniform hypergraph…

Combinatorics · Mathematics 2022-08-16 Yulin Chang , Huifen Ge , Jie Han , Guanghui Wang

A topological hyperplane is a subspace of R^n (or a homeomorph of it) that is topologically equivalent to an ordinary straight hyperplane. An arrangement of topological hyperplanes in R^n is a finite set H such that k topological…

Combinatorics · Mathematics 2010-01-24 David Forge , Thomas Zaslavsky

We compute some numerical invariants of the lines on hyperplane sections of a smooth cubic threefold over complex numbers. We also prove that for any smooth hypersurface $X\subset \mathbb P^{n+1}$ of degree $d$ over an algebraically closed…

Algebraic Geometry · Mathematics 2020-07-08 Yiran Cheng

Given a hypercube $\mathcal{Q}^{n} := \{0,1\}^{n}$ in $\mathbb{R}^{n}$ and $k \in \{0, \dots, n\}$, the $k$-th layer $\mathcal{Q}^{n}_{k}$ of $\mathcal{Q}^{n}$ denotes the set of all points in $\mathcal{Q}^{n}$ whose coordinates contain…

Combinatorics · Mathematics 2023-05-23 Arijit Ghosh , Chandrima Kayal , Soumi Nandi

Let $\mathcal{X}$ be a set of $(h-1)$-dimensional subspaces of $\mathrm{PG}(kh-1,q)$ with the property that every hyperplane contains at most $t$ elements of $\mathcal{X}$. We prove the upper bound $|\mathcal{X}| \leq (t-k+2)q^h + t$, and…

Combinatorics · Mathematics 2026-03-31 Tim Alderson , Simeon Ball

A double-normal pair of a finite set $S$ of points from Euclidean space is a pair of points $\{p,q\}$ from $S$ such that $S$ lies in the closed strip bounded by the hyperplanes through $p$ and $q$ that are perpendicular to $pq$. A…

Combinatorics · Mathematics 2015-09-07 János Pach , Konrad J. Swanepoel

A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices and exactly $4n-8$ edges, have been completely characterized,…

Computational Geometry · Computer Science 2017-03-21 Michael A. Bekos , Michael Kaufmann , Chrysanthi N. Raftopoulou

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…

Combinatorics · Mathematics 2025-10-06 Paata Ivanisvili , Ohad Klein , Roman Vershynin

We use methods from spectral graph theory to obtain bounds on the number of incidences between $k$-planes and $h$-planes in $\mathbb{F}_q^d$ which generalize a recent result given by Bennett, Iosevich, and Pakianathan (2014). More…

Combinatorics · Mathematics 2015-10-14 Nguyen Duy Phuong , Thang Pham , Le Anh Vinh

In 2008, Bukh, Matousek, and Nivasch conjectured that for every n-point set S in R^d and every k, 0 <= k <= d-1, there exists a k-flat f in R^d (a "centerflat") that lies at "depth" (k+1) n / (k+d+1) - O(1) in S, in the sense that every…

Computational Geometry · Computer Science 2012-05-03 Boris Bukh , Gabriel Nivasch

We prove that for every integer $k$, every finite set of points in the plane can be $k$-colored so that every half-plane that contains at least $2k-1$ points, also contains at least one point from every color class. We also show that the…

Combinatorics · Mathematics 2015-05-19 Shakhar Smorodinsky , Yelena Yuditsky

A double-normal pair of a finite set $S$ of points from $R^d$ is a pair of points $\{p,q\}$ from $S$ such that $S$ lies in the closed strip bounded by the hyperplanes through $p$ and $q$ perpendicular to $pq$. A double-normal pair $pq$ is…

Metric Geometry · Mathematics 2019-02-20 János Pach , Konrad Swanepoel

We obtain a new bound on the number of two-rich points spanned by an arrangement of low degree algebraic curves in $\mathbb{R}^4$. Specifically, we show that an arrangement of $n$ algebraic curves determines at most $C_\epsilon…

Combinatorics · Mathematics 2018-01-19 Larry Guth , Joshua Zahl

In this paper, we characterise the smallest sets $B$ consisting of points and hyperplanes in $\text{PG}(n,q)$, such that each $k$-space is incident with at least one element of $B$. If $k > \frac {n-1} 2$, then the smallest construction…

Combinatorics · Mathematics 2023-12-05 Sam Adriaensen , Maarten De Boeck , Lins Denaux

For a finite set $X$ of points in the plane, a set $S$ in the plane, and a positive integer $k$, we say that a $k$-element subset $Y$ of $X$ is captured by $S$ if there is a homothetic copy $S'$ of $S$ such that $X\cap S' = Y$, i.e., $S'$…

Combinatorics · Mathematics 2015-07-14 Maria Axenovich , Torsten Ueckerdt