Restricted sumset
In additive number theory and combinatorics, a restricted sumset has the form where are finite nonempty subsets of a field F and is a polynomial over F. If is a constant non-zero function, for example for any , then S is the usual sumset which is denoted by nA if . When S is written as which is denoted by if . Note that |S| > 0 if and only if there exist with .
known for
Additive combinatoricsBarycentric-sum problemCauchy-Davenport theoremCauchy–Davenport theoremChevalley–Warning theoremCombinatorial NullstellensatzDyson's transformErdos-Heilbronn conjectureErdos–Heilbronn conjectureErdős-Heilbronn conjectureErdős–Heilbronn conjectureHilbert's NullstellensatzKneser's theorem (combinatorics)List of conjectures by Paul ErdősList of number theory topicsNoga AlonOutline of combinatoricsPolynomial method in combinatoricsSumsetSun ZhiweiZero-sum problem
Link from a Wikipage to another Wikipage
known for
primaryTopic
Restricted sumset
In additive number theory and combinatorics, a restricted sumset has the form where are finite nonempty subsets of a field F and is a polynomial over F. If is a constant non-zero function, for example for any , then S is the usual sumset which is denoted by nA if . When S is written as which is denoted by if . Note that |S| > 0 if and only if there exist with .
has abstract
En théorie additive des nombre ...... ue tous les Ak sont égaux à A.
@fr
In additive number theory and ...... and only if there exist with .
@en
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
950,493,875
Link from a Wikipage to another Wikipage
title
Erdős-Heilbronn Conjecture
@en
urlname
Erdos-HeilbronnConjecture
@en
wikiPageUsesTemplate
comment
En théorie additive des nombre ...... ts, alors S est noté ou encore
@fr
In additive number theory and ...... and only if there exist with .
@en
label
Restricted sumset
@en
Somme restreinte d'ensembles
@fr