arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1502.04027math.MG
收藏

Small subset sums

Gergely Ambrus, Imre Barany, Victor Grinberg

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑