Search arXivSearch

arXiv · 1609.09026

Incidences between points and lines on two- and three-dimensional varieties

Abstract

Let $P$ be a set of $m$ points and $L$ a set of $n$ lines in $\mathbb R^4$, such that the points of $P$ lie on an algebraic three-dimensional surface of degree $D$ that does not contain hyperplane or quadric components, and no 2-flat contains more than $s$ lines of $L$. We show that the number of incidences between $P$ and $L$ is $$ I(P,L) = O\left(m^{1/2}n^{1/2}D + m^{2/3}n^{1/3}s^{1/3} + nD + m\right) , $$ for some absolute constant of proportionality. This significantly improves the bound of the authors, for arbitrary sets of points and lines in $\mathbb R^4$, when $D$ is not too large. The same bound holds when the three-dimensional surface is embedded in any higher dimensional space. For the proof of this bound, we revisit certain parts of [Sharir-Solomon16], combined with the following new incidence bound. Let $P$ be a set of $m$ points and $L$ a set of $n$ lines in $\mathbb R^d$, for $d\ge 3$, which lie in a common two-dimensional algebraic surface of degree $D$ (assumed to be $\ll n^{1/2}$) that does not contain any 2-flat, so that no 2-flat contains more than $s$ lines of $L$ (here we require that the lines of $L$ also be contained in the surface). Then the number of incidences between $P$ and $L$ is $$ I(P,L) = O\left(m^{1/2}n^{1/2}D^{1/2} + m^{2/3}D^{2/3}s^{1/3} + m + n\right). $$ When $d=3$, this improves the bound of Guth and Katz for this special case, when $D \ll n^{1/2}$. Moreover, the bound does not involve the term $O(nD)$, that arises in most standard approaches, and its removal is a significant aspect of our result. Finally, we also obtain (slightly weaker) variants of both results over the complex field. For two-dimensional varieties, the bound is as in the real case, with an added term of $O(D^3)$. For three-dimensional varieties, the bound is as in the real case, with an added term of $O(D^6)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Micha Sharir, Noam Solomon. 2016-09-28. Incidences between points and lines on two- and three-dimensional varieties. https://arxiv.org/abs/1609.09026

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO