Counting MSTD Sets in Finite Abelian Groups
Combinatorics
2015-10-26 v2 Number Theory
Abstract
In an abelian group G, a more sums than differences (MSTD) set is a subset A of G such that |A+A|>|A-A|. We provide asymptotics for the number of MSTD sets in finite 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.
Cite
@article{arxiv.0911.2288,
title = {Counting MSTD Sets in Finite Abelian Groups},
author = {Yufei Zhao},
journal= {arXiv preprint arXiv:0911.2288},
year = {2015}
}
Comments
17 pages