Counting MSTD Sets in Finite Abelian Groups

@article{Zhao2010CountingMS,
  title={Counting MSTD Sets in Finite Abelian Groups},
  author={Yufei Zhao},
  journal={Journal of Number Theory},
  year={2010},
  volume={130},
  pages={2308-2322}
}
  • Yufei Zhao
  • Published 2010
  • Mathematics
  • Journal of Number Theory
In an abelian group G, a more sums than dierences (MSTD) set is a subset A G such thatjA +Aj >jA Aj. We provide asymptotics for the number of MSTD sets in nite abelian groups, extending previous results of Nathanson. The proof contains an application of a recently resolved conjecture of Alon and Kahn on the number of independent sets in a regular graph. 

Figures from this paper

On the computational complexity of MSTD sets
When Sets Can and Cannot Have Sum-Dominant Subsets
The Bipartite Swapping Trick on Graph Homomorphisms
  • Yufei Zhao
  • Mathematics, Computer Science
  • SIAM J. Discret. Math.
  • 2011
Most Subsets Are Balanced in Finite Groups
Sum-dominant sets and restricted-sum-dominant sets in finite abelian groups
Entropies of Weighted Sums in Cyclic Groups and an Application to Polar Codes
When Sets Are Not Sum-Dominant
...
1
2
...

References

SHOWING 1-10 OF 26 REFERENCES
SETS WITH MORE SUMS THAN DIFFERENCES
Independent sets in regular graphs and sum-free subsets of finite groups
The Number of Independent Sets in a Regular Graph
  • Yufei Zhao
  • Mathematics, Computer Science
  • Combinatorics, Probability and Computing
  • 2009
Explicit constructions of infinite families of MSTD sets
Some explicit constructions of sets with more sums than differences
Problems in additive number theory, III
An Entropy Approach to the Hard-Core Model on Bipartite Graphs
  • J. Kahn
  • Mathematics, Computer Science
  • Combinatorics, Probability and Computing
  • 2001
The Number of Independent Sets in a Graph with Small Maximum Degree
...
1
2
3
...