Restricted sumset
id:
restricted-sumset-248-13911811
title:
Restricted sumset
text:
In additive number theory and combinatorics, a restricted sumset has the form where A 1 , … , A n are finite nonempty subsets of a field F and P is a polynomial over F. If P is a constant non-zero function, for example P = 1 for any x 1 , … , x n , then S is the usual sumset A 1 + ⋯ + A n which is denoted by n A if A 1 = ⋯ = A n = A . When S is written as A 1 ∔ ⋯ ∔ A n which is denoted by n ∧ A if A 1 = ⋯ = A n = A . Note that |S| > 0 if and only if there exist a 1 ∈ A 1 , … , a n ∈ A n with P ≠
brand slug:
wiki
category slug:
encyclopedia
description:
Sumset of a field subject to a specific polynomial restriction
original url:
https://en.wikipedia.org/wiki/Restricted_sumset
date created:
date modified:
2024-01-12T06:13:40Z
main entity:
{"identifier":"Q859107","url":"https://www.wikidata.org/entity/Q859107"}
image:
fields total:
13
integrity:
14