Packing sets under finite groups via algebraic incidence structures
Norbert Hegyv\'ari, Le Quang Hung, Alex Iosevich, Thang Pham

TL;DR
This paper investigates the size of the union of orbits under finite group actions on vector spaces over finite fields, establishing sharp bounds and improvements under geometric conditions, with applications to incidence geometry and sum-product problems.
Contribution
It introduces new bounds for orbit unions under group actions, extending incidence and sum-product techniques to noncommutative groups like SL_2 and the Heisenberg group.
Findings
Proved sharp bounds for orbit unions under SL_2(F_p) actions.
Established power-saving bounds under geometric non-concentration conditions.
Extended incidence and sum-product methods to noncommutative group actions.
Abstract
Let be a finite group acting on a vector space over a prime field. Given finite sets and , we study the restricted orbit union and establish quantitative lower bounds for in terms of , , and natural structural conditions. This finite field packing problem has connections to distance geometry, configuration counting, and expanding graphs. For acting on , we prove that which is sharp. Under geometric non-concentration conditions on and subgroup-avoidance hypotheses on , 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-\epsilon}{2}}k^{\frac{1}{2}}}\right\rbrace…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Packing Problems · Advanced Manufacturing and Logistics Optimization · graph theory and CDMA systems
