Exact and Asymptotic Counts of MSTD, MDTS, and Balanced Sets in Dicyclic Groups
Sagar Mandal, Neetu

TL;DR
This paper provides exact and asymptotic counts of subsets with more sums than differences, more differences than sums, and balanced sets in Dicyclic groups, revealing their relationships and growth patterns.
Contribution
It determines exact counts for small subset sizes and asymptotic relationships for larger sizes in Dicyclic groups, including dependence on divisibility properties.
Findings
Exact counts for subsets of size two.
Asymptotic equality of MSTD and balanced subsets of size two.
Ratio of MSTD to MDTS subsets of size three for odd n.
Abstract
We investigate the relationship between the sizes of the sum and difference sets of the Dicyclic Group . We first determine the exact numbers of MSTD (more sums than differences), MDTS (more differences than sums), and balanced subsets of size two. As a consequence, we show that the numbers of MSTD and balanced subsets of size two are asymptotically equal as . For odd , we then obtain exact counts of MSTD, MDTS, and balanced subsets of size three, with the results depending on whether is divisible by . In this case, we establish that asymptotically the number of MSTD subsets of size three is six times the number of MDTS subsets and also six times the number of balanced subsets. Finally, we establish a lower bound for the number of MSTD, MDTS, and balanced subsets of corresponding to the boundary case of size .
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
Topicsgraph theory and CDMA systems · Limits and Structures in Graph Theory · Finite Group Theory Research
