Search arXivSearch

arXiv · 2605.15727

On the number of directions formed by Cartesian products in $\mathbb{F}_{p^2}^2$

Abstract

We prove a lower bound on the number of directions determined by Cartesian products $A\times A$ in the affine plane over the finite field $\mathbb F_{p^2}$. Our lower bound holds for sets of size $p^{2/3}<|A|<p$, which are not contained in any affine copy of $\mathbb F_p$. The proof combines a structural result of Li and Roche-Newton on the set of directions formed by Cartesian products with a lower bound of Fancsali, Sziklai and Takáts. A key step shows that, unless the set of directions exhibits closure properties forcing subfield structure, one obtains a direction for which an algebraic multiplicity parameter in the latter theorem can be made explicit.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ali Mohammadi. 2026-05-15. On the number of directions formed by Cartesian products in $\mathbb{F}_{p^2}^2$. https://arxiv.org/abs/2605.15727

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