On incidences of lines in regular complexes

DOI10.1016/J.EJC.2021.103400zbMATH Open1471.52014arXiv2003.04744OpenAlexW3185031497MaRDI QIDQ1979435FDOQ1979435

Authors: Misha Rudnev 

Publication date: 2 September 2021

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: A regular linear line complex is a three-parameter set of lines in space, whose Pl"ucker 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 $mathbbF$ is a field, and $nleqchar(mathbbF{)}^{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 $mathbbF$, where $-1$ is not a square in the $mathbbF$-analogue of the ErdH 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 $mathbbF$.

Full work available at URL: https://arxiv.org/abs/2003.04744

Recommendations

• On the number of incidences between points and planes in three dimensions
• Incidences between points and lines in three dimensions
• On rich points and incidences with restricted sets of lines in 3-space
• Incidences between points and lines on two- and three-dimensional varieties
• Point-line incidences in space

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Other finite incidence structures (geometric aspects) (51E30)

Cites Work

• A sum-product estimate in finite fields, and applications
• Geometric Fundamentals of Robotics
• Szemerédi-Trotter-type theorems in dimension 3
• On the Erdős distinct distances problem in the plane
• Erdös distance problem in vector spaces over finite fields
• On Sets of Distances of n Points
• Computational line geometry
• Title not available (Why is that?)
• Distinct distance estimates and low degree polynomial partitioning
• On the number of incidences between points and planes in three dimensions
• On the use of the Klein quadric for geometric incidence problems in two dimensions
• Point-plane incidences and some applications in positive characteristic
• Breaking the 3/2 Barrier for Unit Distances in Three Dimensions

Cited In (5)

• Title not available (Why is that?)
• On incidence bounds with Möbius hyperbolae in positive characteristic
• Incidences between points and lines in R4
• A result about the density of iterated line intersections in the plane
• On the number of ordinary lines determined by sets in complex space

This page was built for publication: On incidences of lines in regular complexes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1979435)