Related papers: Points-Polynomials Incidence Theorem with Applicat…

Incidence problems between geometric objects is a key area of focus in the field of discrete geometry. Among them, the study of incidence problems over finite fields have received a considerable amount of attention in recent years. In this…

We prove several bounds on the number of incidences between two sets of multivariate polynomials of bounded degree over finite fields. From these results, we deduce bounds on incidences between points and multivariate polynomials, extending…

In this paper, we prove the first incidence bound for points and conics over prime fields. As applications, we prove new results on expansion of bivariate polynomial images and on certain variations of distinct distances problems. These…

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}$…

We prove new bounds on the number of incidences between points and higher degree algebraic curves. The key ingredient is an improved initial bound, which is valid for all fields. Then we apply the polynomial method to obtain global bounds…

We present a polynomial partitioning theorem for finite sets of points in the real locus of an irreducible complex algebraic variety of codimension at most two. This result generalizes the polynomial partitioning theorem on the Euclidean…

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…

The point-line incidence problem has been widely studied in Euclidean spaces and vector spaces over finite fields, whereas the analogous problem has rarely been considered over finite $p$-adic rings. In this paper, we investigate incidences…

We prove a new upper bound for the number of incidences between points and lines in a plane over an arbitrary field $\mathbb{F}$, a problem first considered by Bourgain, Katz and Tao. Specifically, we show that $m$ points and $n$ lines in…

Understanding the limits of list-decoding and list-recovery of Reed-Solomon (RS) codes is of prime interest in coding theory and has attracted a lot of attention in recent decades. However, the best possible parameters for these problems…

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…

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…

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…

We study a wide spectrum of incidence problems involving points and curves or points and surfaces in $\mathbb R^3$. The current (and in fact the only viable) approach to such problems, pioneered by Guth and Katz [2010,2015], requires a…

We bound the number of incidences between points and spheres in finite vector spaces by bounding the sum of the number of points in the pairwise intersections of the spheres. We obtain new incidence bounds that are interesting when the…

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…

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…

List-decoding of Reed-Solomon (RS) codes beyond the so called Johnson radius has been one of the main open questions since the work of Guruswami and Sudan. It is now known by the work of Rudra and Wootters, using techniques from high…

We prove a point-wise and average bound for the number of incidences between points and hyper-planes in vector spaces over finite fields. While our estimates are, in general, sharp, we observe an improvement for product sets and sets…

We give a brief exposition of the proof of the Cayley-Salmon theorem and its recent role in incidence geometry. Even when we don't use the properties of ruled surfaces explicitly, the regime in which we have interesting results in…