Advanced search

Browse by subject

Browse by provider

Browse by language

Content Details
Normal View
CIP View

Small subset sums

Ambrus, Gergely...

Free

Share this content

Small subset sums by Ambrus, Gergely ( Author )

Content Provider	Lemonjar Open Access
Publisher	N.A
Publication Date	13-02-2015
Summary	Let \|\|.\|\| be a norm in R^d whose unit ball is B. Assume that V\subset B is a finite set of cardinality n, with \sum_{v \in V} v=0. We show that for every integer k with 0 \le k \le n, there exists a subset U of V consisting of k elements such that \\| \sum_{v \in U} v \\| \le \lceil d/2 \rceil. We also prove that this bound is sharp in general. We improve the estimate to O(\sqrt d) for the Euclidean and the max norms. An application on vector sums in the plane is also given.
ISBN	-
Item Type	Article
File Type	pdf
File Size	36.88 KB
Language	English
Subjects	-
Unlimited	MYR 0.01
Total read	-
URL	http://arxiv.org/abs/1502.04027

Citation

Review the full bibliography data and make any necessary corrections before using. Always consult your library resources for the exact formatting and punctuation guidelines.

AMA 11th EditionReferences

Ambrus, Gergely. Small subset sums. N.A. February 13, 2015. Accessed October 02, 2025. https://online.provdatabase.com/cite/18361

APA 7th EditionReferences

Ambrus, Gergely. (2015). Small subset sums. N.A. https://online.provdatabase.com/cite/18361

Chicago 17th EditionReferences

Ambrus, Gergely. Small subset sums. N.A. 2015. https://online.provdatabase.com/cite/18361

HarvardReferences

Ambrus, Gergely. (2015). Small subset sums. [Online]. N.A. Available from: https://online.provdatabase.com/cite/18361. (Accessed 02 October 2025).

Harvard AustraliaReferences

Ambrus, Gergely, 2015, Small subset sums, N.A, viewed 02 October 2025, <https://online.provdatabase.com/cite/18361>

MLA 9th EditionWorks Cited

Ambrus, Gergely. Small subset sums. N.A, 2015. PROV Database, https://online.provdatabase.com/cite/18361.

Share this eBook