Search arXivSearch

arXiv · 1705.04255

Four-variable expanders over the prime fields

Abstract

Let $\mathbb{F}_p$ be a prime field of order $p>2$, and $A$ be a set in $\mathbb{F}_p$ with very small size in terms of $p$. In this note, we show that the number of distinct cubic distances determined by points in $A\times A$ satisfies \[|(A-A)^3+(A-A)^3|\gg |A|^{8/7},\] which improves a result due to Yazici, Murphy, Rudnev, and Shkredov. In addition, we investigate some new families of expanders in four and five variables. We also give an explicit exponent of a problem of Bukh and Tsimerman, namely, we prove that \[\max \left\lbrace |A+A|, |f(A, A)|\right\rbrace\gg |A|^{6/5},\] where $f(x, y)$ is a quadratic polynomial in $\mathbb{F}_p[x, y]$ that is not of the form $g(αx+βy)$ for some univariate polynomial $g$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Doowon Koh, Hossein Nassajian Mojarrad, Thang Pham, Claudiu Valculescu. 2018-06-30. Four-variable expanders over the prime fields. https://arxiv.org/abs/1705.04255

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