The number of distinct subset sums of a finite set of vectors (Q1801789): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3852212 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3856819 / rank | |||
Normal rank |
Latest revision as of 17:26, 17 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The number of distinct subset sums of a finite set of vectors |
scientific article |
Statements
The number of distinct subset sums of a finite set of vectors (English)
0 references
17 November 1993
0 references
For a finite subset \(A\) in the \(\rho\)-dimensional real linear space, let \(\sigma(A)\) denote the number of distinct sums that can be obtained of \(A\). Let \(s_ \rho(n)\) denote the minimum cardinality of \(\sigma(A)\) over all sets \(A\) of \(n\) nonnegative nonzero vectors that span the \(\sigma\)-dimensional space. The authors prove that for \(n-\rho\) large enough, \(s_ \rho(n)=2^{\rho-2}((n-\rho)^ 2+3(n-\rho)+4)\).
0 references
sums of vectors
0 references