arXiv:0911.2288 [math.CO]AbstractReferencesReviewsResources
Counting MSTD Sets in Finite Abelian Groups
Published 2009-11-12, updated 2010-08-08Version 2
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.
Comments: 17 pages
Journal: Journal of Number Theory. Volume 130, Issue 10, October 2010, Pages 2308-2322
Keywords: finite abelian groups, counting mstd sets, independent sets, proof contains, regular graph
Tags: journal article
Related articles: Most relevant | Search more
arXiv:1206.3211 [math.CO] (Published 2012-06-14)
Matchings and Independent Sets of a Fixed Size in Regular Graphs
arXiv:0909.3354 [math.CO] (Published 2009-09-18)
The Number of Independent Sets in a Regular Graph
arXiv:1702.00807 [math.CO] (Published 2017-02-02)
Zero-sum invariants of finite abelian groups