English
Related papers

Related papers: Incidences with curves in R^d

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

Let $d$ and $k$ be integers with $1 \leq k \leq d-1$. Let $\Lambda$ be a $d$-dimensional lattice and let $K$ be a $d$-dimensional compact convex body symmetric about the origin. We provide estimates for the minimum number of $k$-dimensional…

Combinatorics · Mathematics 2018-01-04 Martin Balko , Josef Cibulka , Pavel Valtr

Let $P$ be a set of $n$ points in the real plane contained in an algebraic curve $C$ of degree $d$. We prove that the number of distinct distances determined by $P$ is at least $c_d n^{4/3}$, unless $C$ contains a line or a circle. We also…

Metric Geometry · Mathematics 2016-07-20 János Pach , Frank de Zeeuw

A bipartite graph $G$ is semi-algebraic in $\mathbb{R}^d$ if its vertices are represented by point sets $P,Q \subset \mathbb{R}^d$ and its edges are defined as pairs of points $(p,q) \in P\times Q$ that satisfy a Boolean combination of a…

Combinatorics · Mathematics 2015-11-24 Jacob Fox , János Pach , Adam Sheffer , Andrew Suk , Joshua Zahl

A celebrated unit distance conjecture due to Erd\H os says that that the unit distances cannot arise more than $C_{\epsilon}n^{1+\epsilon}$ times (for any $\epsilon>0$) among $n$ points in the Euclidean plane (see e.g. \cite{SST84} and the…

Combinatorics · Mathematics 2022-02-14 A. Gafni , A. Iosevich , E. Wyman

We investigate combinatorial bounds for the total Tjurina numbers of plane curve arrangements. Focusing on arrangements of lines and conics in $\mathbb{P}^2$ that admit only ordinary quasi-homogeneous singularities, we derive new structural…

Algebraic Geometry · Mathematics 2026-02-27 Piotr Pokora

Given d in IN, we prove that all smooth K3 surfaces (over any field of characteristic p other than 2,3) of degree greater than 84d^2 contain at most 24 rational curves of degree at most d. In the exceptional characteristics, the same bounds…

Algebraic Geometry · Mathematics 2022-03-07 Sławomir Rams , Matthias Schütt

Given $m$ points and $n$ hyperplanes in $\mathbb{R}^d$, if there are many incidences, we expect to find a big cluster $K_{r,s}$ in their incidence graph. Apfelbaum and Sharir found lower and upper bounds for the largest size of $rs$, which…

Combinatorics · Mathematics 2018-10-04 Thao T. Do

Let a set of nodes $\mathcal X$ in the plane be $n$-independent, i.e., each node has a fundamental polynomial of degree $n.$ Assume that $\#\mathcal X=d(n,k-3)+3= (n+1)+n+\cdots+(n-k+5)+3$ and $4 \le k\le n-1.$ In this paper we prove that…

Algebraic Geometry · Mathematics 2021-06-22 Hakop Hakopian , Harutyun Kloyan , Davit Voskanyan

Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs. In this paper we study the convergence of random tree sequences with given…

Probability · Mathematics 2014-08-07 Attila Deák

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

Let a set of nodes $\mathcal X$ in plain be $n$-independent, i.e., each node has a fundamental polynomial of degree $n.$ Suppose also that $|\mathcal X|= d(n,k-2)+2,$ where $d(n,k-2) = (n+1)+n+\cdots+(n-k+4)$ and $\ k\le n-1.$ In this paper…

Algebraic Geometry · Mathematics 2021-02-02 Hakop Hakopian , Harutyun Kloyan

Consider a component of the Hilbert scheme whose general point corresponds to a degree d genus g smooth irreducible and nondegenerate curve in a projective variety X. We give lower bounds for the dimension of such a component when X is P^3,…

Algebraic Geometry · Mathematics 2008-08-28 Dawei Chen

We prove two theorems concerning incidence posets of graphs, cover graphs of posets and a related graph parameter. First, answering a question of Haxell, we show that the chromatic number of a graph is not bounded in terms of the dimension…

Combinatorics · Mathematics 2013-08-13 William T. Trotter , Ruidong Wang

In recent years, sum-product estimates in Euclidean space and finite fields have been studied using a variety of combinatorial, number theoretic and analytic methods. Erdos type problems involving the distribution of distances, areas and…

Combinatorics · Mathematics 2008-03-31 David Covert , Derrick Hart , Alex Iosevich , Doowon Koh , Misha Rudnev

We give a bound on the H-constants of configurations of smooth curves having transversal intersection points only on an algebraic surface of non-negative Kodaira dimension. We also study in detail configurations of lines on smooth complete…

Algebraic Geometry · Mathematics 2019-12-05 Roberto Laface , Piotr Pokora

We determine the maximal number of smooth rational degree d curves on a complex K3-surface of degree 2n provided n is sufficiently large as compared to d>1. We obtain precise characterization of configurations of rational degree d curves…

Algebraic Geometry · Mathematics 2025-12-09 Alex Degtyarev , Sławomir Rams

We prove that the incidence scheme of rational curves of degree 11 on quintic threefolds is irreducible. This implies a strong form of the Clemens conjecture in degree 11. Namely, on a general quintic threefold $F$ in $\mathbb{P}^4$, there…

Algebraic Geometry · Mathematics 2010-04-05 Ethan Cotterill

In this article we address the problem of computing the dimension of the space of plane curves of degree $d$ with $n$ general points of multiplicity $m$. A conjecture of Harbourne and Hirschowitz implies that when $d \geq 3m$, the dimension…

Algebraic Geometry · Mathematics 2007-05-23 C. Ciliberto , R. Miranda

Let C be an affine, plane, algebraic curve of degree d with integer coefficients. In 1989, Bombieri and Pila showed that if one takes a box with sides of length N then C can obtain no more than O_{d,\epsilon}(N^{1/d+\epsilon}) integer…

Number Theory · Mathematics 2013-01-25 Dave Mendes da Costa
‹ Prev 1 3 4 5 6 7 10 Next ›