Search arXivSearch

arXiv · 1408.5867

Incidence bounds on multijoints and generic joints

Abstract

A point $x \in \mathbb{F}^n$ is a joint formed by a finite collection $\mathfrak{L}$ of lines in $\mathbb{F}^n$ if there exist at least $n$ lines in $\mathfrak{L}$ through $x$ that span $\mathbb{F}^n$. It is known that there are $\lesssim_n |\mathfrak{L}|^{\frac{n}{n-1}}$ joints formed by $\mathfrak{L}$. We say that a point $x \in \mathbb{F}^n$ is a multijoint formed by the finite collections $\mathfrak{L}_1,\ldots,\mathfrak{L}_n$ of lines in $\mathbb{F}^n$ if there exist at least $n$ lines through $x$, one from each collection, spanning $\mathbb{F}^n$. We show that there are $\lesssim_n (|\mathfrak{L}_1|\cdots |\mathfrak{L}_n|)^{\frac{1}{n-1}}$ such points for any field $\mathbb{F}$ and $n=3$, as well as for $\mathbb{F}=\mathbb{R}$ and any $n \geq 3$. Moreover, we say that a point $x \in \mathbb{F}^n$ is a generic joint formed by a finite collection $\mathfrak{L}$ of lines in $\mathbb{F}^n$ if each $n$ lines of $\mathfrak{L}$ through $x$ form a joint there. We show that, for $\mathbb{F}=\mathbb{R}$ and any $n \geq 3$, there are $\lesssim_n \frac{|\mathfrak{L}|^{\frac{n}{n-1}}}{k^{\frac{n+1}{n-1}}}+\frac{|\mathfrak{L}|}{k}$ generic joints formed by $\mathfrak{L}$, each lying in $\sim k$ lines of $\mathfrak{L}$. This result generalises, to all dimensions, a (very small) part of the main point-line incidence theorem in $\mathbb{R}^3$ in \cite{Guth_Katz_2010} by Guth and Katz. Finally, we generalise our results in $\mathbb{R}^n$ to the case of multijoints and generic joints formed by real algebraic curves.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marina Iliopoulou. 2015-07-06. Incidence bounds on multijoints and generic joints. https://doi.org/10.1007/s00454-015-9703-0

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