Counting sumsets and sum-free sets modulo a prime
From MaRDI portal
Publication:3023568
DOI10.1556/SScMath.41.2004.3.2zbMath1064.11020OpenAlexW2003786943MaRDI QIDQ3023568
Publication date: 5 July 2005
Full work available at URL: https://doi.org/10.1556/sscmath.41.2004.3.2
Additive bases, including sumsets (11B13) Inverse problems of additive number theory, including sumsets (11P70)
Related Items (15)
The number of sumsets in abelian group ⋮ Sum-free sets in abelian groups ⋮ Online containers for hypergraphs, with applications to linear equations ⋮ Counting sumsets and differences in an abelian group ⋮ On the maximum number of integer colourings with forbidden monochromatic sums ⋮ The number of maximal sum-free subsets of integers ⋮ Expansion for cubes in the Heisenberg group ⋮ Estimates of the number of \((k,l)\)-sumsets in the finite abelian group ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Counting sets with small sumset and applications ⋮ Asymptotics for the logarithm of the number of \((k,l)\)-sum-free sets in groups of prime order ⋮ Random sum-free subsets of abelian groups ⋮ Symmetric complete sum-free sets in cyclic groups ⋮ The Number of k-Sumsets in an Abelian Group ⋮ Counting independent sets in graphs
This page was built for publication: Counting sumsets and sum-free sets modulo a prime
