When almost all sets are difference dominated in $\mathbb{Z}/n\mathbb{Z}$
Anand Hemmady, Adam Lott, Steven J. Miller

TL;DR
This paper studies how the sum and difference sets of random subsets of cyclic groups behave as the group size grows, revealing a phase transition from difference-dominated to balanced sets depending on the decay rate of the inclusion probability.
Contribution
It establishes a phase transition in the difference and sum set sizes of random subsets of cyclic groups, extending existing results from subsets of integers and connecting different probabilistic regimes.
Findings
For p(n) = o(n^{-1/2}), the difference set dominates almost surely.
At p(n) = c·n^{-1/2}, the ratio of difference to sum set sizes converges to 1+exp(-c^2/2).
When p(n) is between n^{-1/2} and sqrt(log n)·n^{-1/2}, the sets are almost surely complete.
Abstract
We investigate the behavior of the sum and difference sets of chosen independently and randomly according to a binomial parameter . We show that for rapidly decaying , is almost surely difference-dominated as , but for slowly decaying , is almost surely balanced as , with a continuous phase transition as crosses a critical threshold. Specifically, we show that if , then converges to almost surely as and if , then converges to almost surely as . In these cases, we modify the arguments of Hegarty and Miller on subsets of to prove our results. When , we prove that almost surely as $n \to…
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
TopicsAdvanced Mathematical Theories and Applications · Analytic Number Theory Research · Mathematical Dynamics and Fractals
