• In additive number theory and combinatorics, a restricted sumset has the form S = { a 1 + ⋯ + a n :   a 1 ∈ A 1 , … , a n ∈ A n   a n d   P ( a 1 , …...
    8 KB (1,309 words) - 06:13, 12 January 2024
  • size of A {\displaystyle A} ); see for example Freiman's theorem. Restricted sumset Sidon set Sum-free set Schnirelmann density Shapley–Folkman lemma...
    3 KB (370 words) - 20:29, 27 October 2024
  • Examples of this type include the Erdős–Heilbronn Conjecture (for a restricted sumset) and the Cauchy–Davenport Theorem. The methods used for tackling such...
    5 KB (762 words) - 00:56, 6 April 2025
  • topics of Paul Erdős in combinatorial number theory: covering systems, restricted sumsets, and zero-sum problems or EGZ Theorem. With Stephen Redmond, he posed...
    3 KB (290 words) - 08:55, 10 June 2024
  • Arithmetic combinatorics (category Sumsets)
    Schnirelmann density Shapley–Folkman lemma Sidon set Sum-free set Restricted sumset Sum-product phenomenon Green, Ben (July 2009). "Book Reviews: Additive...
    9 KB (956 words) - 14:37, 1 February 2025
  • Erdős–Szemerédi theorem (category Sumsets)
    The set of pairwise sums is A + A = {a + b : a,b ∈ A} and is called the sumset of A. The set of pairwise products is A · A = {a · b : a,b ∈ A} and is called...
    27 KB (2,727 words) - 20:49, 27 March 2025
  • Typical topics include covering system, zero-sum problems, various restricted sumsets, and arithmetic progressions in a set of integers. Algebraic or analytic...
    6 KB (909 words) - 02:08, 12 May 2025
  • PlanetMath Erdős, Ginzburg, Ziv Theorem Sun, Zhi-Wei, "Covering Systems, Restricted Sumsets, Zero-sum Problems and their Unification" Zero-sum problems - A survey...
    5 KB (542 words) - 02:07, 12 May 2025
  • nonempty subsets of the set N {\displaystyle N} of nonnegative integers. The sumset A + B {\displaystyle A+B} is defined by A + B = { a + b : a ∈ A , b ∈ B...
    7 KB (1,092 words) - 01:39, 26 May 2025
  • also concerns sumsets in groups but is restricted to groups whose order is a prime number. The first three statements deal with sumsets whose size (in...
    7 KB (1,067 words) - 18:23, 9 April 2021
  • Thumbnail for X + Y sorting
    problem sorts the sumset, the set of sums of pairs, with duplicate sums condensed to a single value. For this variant, the size of the sumset may be significantly...
    20 KB (3,224 words) - 21:45, 10 June 2024