Counting MSTD sets in finite abelian groups
From MaRDI portal
Publication:708268
DOI10.1016/j.jnt.2010.06.001zbMath1261.11012arXiv0911.2288MaRDI 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
11B75: Other combinatorial number theory
05A16: Asymptotic enumeration
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
11B13: Additive bases, including sumsets
11B39: Fibonacci and Lucas numbers and polynomials and generalizations
Related Items
Fringe pairs in generalized MSTD sets, When Sets Can and Cannot Have MSTD Subsets, Sets of Cardinality 6 Are Not Sum-dominant, Sets characterized by missing sums and differences, Constructing MSTD sets using bidirectional ballot sequences, On sets with more products than quotients, Sum-dominant sets and restricted-sum-dominant sets in finite abelian groups
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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