Counting MSTD sets in finite abelian groups
From MaRDI portal
Publication:708268
DOI10.1016/j.jnt.2010.06.001zbMath1261.11012arXiv0911.2288OpenAlexW2138081888MaRDI QIDQ708268
Publication date: 11 October 2010
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.2288
Other combinatorial number theory (11B75) Asymptotic enumeration (05A16) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Additive bases, including sumsets (11B13) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Related Items (7)
Sets of Cardinality 6 Are Not Sum-dominant ⋮ Sum-dominant sets and restricted-sum-dominant sets in finite abelian groups ⋮ On sets with more products than quotients ⋮ Fringe pairs in generalized MSTD sets ⋮ Sets characterized by missing sums and differences ⋮ When Sets Can and Cannot Have MSTD Subsets ⋮ Constructing MSTD sets using bidirectional ballot sequences
Cites Work
- The number of independent sets in a graph with small maximum degree
- Constructing MSTD sets using bidirectional ballot sequences
- Explicit constructions of infinite families of MSTD sets
- Independent sets in regular graphs and sum-free subsets of finite groups
- On the number of sums and differences
- Additive completion and disjoint translations
- An Entropy Approach to the Hard-Core Model on Bipartite Graphs
- When almost all sets are difference dominated
- The Number of Independent Sets in a Regular Graph
- On A Conjecture of Conway
- A mean value density theorem of additive number theory
- Some explicit constructions of sets with more sums than differences
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Counting MSTD sets in finite abelian groups