Permutations that Destroy Arithmetic Progressions in Elementary $p$-Groups
Noam D. Elkies, Ashvin Swaminathan

TL;DR
This paper characterizes when elementary p-groups admit permutations that eliminate all nontrivial 3-term arithmetic progressions, extending previous results and confirming conjectures for specific cases.
Contribution
It provides a complete characterization of AP-destroying permutations for elementary p-groups, resolving a conjecture for these finite groups.
Findings
AP-destroying permutations exist for elementary p-groups if and only if p is odd and (p,k) not in {(3,1),(5,1),(7,1)}
The result extends known results from infinite to certain finite groups
Confirms conjecture for elementary p-groups with specific exceptions.
Abstract
Given an abelian group , it is natural to ask whether there exists a permutation of that "destroys" all nontrivial 3-term arithmetic progressions (APs), in the sense that for every ordered triple satisfying . This question was resolved for infinite groups by Hegarty, who showed that there exists an AP-destroying permutation of if and only if has the same cardinality as , where denotes the subgroup of all elements in whose order divides . In the case when is finite, however, only partial results have been obtained thus far. Hegarty has conjectured that an AP-destroying permutation of exists if for all , and together with Martinsson, he has proven the conjecture for all . In this…
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.
