Related papers: Incidence bounds via extremal graph theory
A widely investigated subject in combinatorial geometry, originated from Erd\H{o}s, is the following. Given a point set $P$ of cardinality $n$ in the plane, how can we describe the distribution of the determined distances? This has been…
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…
The first purpose of this paper is to solve completely the finite field cone restriction conjecture in four dimensions with $-1$ non-square. The second is to introduce a new approach to study incidence problems via restriction theory. More…
The inducibility of a graph represents its maximum density as an induced subgraph over all possible sequences of graphs of size growing to infinity. This invariant of graphs has been extensively studied since its introduction in $1975$ by…
Let $p$ be an odd prime and let $E\subset \mathbb{F}_p^2$ with $|E|=p^a$, where $0<a\le 1$. For a direction $V$ (a $1$-dimensional subspace of $\mathbb{F}_p^2$), let $\pi^V:\mathbb{F}_p^2\to \mathbb{F}_p^2/V$ denote the quotient map. We…
We prove almost tight bounds on incidences between points and $k$-dimensional varieties of bounded degree in $\R^d$. Our main tools are the Polynomial Ham Sandwich Theorem and induction on both the dimension and the number of points.
We establish a sharp point-sphere incidence bound in finite fields for point sets exhibiting controlled additive structure. Working in the framework of \((4,s)\)-Salem sets, which quantify pseudorandomness via fourth-order additive energy,…
We study hyperplane covering problems for finite grid-like structures in $\mathbb{R}^d$. We call a set $\mathcal{C}$ of points in $\mathbb{R}^2$ a conical grid if the line $y = a_i$ intersects $\mathcal{C}$ in exactly $i$ points, for some…
We study cross-graph charging schemes for graphs drawn in the plane. These are charging schemes where charge is moved across vertices of different graphs. Such methods have been recently applied to obtain various properties of…
The space of \emph{parallel redrawings} of an incidence geometry $(P,H,I)$ with an assigned set of normals is the set of points and hyperplanes in $\mathbb{R}^d$ satisfying the incidences given by $(P,H,I)$, such that the hyperplanes have…
We establish new bounds on the number of tangencies and orthogonal intersections determined by an arrangement of curves. First, given a set of $n$ algebraic plane curves, we show that there are $O(n^{3/2})$ points where two or more curves…
In $d$-dimensional space (over any field), given a set of lines, a joint is a point passed through by $d$ lines not all lying in some hyperplane. The joints problem asks to determine the maximum number of joints formed by $L$ lines, and it…
We use techniques from algebraic and extremal combinatorics to derive upper bounds on the number of independent sets in several (hyper)graphs arising from finite geometry. In this way, we obtain asymptotically sharp upper bounds for partial…
Combinatorial optimization problems are typically tackled by the branch-and-bound paradigm. We propose a new graph convolutional neural network model for learning branch-and-bound variable selection policies, which leverages the natural…
We design improved approximation algorithms for NP-hard graph problems by incorporating predictions (e.g., learned from past data). Our prediction model builds upon and extends the $\varepsilon$-prediction framework by Cohen-Addad, d'Orsi,…
The hypergraph Zarankiewicz's problem, introduced by Erd\H{o}s in 1964, asks for the maximum number of hyperedges in an $r$-partite hypergraph with $n$ vertices in each part that does not contain a copy of $K_{t,t,\ldots,t}$. Erd\H{o}s…
We study the integral points on $\mathbb P_ n\setminus D$, where $D$ is the branch locus of a projection from an hypersurface in $\mathbb P_{n+1}$ to a hyperplane $H\simeq\mathbb P_n$. In doing that we follow the approach proposed in a…
A fundamental problem in pattern avoidance is describing the asymptotic behavior of the extremal function and its generalizations. We prove an equivalence between the asymptotics of the graph extremal function for a class of bipartite…
The interference at a wireless node s can be modelled by the number of wireless nodes whose transmission ranges cover s. Given a set of positions for wireless nodes, the interference minimization problem is to assign a transmission radius…
We present a first exact study on higher-dimensional packing problems with order constraints. Problems of this type occur naturally in applications such as logistics or computer architecture and can be interpreted as higher-dimensional…