English
Related papers

Related papers: Algebraic Methods in Discrete Analogs of the Kakey…

200 papers

As a variant of the celebrated Szemer\'edi--Trotter theorem, Guth and Katz proved that $m$ points and $n$ lines in $\mathbb{R}^3$ with at most $\sqrt{n}$ lines in a common plane must determine at most $O(m^{1/2}n^{3/4})$ incidences for…

Combinatorics · Mathematics 2024-08-30 Andrew Suk , Ji Zeng

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…

Combinatorics · Mathematics 2018-07-10 Jordan S. Ellenberg , Jozsef Solymosi , Joshua Zahl

Given a set of $s$ points and a set of $n^2$ lines in three-dimensional Euclidean space such that each line is incident the $n$ points but no $n$ lines are coplanar, then we have $s=\Omega(n^{11/4})$. This is the first nontrivial answer to…

Combinatorics · Mathematics 2013-12-17 Jozsef Solymosi , Csaba D. Toth

We study special linear systems of surfaces of $\mathbb{P}^3$ interpolating nine points in general position having a quadric as fixed component. By performing degenerations in the blown-up space, we interpret the quadric obstruction in…

Algebraic Geometry · Mathematics 2015-10-01 Maria Chiara Brambilla , Olivia Dumitrescu , Elisa Postinghel

De Bruijn and Erd\H{o}s proved that every noncollinear set of n points in the plane determines at least n distinct lines. We suggest a possible generalization of this theorem in the framework of metric spaces and provide partial results on…

Combinatorics · Mathematics 2009-06-01 Xiaomin Chen , Vašek Chvátal

We prove a conjecture of D. Oberlin on the dimension of unions of lines in $\mathbb{R}^n$. If $d \geq 1$ is an integer, $0 \leq \beta \leq 1$, and $L$ is a set of lines in $\mathbb{R}^n$ with Hausdorff dimension at least $2(d-1) + \beta$,…

Classical Analysis and ODEs · Mathematics 2023-08-24 Joshua Zahl

Let X be a set definable in a sharply o-minimal structure. We consider the problem of counting the number of points where X intersects algebraic varieties V over Q of dimension k < codim X, as a function of T := deg(V) + h(V), where h(V) is…

Number Theory · Mathematics 2026-04-17 Gal Binyamini , Noriko Hirata-Kohno , Makoto Kawashima , Yuval Salant

The spread of a finite set of points is the ratio between the longest and shortest pairwise distances. We prove that the Delaunay triangulation of any set of n points in R^3 with spread D has complexity O(D^3). This bound is tight in the…

Computational Geometry · Computer Science 2007-05-23 Jeff Erickson

We prove that for $n>k\geq 3$, if $G$ is an $n$-vertex graph with chromatic number $k$ but any its proper subgraph has smaller chromatic number, then $G$ contains at most $n-k+3$ copies of cliques of size $k-1$. This answers a problem of…

Combinatorics · Mathematics 2022-10-11 Jun Gao , Jie Ma

According to the Erd\H{o}s-Szekeres theorem, for every $n$, a sufficiently large set of points in general position in the plane contains $n$ in convex position. In this note we investigate the line version of this result, that is, we want…

Metric Geometry · Mathematics 2015-04-20 Imre Bárány , Edgardo Roldán-Pensado , Géza Tóth

We present a proof of the Harbourne-Hirschowitz conjecture for linear systems with base points of multiplicity seven or less. This proof uses a well-known degeneration of the projective plane, as well as a combinatorial technique that…

Algebraic Geometry · Mathematics 2009-02-14 Stephanie Yang

In this paper, we construct an infinite series of line arrangements in characteristic two, each featuring only triple intersection points. This finding challenges the existing conjecture that suggests the existence of only a finite number…

Combinatorics · Mathematics 2025-05-21 Lukas Kühne , Tomasz Szemberg , Halszka Tutaj-Gasińska

We show that if over some number field there exists a certain diagonal plane cubic curve that is locally solvable everywhere, but that does not have points over any cubic galois extension of the number field, then the algebraic part of the…

Number Theory · Mathematics 2007-08-22 Ronald van Luijk

It is conjectured since long that for any convex body $K \in \mathbb{R}^n$ there exists a point in the interior of $K$ which belongs to at least $2n$ normals from different points on the boundary of $K$. The conjecture is known to be true…

Metric Geometry · Mathematics 2023-09-07 A. Grebennikov , G. Panina

Let $S$ be an $n$-punctured sphere, with $n \geq 3$. We prove that $\binom{n}{3}$ is the maximum size of a family of pairwise non-homotopic simple arcs on $S$ joining a fixed pair of distinct punctures of $S$ and pairwise intersecting at…

Geometric Topology · Mathematics 2019-06-17 Sami Douba

Let $f(n,\ell)$ be the maximum integer such that every set of $n$ points in the plane with at most $\ell$ collinear contains a subset of $f(n,\ell)$ points with no three collinear. First we prove that if $\ell \leq O(\sqrt{n})$ then…

Combinatorics · Mathematics 2016-02-09 Michael S. Payne , David R. Wood

We prove that the set of directions of lines intersecting three disjoint balls in $R^3$ in a given order is a strictly convex subset of $S^2$. We then generalize this result to $n$ disjoint balls in $R^d$. As a consequence, we can improve…

Metric Geometry · Mathematics 2007-05-23 Ciprian Borcea , Xavier Goaoc , Sylvain Petitjean

An ordinary circle of a set $P$ of $n$ points in the plane is defined as a circle that contains exactly three points of $P$. We show that if $P$ is not contained in a line or a circle, then $P$ spans at least $\frac{1}{4}n^2 - O(n)$…

Let $p_1,p_2,p_3$ be three distinct points in the plane, and, for $i=1,2,3$, let $\mathcal C_i$ be a family of $n$ unit circles that pass through $p_i$. We address a conjecture made by Sz\'ekely, and show that the number of points incident…

Metric Geometry · Mathematics 2016-07-14 Orit E. Raz , Micha Sharir , József Solymosi

Let $A, B$, be finite subsets of an abelian group, and let $G \subset A \times B$ be such that $# A, # B, # \{a+b: (a,b) \in G \} \leq N$. We consider the question of estimating the quantity $# \{a-b: (a,b) \in G \}$. Recently Bourgain…

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