Search arXivSearch

arXiv · 2104.10534

Incidence bounds with Möbius hyperbolae in positive characteristic

Abstract

We prove new incidence bounds between a plane point set, which is a Cartesian product, and a set of translates $H$ of the hyperbola $xy=λ\neq 0$, over a field of asymptotically large positive characteristic $p$. They improve recent bounds by Shkredov, which are based on using explicit incidence estimates in the early terminated procedure of repeated applications of the Cauchy-Schwarz inequality, underlying many qualitative results related to growth and expansion in groups. The improvement -- both quantitative, plus we are able to deal with a general $H$, rather than a Cartesian product -- is mostly due to a non-trivial "intermediate" bound on the number of $k$-rich Möbius hyperbolae in positive characteristic. In addition, we make an observation that a certain energy-type quantity in the context of $H$ can be bounded via the $L^2$-moment of the Minkowski distance in $H$ and can therefore fetch the corresponding estimates apropos of the Erdős distinct distance problem.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Misha Rudnev, James Wheeler. 2021-04-21. Incidence bounds with Möbius hyperbolae in positive characteristic. https://arxiv.org/abs/2104.10534

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