When almost all sets are difference dominated in Z/nZ

zbMATH Open1414.11025arXiv1608.03209MaRDI QIDQ5384191FDOQ5384191

Authors: Anand Hemmady, Adam Lott, Steven J. Miller 

Publication date: 21 June 2019

Abstract: We investigate the behavior of the sum and difference sets of $AsubseteqmathbbZ/nmathbbZ$ chosen independently and randomly according to a binomial parameter $p(n)=o(1)$. We show that for rapidly decaying $p(n)$, $A$ is almost surely difference-dominated as $noinfty$, but for slowly decaying $p(n)$, $A$ is almost surely balanced as $noinfty$, with a continuous phase transition as $p(n)$ crosses a critical threshold. Specifically, we show that if $p(n)=o(n^{-1/2})$, then $|A-A|/|A+A|$ converges to $2$ almost surely as $noinfty$ and if $p(n)=ccdot{n}^{-1/2}$, then $|A-A|/|A+A|$ converges to $1+exp(-c^2/2)$ almost surely as $noinfty$. In these cases, we modify the arguments of Hegarty and Miller on subsets of $mathbbZ$ to prove our results. When $sqrtlogncdot{n}^{-1/2}=o(p(n))$, we prove that $|A-A|=|A+A|=n$ almost surely as $noinfty$ if some additional restrictions are placed on $n$. In this case, the behavior is drastically different from that of subsets of $mathbbZ$ and new technical issues arise, so a novel approach is needed. When $n^{-1/2}=o(p(n))$ and $p(n)=o(sqrtlogncdot{n}^{-1/2})$, the behavior of $|A+A|$ and $|A-A|$ is markedly different and suggests an avenue for further study. These results establish a "correspondence principle" with the existing results of Hegarty, Miller, and Vissuet. As $p(n)$ decays more rapidly, the behavior of subsets of $mathbbZ/nmathbbZ$ approaches the behavior of subsets of $mathbbZ$ shown by Hegarty and Miller. Moreover, as $p(n)$ decays more slowly, the behavior of subsets of $mathbbZ/nmathbbZ$ approaches the behavior shown by Miller and Vissuet in the case where $p(n)=1/2$.

Full work available at URL: https://arxiv.org/abs/1608.03209

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• When almost all sets are difference dominated
• Sets with more differences than sums
• Many sets have more sums than differences
• On the number of sums and differences
• Most subsets are balanced in finite groups

zbMATH Keywords

difference dominated sets

Mathematics Subject Classification ID

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Sequences (mod (m)) (11B50) Additive bases, including sumsets (11B13) Inverse problems of additive number theory, including sumsets (11P70)

Cites Work

• Fibonacci and Lucas numbers with applications. Volume I
• Title not available (Why is that?)
• On the number of summands in Zeckendorf decompositions
• When almost all sets are difference dominated
• Problems in additive number theory. I
• Many sets have more sums than differences
• Sets characterized by missing sums and differences
• Sets characterized by missing sums and differences in dilating polytopes
• Distribution of Missing Sums in Sumsets
• Title not available (Why is that?)
• Most subsets are balanced in finite groups

Cited In (4)

• Generalizing the distribution of missing sums in sumsets
• When almost all sets are difference dominated
• Distribution of Missing Differences in Diffsets
• Most subsets are balanced in finite groups

This page was built for publication: When almost all sets are difference dominated in \(\mathbb{Z}/n\mathbb{Z}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384191)