About: Restricted sumset     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.org associated with source document(s)
QRcode icon
http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FRestricted_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 .

AttributesValues
rdfs:label
  • Somme restreinte d'ensembles (fr)
  • Restricted sumset (en)
rdfs:comment
  • 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 . (en)
  • En théorie additive des nombres et en combinatoire, une somme restreinte d'ensembles est[réf. souhaitée] un ensemble de la forme où A1, … , An sont des parties d'un groupe abélien G et B est une partie de Gn. Le groupe G considéré est souvent le groupe additif d'un anneau commutatif, comme l'anneau ℤ des entiers ou un anneau ℤ/nℤ. Si l'ensemble B qu'on exclut est vide, S est simplement la somme d'ensembles usuelle A1 + … + An (notée nA si tous les Ak sont égaux à un même ensemble A). Si B est l'ensemble des n-uplets d'éléments non tous distincts, alors S est noté ou encore (fr)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
dbp:wikiPageUsesTemplate
title
  • Erdős-Heilbronn Conjecture (en)
urlname
  • Erdos-HeilbronnConjecture (en)
has abstract
  • En théorie additive des nombres et en combinatoire, une somme restreinte d'ensembles est[réf. souhaitée] un ensemble de la forme où A1, … , An sont des parties d'un groupe abélien G et B est une partie de Gn. Le groupe G considéré est souvent le groupe additif d'un anneau commutatif, comme l'anneau ℤ des entiers ou un anneau ℤ/nℤ. Si l'ensemble B qu'on exclut est vide, S est simplement la somme d'ensembles usuelle A1 + … + An (notée nA si tous les Ak sont égaux à un même ensemble A). Si B est l'ensemble des n-uplets d'éléments non tous distincts, alors S est noté ou encore lorsque tous les Ak sont égaux à A. (fr)
  • 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 . (en)
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
is known for of
is known for of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3331 as of Sep 2 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (62 GB total memory, 44 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software