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