OpenAlex ·
An elementary proof of the Komlós conjecture
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.20979
- Original
- Read it at the publisher
- Topics
Abstract
We give an elementary proof of the Komlós conjecture by simplifying the recent proof of Guo, Fang, and Lu. We show that any vectors $v_1,\ldots,v_n\in\mathbb{R}^d$ with $\|v_i\|_2\le1$ admit signs $\varepsilon_i\in\{-1,1\}$ such that $\|\sum_{i=1}^n\varepsilon_i v_i\|_\infty\le36$. The proof uses only elementary combinatorial and probabilistic arguments and basic calculus.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Combinatorics
Spectral Gap of Down-Up Walks via Trickle-Down: A Simplified and Sharpened Analysis
Exponentially Larger Deletion-Correcting Codes and Constant-List-Decodable Insertion-Deletion Codes
Improved Algorithms for Beck--Fiala with Bounded Sets
Induced packing treewidth II. Excluding a clique or a biclique
Sharp spectral norm concentration of sparse random tensors
Get the few papers worth your time in Combinatorics every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.