# 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} }

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.

#### 20 Citations

When Sets Can and Cannot Have Sum-Dominant Subsets

- Mathematics, Computer Science
- J. Integer Seq.
- 2018

The Bipartite Swapping Trick on Graph Homomorphisms

- Mathematics, Computer Science
- SIAM J. Discret. Math.
- 2011

Entropies of Weighted Sums in Cyclic Groups and an Application to Polar Codes

- Mathematics, Computer Science
- Entropy
- 2017

#### References

SHOWING 1-10 OF 26 REFERENCES

The Number of Independent Sets in a Regular Graph

- Mathematics, Computer Science
- Combinatorics, Probability and Computing
- 2009

An Entropy Approach to the Hard-Core Model on Bipartite Graphs

- Mathematics, Computer Science
- Combinatorics, Probability and Computing
- 2001

The Number of Independent Sets in a Graph with Small Maximum Degree

- Mathematics, Computer Science
- Graphs Comb.
- 2011