English
Related papers

Related papers: An incidence theorem in higher dimensions

200 papers

In this paper we study the number of incidences between $m$ points and $n$ varieties in $\mathbb{F}^d$, where $\mathbb{F}$ is an arbitrary field, assuming the incidence graph contains no copy of $K_{s,s}$. We also consider the analogous…

Combinatorics · Mathematics 2024-03-14 Aleksa Milojević , Benny Sudakov , István Tomon

Let $P$ be a set of $m$ points and $L$ a set of $n$ lines in $\mathbb R^4$, such that the points of $P$ lie on an algebraic three-dimensional surface of degree $D$ that does not contain hyperplane or quadric components, and no 2-flat…

Combinatorics · Mathematics 2016-09-29 Micha Sharir , Noam Solomon

In this paper we introduce a unified approach to deal with incidence problems between points and varieties over finite fields. More precisely, we prove that the number of incidences $I(\mathcal{P}, \mathcal{V})$ between a set $\mathcal{P}$…

Combinatorics · Mathematics 2016-01-05 Nguyen Duy Phuong , Thang Pham , Nguyen Minh Sang , Claudiu Valculescu , Le Anh Vinh

Given a set of points $P$ and a set of regions $\mathcal{O}$, an incidence is a pair $(p,o ) \in P \times \mathcal{O}$ such that $p \in o$. We obtain a number of new results on a classical question in combinatorial geometry: What is the…

Computational Geometry · Computer Science 2023-02-27 Timothy M. Chan , Sariel Har-Peled

In this note we give a shortened proof of a theorem of Rudnev, which bounds the number of incidences between points and planes over an arbitrary field. Rudnev's proof uses a map that goes via the four-dimensional Klein quadric to a…

Combinatorics · Mathematics 2016-12-09 Frank de Zeeuw

We study incidences between points and algebraic curves in three dimensions, taken from a family $C$ of curves that have almost two degrees of freedom, meaning that every pair of curves intersect in $O(1)$ points, for any pair of points…

Computational Geometry · Computer Science 2020-06-24 Micha Sharir , Noam Solomon , Oleg Zlydenko

Recently Guth and Katz \cite{GK2} invented, as a step in their nearly complete solution of Erd\H{o}s's distinct distances problem, a new method for partitioning finite point sets in $\R^d$, based on the Stone--Tukey polynomial ham-sandwich…

Combinatorics · Mathematics 2011-03-01 Haim Kaplan , Jiří Matoušek , Micha Sharir

We prove three theorems giving extremal bounds on the incidence structures determined by subsets of the points and blocks of a balanced incomplete block design (BIBD). These results generalize and strengthen known bounds on the number of…

Combinatorics · Mathematics 2016-12-28 Ben Lund , Shubhangi Saraf

We survey recent (and not so recent) results concerning arrangements of lines, points and other geometric objects and the applications these results have in theoretical computer science and combinatorics. The three main types of problems we…

Combinatorics · Mathematics 2015-03-20 Zeev Dvir

We consider problems involving rich homotheties in a set S of n points in the plane (that is, homotheties that map many points of S to other points of S). By reducing these problems to incidence problems involving points and lines in R^3,…

Computational Geometry · Computer Science 2017-09-12 Dror Aiger , Micha Sharir

In this paper, we prove a new point-sphere incidence bound in vector spaces over finite fields. More precisely, let $P$ be a set of points and $S$ be a set of spheres in $\mathbb{F}_q^d$. Suppose that $|P|, |S|\le N$, we prove that the…

Combinatorics · Mathematics 2021-09-20 Doowon Koh , Thang Pham

We first describe a reduction from the problem of lower-bounding the number of distinct distances determined by a set $S$ of $s$ points in the plane to an incidence problem between points and a certain class of helices (or parabolas) in…

Computational Geometry · Computer Science 2010-05-07 György Elekes , Micha Sharir

The study of counting point-hyperplane incidences in the $d$-dimensional space was initiated in the 1990's by Chazelle and became one of the central problems in discrete geometry. It has interesting connections to many other topics, such as…

Combinatorics · Mathematics 2024-04-04 Aleksa Milojević , István Tomon , Benny Sudakov

We prove a common generalization of the Ham Sandwich theorem and Alon's Necklace Splitting theorem. Our main results show the existence of fair distributions of $m$ measures in $R^d$ among $r$ thieves using roughly $mr/d$ convex pieces,…

Combinatorics · Mathematics 2017-11-22 Pavle V. M. Blagojević , Pablo Soberón

We extend (and somewhat simplify) the algebraic proof technique of Guth and Katz \cite{GK}, to obtain several sharp bounds on the number of incidences between lines and points in three dimensions. Specifically, we show: (i) The maximum…

Computational Geometry · Computer Science 2009-05-12 György Elekes , Haim Kaplan , Micha Sharir

We prove bounds on the number of incidences between a set of algebraic curves in $\mathbb{C}^2$ and a Cartesian product $A\times B$ with finite sets $A,B\subset \mathbb{C}$. Similar bounds are known under various conditions, but we show…

Combinatorics · Mathematics 2015-11-03 József Solymosi , Frank de Zeeuw

Steinitz's theorem states that if a point $a \in \mathrm{int\,conv\,} X$ for a set $X \subset \mathbb{R}^d$, then $X$ contains a subset $Y$ of size at most $2d$ such that $a \in \mathrm{int\,conv\,}Y$. The bound $2d$ is best possible here.…

Combinatorics · Mathematics 2026-03-13 Imre Bárány , Yun Qi

We sharpen and generalize the dimension growth bounds for the number of points of bounded height lying on an irreducible algebraic variety of degree $d$, over any global field. In particular, we focus on the affine hypersurface situation by…

Number Theory · Mathematics 2025-12-05 Raf Cluckers , Pierre Dèbes , Yotam I. Hendel , Kien Huu Nguyen , Floris Vermeulen

The Ham-Sandwich theorem is a well-known result in geometry. It states that any $d$ mass distributions in $\mathbb{R}^d$ can be simultaneously bisected by a hyperplane. The result is tight, that is, there are examples of $d+1$ mass…

Computational Geometry · Computer Science 2019-04-01 Patrick Schnider

We prove some injectivity theorems. Our proof depends on the theory of mixed Hodge structures on cohomology groups with compact support. Our injectivity theorems would play crucial roles in the minimal model theory for higher-dimensional…

Algebraic Geometry · Mathematics 2015-07-06 Osamu Fujino