Search arXivSearch

arXiv · 2003.04744

On incidences of lines in regular complexes

Abstract

A regular linear line complex is a three-parameter set of lines in space, whose Plücker vectors lie in a hyperplane, which is not tangent to the Klein quadric. Our main result is a bound $O(n^{1/2}m^{3/4} + m+n)$ for the number of incidences between $n$ lines in a complex and $m$ points in $\mathbb F^3$, where $\mathbb F$ is a field, and $n\leq char(\mathbb F)^{4/3}$ in positive characteristic. Zahl has recently observed that bichromatic pairwise incidences of lines coming from two distinct line complexes account for the nonzero single distance problem for a set of $n$ points in $\mathbb F^3$. This implied the new bound $O(n^{3/2})$ for the number of realisations of the distance, which is a square, for $\mathbb F$, where $-1$ is not a square in the $\mathbb F$-analogue of the Erd\H os single distance problem in $\mathbb R^3$. Our incidence bound yields, under a natural constraint, a weaker bound $O(n^{1.6})$, which holds for any distance, including zero, over any $\mathbb F$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Misha Rudnev. 2021-06-30. On incidences of lines in regular complexes. https://arxiv.org/abs/2003.04744

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