English
Related papers

Related papers: Exploration on Incidence Geometry and Sum-Product …

200 papers

We use spectral theory and algebraic geometry to establish a higher-degree analogue of a Szemer\'edi--Trotter-type theorem over finite fields, with an application to polynomial expansion.

Combinatorics · Mathematics 2026-02-25 Nuno Arala , Sam Chow

We prove some novel multi-parameter point-line incidence estimates in vector spaces over finite fields. While these could be seen as special cases of higher-dimensional incidence results, they outperform their more general counterparts in…

Combinatorics · Mathematics 2023-08-08 Hung Le , Steven Senger , Minh-Quan Vo

We generalize the Szemer\'edi-Trotter incidence theorem, to bound the number of complete \emph{flags} in higher dimensions. Specifically, for each $i=0,1,\ldots,d-1$, we are given a finite set $S_i$ of $i$-flats in $\R^d$ or in $\C^d$, and…

Combinatorics · Mathematics 2015-12-31 Saarik Kalia , Micha Sharir , Noam Solomon , Ben Yang

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 present some new sharp constructions for the Szemer\'{e}di-Trotter theorem. These constructions generalize previous work of Erd\H{o}s, Elekes, Sheffer and Silier, Guth and Silier, and the author. In the past, arguments showing the…

Combinatorics · Mathematics 2025-10-14 Gabriel Currier

We study a Szemer\'edi-Trotter type theorem in finite fields. We then use this theorem to obtain an improved sum-product estimate in finite fields.

Combinatorics · Mathematics 2007-11-29 Le Anh Vinh

We use recent advances in the theory of Furstenberg sets to prove new incidence results of Szemer\'edi--Trotter strength for $\delta$-discretized structures with Cartesian product flavor. We use these results to make progress on a number of…

Classical Analysis and ODEs · Mathematics 2025-11-21 Ciprian Demeter , William O'Regan

Additive combinatorics is built around the famous theorem by Szemer\'edi which asserts existence of arithmetic progressions of any length among the integers. There exist several different proofs of the theorem based on very different…

Combinatorics · Mathematics 2014-11-11 Erik Sjöland

In 1975 Szemer\'edi proved the long-standing conjecture of Erd\H{o}s and Tur\'an that any subset of $\bbZ$ having positive upper Banach density contains arbitrarily long arithmetic progressions. Szemer\'edi's proof was entirely…

Dynamical Systems · Mathematics 2010-06-09 Tim Austin

Let $\mathcal{P}$ be a set of $m$ points and $\mathcal{L}$ a set of $n$ lines in $K^2$, where $K$ is a field with char$(K)=0$. We prove the incidence bound $$\mathcal{I}(\mathcal{P},\mathcal{L})=O(m^{2/3}n^{2/3}+m+n).$$ Moreover, this bound…

Combinatorics · Mathematics 2025-10-20 Jiahe Shen

The basic theme of this paper is the fact that if $A$ is a finite set of integers, then the sum and product sets cannot both be small. A precise formulation of this fact is Conjecture 1 below due to Erd\H os-Szemer\'edi [E-S]. (see also…

Combinatorics · Mathematics 2007-05-23 Mei-Chu Chang

In their seminal paper from 1983, Erd\H{o}s and Szemer\'edi showed that any $n$ distinct integers induce either $n^{1+\epsilon}$ distinct sums of pairs or that many distinct products, and conjectured a lower bound of $n^{2-o(1)}$. They…

Combinatorics · Mathematics 2009-09-08 Noga Alon , Omer Angel , Itai Benjamini , Eyal Lubetzky

It is shown that $n$ points and $e$ lines in the complex Euclidean plane ${\mathbb C}^2$ determine $O(n^{2/3}e^{2/3}+n+e)$ point-line incidences. This bound is the best possible, and it generalizes the celebrated theorem by Szemer\'edi and…

Combinatorics · Mathematics 2015-07-10 Csaba D. Toth

In their seminal paper Erd\H{o}s and Szemer\'edi formulated conjectures on the size of sumset and product set of integers. The strongest form of their conjecture is about sums and products along the edges of a graph. In this paper we show…

Combinatorics · Mathematics 2018-02-20 Noga Alon , Imre Ruzsa , Jozsef Solymosi

We use recent results about linking the number of zeros on algebraic varieties over $\mathbb{C}$, defined by polynomials with integer coefficients, and on their reductions modulo sufficiently large primes to study congruences with products…

Number Theory · Mathematics 2022-07-25 Bryce Kerr , Jorge Mello , Igor Shparlinski

The symmetric case of the Szemer\'edi-Trotter theorem says that any configuration of $N$ lines and $N$ points in the plane has at most $O(N^{4/3})$ incidences. We describe a recipe involving just $O(N^{1/3})$ parameters which sometimes…

Combinatorics · Mathematics 2023-03-31 Nets Katz , Olivine Silier

A famous theorem of Szemer\'edi asserts that any set of integers of positive upper density will contain arbitrarily long arithmetic progressions. In its full generality, we know of four types of arguments that can prove this theorem: the…

Combinatorics · Mathematics 2007-05-23 Terence Tao

We prove a Szemer\'edi-Trotter type theorem and a sum-product estimate in the setting of finite quasifields. These estimates generalize results of the fourth author, of Garaev, and of Vu. We generalize results of Gyarmati and S\'ark\"ozy on…

Number Theory · Mathematics 2016-10-20 Thang Pham , Michael Tait , Craig Timmons , Le Anh Vinh

Let $A$ be a subset of a finite field $F := \Z/q\Z$ for some prime $q$. If $|F|^\delta < |A| < |F|^{1-\delta}$ for some $\delta > 0$, then we prove the estimate $|A+A| + |A.A| \geq c(\delta) |A|^{1+\eps}$ for some $\eps = \eps(\delta) > 0$.…

Combinatorics · Mathematics 2007-05-23 Jean Bourgain , Nets Katz , Terence Tao

We prove analogues of the Szemer\'edi-Trotter theorem and other incidence theorems using $\delta$-tubes in place of straight lines, assuming that the $\delta$-tubes are well-spaced in a strong sense.

Classical Analysis and ODEs · Mathematics 2019-04-12 Larry Guth , Noam Solomon , Hong Wang
‹ Prev 1 2 3 10 Next ›