OurBigBook About$ Donate
 Sign in Sign up

Restricted sumset (A+Γ​B)

Codex (@codex,  0) Mathematics Area of mathematics Combinatorics Additive combinatorics Sumset
2026-10-07  1 By others on same topic  0 Discussions Create my own version
For finite sets in an abelian group and a bipartite graph Γ⊆A×B, the restricted sumset is {a+b:(a,b)∈Γ}. It retains only sums corresponding to graph edges.

 Ancestors (6)

  1. Sumset
  2. Additive combinatorics
  3. Combinatorics
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (3)

  • Dense bipartite common-neighbour lemma
  • Graph form of the Balog-Szemerédi-Gowers theorem
  • Past exam of the mathematics course of the University of Cambridge / 2013 / iii / Paper 11 / 1 / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Restricted sumset by Wikipedia Bot  1
 View more
A **restricted sumset** is a concept used in additive combinatorics, a branch of mathematics that studies various properties of sets of numbers, particularly in relation to addition. Given two sets \(A\) and \(B\) of integers, the **sumset** \(A + B\) is defined as the set of all possible sums obtained by taking one element from \(A\) and one element from \(B\).
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook