Distinct partial products in prime dihedral groups
Version 1 / Oct 22, 2026 / CC BY 4.0
Abstract
Let be the dihedral group of order , where is prime.
For every fixed , we prove that every subset with admits an ordering whose nonempty partial products are pairwise distinct.
Combined with the known small- and large-set theorems, this covers every subset size for all sufficiently large primes.
Pairing reflections reduces the products to partial sums with fixed parity-labelled offsets.
Two passes of block rotations remove distant collisions; bounded displacement allows the local condition to exclude the remaining collisions.
The existence of suitable rotations follows from Pham--Sauermann's subset-sum anticoncentration theorem, an affine-rank estimate, and a count of clustered collision witnesses.
Provenance statement
Tools used
- OpenAI
- ChatGPT
- Anthropic
- Claude Fable
References
- Bapat, R. B. Graphs and Matrices. Springer London. 2010DOI
- Benjamin Bedert; Noah Kravitz. Graham's rearrangement conjecture beyond the rectification barrier. Israel Journal of Mathematics, vol. 273, no. 1, pp. 471–500. 2026. Published online 30 November 2025DOI
- Benjamin Bedert; Matija Bucić; Noah Kravitz; Richard Montgomery; Alp Müyesser. On Graham's rearrangement conjecture over . 2025. Version 1, 25 August 2025arXiv
- Costa, Simone; Della Fiore, Stefano; Engel, Eva R. Graham's rearrangement for a class of semidirect products. 2025. Version 2, 19 August 2025arXiv
- Costa, Simone; Della Fiore, Stefano; Feng, Tao; Liu, Hengrui. Kneserized Anticoncentration and Reverse Absorption for Graham's Rearrangement Conjecture. 2026. Version 2, 18 August 2026arXiv
- P. Erdős; R. L. Graham. Old and new problems and results in combinatorial number theory. L'Enseignement Mathématique, Université de Genève, no. 28. 1980link
- R. L. Graham. On sums of integers taken from a fixed sequence. Proceedings of the Washington State University Conference on Number Theory, pp. 22–40. 1971link
- David G. Harris; Aravind Srinivasan. A Constructive Lovász Local Lemma for Permutations. Theory of Computing, vol. 13, no. 17, pp. 1–41. 2017DOI
- Kwan, Matthew; Sauermann, Lisa. Resolution of the quadratic Littlewood–Offord problem. Compositio Mathematica, vol. 161, no. 12, pp. 3089–3139. 2025. Lemma 3.7 is cited from arXiv:2312.13826v1arXivDOI
- Linyuan Lu; László Székely. Using Lovász Local Lemma in the Space of Random Injections. The Electronic Journal of Combinatorics, vol. 14, no. 1, pp. R63. 2007. Research Paper R63DOI
Show all 13 referencesShow fewer references
- Odlyzko, A. M. On subspaces spanned by random selections of vectors. Journal of Combinatorial Theory, Series A, vol. 47, no. 1, pp. 124–133. 1988. Proof of Proposition 2.2 is cited from the author's manuscript, pp. 5–6DOI
- M. A. Ollis. Sequences in Dihedral Groups with Distinct Partial Products. Australasian Journal of Combinatorics, vol. 78, no. 1, pp. 35–60. 2020link
- Huy Tuan Pham; Lisa Sauermann. On Graham's rearrangement conjecture. 2026. Version 1, 17 February 2026arXiv
Version history
- v1 · 16 pagesSubmitted by alexandre ThieryInitial depositCurrentOct 21, 2026