Skip to content

Kneserized Anticoncentration and Reverse Absorption for Graham's Rearrangement Conjecture

Simone Costa, Stefano Della Fiore, Tao Feng, Hengrui Liu

math.COarXiv:2608.10015

Abstract

We establish a Kneser-based anticoncentration estimate for uniform subset sums in composite cyclic groups. The estimate contains a periodic loss and is weaker than its prime-modulus counterpart. Nevertheless, together with known small- and large-set results, it proves that, for every fixed t≥2 such that Zt is strongly sequenceable and every sufficiently large prime p, every subset of Ztp\0\ has a valid ordering, thus establishing the analogue of Graham's rearrangement conjecture for this family of composite cyclic groups. We then identify the structural source of this loss. An inverse theorem shows that failure of the stabilizer-free growth underlying prime-type anticoncentration forces almost all of the set into a proper subgroup or one of its cosets. We exploit this structure by reverse absorption. Iterating the resulting dichotomy between non-periodic anticoncentration and structured concentration proves that every subset of \[ Zk\0\, k=Πi=1spiei, Σi=1sei≤ L, p1<·s<ps≤γp1, \] admits a valid ordering whenever L and γ are fixed and the primes pi are sufficiently large.

Create a lesson