On A Conjecture Regarding Permutations Which Destroy Arithmetic Progressions
Abstract
Hegarty conjectured for n≠ 2, 3, 5, 7 that Z/nZ has a permutation which destroys all arithmetic progressions mod n. For n n0, Hegarty and Martinsson demonstrated that Z/nZ has an arithmetic-progression destroying permutation. However n0≈ 1.4× 1014 and thus resolving the conjecture in full remained out of reach of any computational techniques. However, this paper using constructions modeled after those used by Elkies and Swaminathan for the case of Z/pZ with p being prime, establish the conjecture in full. Furthermore our results do not rely on the fact that it suffices to study when n<n0 and thus our results completely independent of the proof given by Hegarty and Martinsson.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.