Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with sidon-sets
Search options answers only
not deleted
user 171662
4
votes
Size of sets with complete double
Short answer: Such a set $S$ is known as a restricted additive basis.
As observed in comments, the general term to search for is [finite]
additive basis: a finite set $S \subset \mathbb{N}$ such that …
- 4,219
1
vote
$B_k[1]$ sets with smallest possible $m = \max B_k[1]$ for given $k$ and $n = \lvert B_k[1]\...
Since the question asks for exact smallest values, not bounds or asymptotics, it is likely to be a difficult problem.
First note that instead of taking sums of at most $k$ elements, we can take sums o …
- 4,219