Search arXivSearch

arXiv · 1206.4517

Further improvements to incidence and Beck-type bounds over prime finite fields

Abstract

We establish improved finite field Szemeredi-Trotter and Beck type theorems. First we show that if P and L are a set of points and lines respectively in the plane F_p^2, with |P|,|L| \leq N and N<p, then there are at most C_1 N^{3/2-1/662+o(1)} incidences between points in P and lines in L. Here C_1 is some absolute constant greater than 1. This improves on the previously best-known bound of C_1 N^{3/2-1/806+o(1)}. Second we show that if P is a set of points in \mathbb{F}_p^2 with |P|<p then either at least C_2|P|^{1-o(1)} points in P are contained in a single line, or P determines least C_2 |P|^{1+1/109-o(1)} distinct lines. Here C_2 is an absolute constant less than 1. This improves on previous results in two ways. Quantitatively, the exponent of 1+1/109-o(1) is stronger than the previously best-known exponent of 1+1/267. And qualitatively, the result applies to all subsets of F_p^2 satisfying the cardinality condition; the previously best-known result applies only when P is of the form P=A*A for A \subseteq F_p.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Timothy G. F. Jones. 2012-06-20. Further improvements to incidence and Beck-type bounds over prime finite fields. https://arxiv.org/abs/1206.4517

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