Optimal representations by sumsets and subset sums (Q676285): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jnth.1997.2012 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1980163873 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jnth.1997.2012 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1980163873 / rank | |||
Normal rank | |||
Revision as of 17:29, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal representations by sumsets and subset sums |
scientific article |
Statements
Optimal representations by sumsets and subset sums (English)
0 references
19 August 1997
0 references
Let \(A\) be a set of non-negative integers; then the cardinality of \(hA\), \(h\geq 2\) and integral, is estimated from below giving an application in connection with the Frobenius problem. Furthermore, it is shown that \(hA\) always contains chains of consecutive integers with a certain length. This leads to an estimation for the number of summands required in a representation of an integer by a sum of elements of \(A\).
0 references
sumsets
0 references
Frobenius problem
0 references
chains of consecutive integers
0 references
representation of an integer
0 references
