Lesson plan

restricted sumset

In additive number theory and combinatorics, a restricted sumset has the form : S=\{a_1+\cdots+a_n:\ a_1\in A_1,\ldots,a_n\in A_n \ \mathrm{and}\ P(a_1,\ldots,a_n)\not=0\}, where A_1,\ldots,A_n are finite nonempty subsets of a field F and P(x_1,\ldots,x_n) is a polynomial over F. If P is a constant non-zero function, for example P(x_1,\ldots,x_n)=1 for any x_1,\ldots,x_n , then S is the usual sumset A_1+\cdots+A_n which is denoted by nA if A_1=\cdots=A_n=A. When : P(x_1,\ldots,x_n) = \prod_{1 \le i S is written as A_1\dotplus\cdots\dotplus A_n which is denoted by n^{\wedge} A if A_1=\cdots=A_n=A. Note that |S| > 0 if and only if there exist a_1\in A_1,\ldots,a_n\in A_n with P(a_1,\ldots,a_n)\not=0.

Back to article

Article summary

In additive number theory and combinatorics, a restricted sumset has the form : S=\{a_1+\cdots+a_n:\ a_1\in A_1,\ldots,a_n\in A_n \ \mathrm{and}\ P(a_1,\ldots,a_n)\not=0\}, where A_1,\ldots,A_n are finite nonempty subsets of a field F and P(x_1,\ldots,x_n) is a polynomial over F. If P is a constant non-zero function, for example P(x_1,\ldots,x_n)=1 for any x_1,\ldots,x_n , then S is the usual sumset A_1+\cdots+A_n which is denoted by nA if A_1=\cdots=A_n=A. When : P(x_1,\ldots,x_n) = \prod_{1 \le i S is written as A_1\dotplus\cdots\dotplus A_n which is denoted by n^{\wedge} A if A_1=\cdots=A_n=A. Note that |S| > 0 if and only if there exist a_1\in A_1,\ldots,a_n\in A_n with P(a_1,\ldots,a_n)\not=0.

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.