Search arXivSearch

arXiv · 2411.05377

Packing sets under finite groups via algebraic incidence structures

Abstract

Let $G$ be a finite group acting on a vector space $V = \mathbb{F}_p^n$ over a prime field. Given finite sets $S \subset G$ and $E \subset V$, we study the restricted orbit union $S(E) = \bigcup_{g\in S} g(E)$ and establish quantitative lower bounds for $|S(E)|$ in terms of $|S|$, $|E|$, and natural structural conditions. This finite field packing problem has connections to distance geometry, configuration counting, and expanding graphs. For $G = SL_2(\mathbb{F}_p)$ acting on $\mathbb{F}_p^2$, we prove that $$|S(E)| \gg \min\left\lbrace p^2, \frac{|S||E|}{p^2}\right\rbrace,$$ which is sharp. Under geometric non-concentration conditions on $E$ and subgroup-avoidance hypotheses on $S$, we obtain a power-saving improvement of the form $$|S(E)|\gg \min \left\lbrace p^2, ~\max\left\lbrace\frac{|S||E|}{pk}, ~\frac{|S|^{\frac{1}{2}}|E|}{p^{\frac{1-ε}{2}}k^{\frac{1}{2}}}\right\rbrace \right\rbrace,$$ where $k$ bounds the radial multiplicity of $E$. For small sets $|E| \leq p$, we establish optimal bounds using weighted incidence theory. Analogous results are proved for the first Heisenberg group $\mathbb{H}_1(\mathbb{F}_p)$ acting on $\mathbb{F}_p^3$. Our approach reformulates the problem as an incidence question in a bipartite action graph. The proofs combine Fourier analytic techniques, energy estimates, point-line incidence bounds, and area-energy inequalities for skew dot products. The methods extend classical sum-product type problems and incidence theory to noncommutative group actions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Norbert Hegyvári, Le Quang Hung, Alex Iosevich, Thang Pham. 2026-02-07. Packing sets under finite groups via algebraic incidence structures. https://arxiv.org/abs/2411.05377

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