English
Related papers

Related papers: Incidences between planes over finite fields

200 papers

In this paper we establish an improved bound for the number of incidences between a set $P$ of $m$ points and a set $H$ of $n$ planes in $\mathbb R^3$, provided that the points lie on a two-dimensional nonlinear irreducible algebraic…

Combinatorics · Mathematics 2017-05-31 Micha Sharir , Noam Solomon

We prove an incidence theorem for points and planes in the projective space $\mathbb P^3$ over any field $\mathbb F$, whose characteristic $p\neq 2.$ An incidence is viewed as an intersection along a line of a pair of two-planes from two…

Combinatorics · Mathematics 2015-12-07 Misha Rudnev

The point-plane incidence theorem states that the number of incidences between $n$ points and $m\geq n$ planes in the projective three-space over a field $F$, is $$O\left(m\sqrt{n}+ m k\right),$$ where $k$ is the maximum number of collinear…

Combinatorics · Mathematics 2018-06-12 Misha Rudnev

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

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

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 consider an incidence problem in $\mathbb{R}^4$ which asks, for a set of $L$ lines and a set of $S$ planes in general position, what the maximum number of line-plane incidences is. A line-plane incidence is defined as a point where a…

Combinatorics · Mathematics 2023-12-27 Chao Cheng

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

Let $\mathbb{F}_{q}$ be a finite field of order $q$, where $q$ is an odd prime power. A quadratic subspace $(W,Q)$ of $(\mathbb{F}_{q}^{n},x_{1}^{2}+x_{2}^{2}+\cdots+x_{n}^{2})$ is called dot$_{k}$-subspace if $Q$ is isometrically…

Combinatorics · Mathematics 2020-05-26 Semin Yoo

We present a direct and fairly simple proof of the following incidence bound: Let $P$ be a set of $m$ points and $L$ a set of $n$ lines in ${\mathbb R}^d$, for $d\ge 3$, which lie in a common algebraic two-dimensional surface of degree $D$…

Algebraic Geometry · Mathematics 2015-06-03 Micha Sharir , Noam Solomon

Let $\mathbb{F}$ be a field, let $P \subseteq \mathbb{F}^d$ be a finite set of points, and let $\alpha,\beta \in \mathbb{F} \setminus \{0\}$. We study the quantity \[|\Pi_{\alpha, \beta}| = \{(p,q,r) \in P \times P \times P \mid p \cdot q =…

Combinatorics · Mathematics 2015-09-08 Ben Lund

Let $P$ be a $\delta$-separated $(\delta, s, C_P)$-set of points in $B(0, 1)\subset \mathbb{R}^d$ and $\Pi$ be a $\delta$-separated $(\delta, t, C_\Pi)$-set of hyperplanes intersecting $B(0, 1)$ in $\mathbb{R}^d$. Define \[I_{C\delta}(P,…

Classical Analysis and ODEs · Mathematics 2023-04-20 Thang Pham , Chun-Yen Shen , Nguyen Pham Minh Tri

A classical result by Erd\H{o}s, and later on by Bondy and Simonivits, states that every $n$-vertex graph with no cycle of length $2k$ has at most $O(n^{1+1 /k})$ edges. This bound is known to be tight when $k \in \{2,3,5\},$ but it is a…

Combinatorics · Mathematics 2019-11-27 Mozhgan Mirzaei , Andrew Suk , Jacques Verstraëte

We prove an incidence theorem for points and curves in the complex plane. Given a set of $m$ points in ${\mathbb R}^2$ and a set of $n$ curves with $k$ degrees of freedom, Pach and Sharir proved that the number of point-curve incidences is…

Combinatorics · Mathematics 2018-07-18 Adam Sheffer , Endre Szabó , Joshua Zahl

The celebrated Szemer\'edi--Trotter theorem states that the maximum number of incidences between $n$ points and $n$ lines in the plane is $O(n^{4/3})$, which is asymptotically tight. Solymosi (2005) conjectured that for any set of points…

Combinatorics · Mathematics 2025-09-29 Martin Balko , Nóra Frankl

The famous Szemer\'{e}di-Trotter theorem states that any arrangement of $n$ points and $n$ lines in the plane determines $O(n^{4/3})$ incidences, and this bound is tight. In this paper, we prove the following Tur\'an-type result for…

Combinatorics · Mathematics 2020-06-23 Mozhgan Mirzaei , Andrew Suk

We improve the theorem of Beck giving a lower bound on the number of $k$-flats spanned by a set of points in real space, and improve the bound of Elekes and T\'oth on the number of incidences between points and $k$-flats in real space.

Combinatorics · Mathematics 2020-06-29 Ben Lund

Let $\mathbb{F}_q$ be a finite field of $q$ elements where $q$ is a large odd prime power and $Q =a_1 x_1^{c_1}+...+a_dx_d^{c_d}\in \mathbb{F}_q[x_1,...,x_d]$, where $2\le c_i\le N$, $\gcd(c_i,q)=1$, and $a_i\in \mathbb{F}_q$ for all $1\le…

Combinatorics · Mathematics 2016-08-18 Nguyen Duy Phuong , Pham Van Thang , Le Anh Vinh

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 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
‹ Prev 1 2 3 10 Next ›