Skip to content

Update constant 24a #60

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
andrew-yoo wants to merge 1 commit into
base: main
Choose a base branch
from
+2 −2
Open

Update constant 24a #60

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions constants/24a.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -31,7 +31,7 @@ Since it is not known whether $C_{24}$ is finite, results are typically stated a

| Bound | Reference | Comments |
| ----- | --------- | -------- |
| $n$ | Trivial | Since $\|\|A_{\ast j}\|\|_{2}\le 1$ implies $\lvert a_{ij}\rvert\le 1$, we have $\|\|Ax\|\|_{\infty}\le n$ for every $x\in\{-1,1\}^{n}$. |
| $n$ | Trivial | Since $\|\|A\_{\ast j}\|\|\_{2}\le 1$ implies $\lvert a_{ij}\rvert\le 1$, we have $\|\|Ax\|\|_{\infty}\le n$ for every $x\in\{-1,1\}^{n}$. |
| $O(\log n)$ | [Bec1981], [Spe1985], [Glu1989] | Partial-coloring/entropy-method bounds yield $O(\log n)$ discrepancy for Komlós-type instances. |
| $O(\sqrt{\log n})$ | [Ban1998] | Banaszczyk’s vector-balancing theorem (via Gaussian measure) gives the first $o(\log n)$ bound. |
| $O(\sqrt{\log n})$ (poly-time) | [BDG2019] | Polynomial-time algorithm matching Banaszczyk’s existential bound up to constants. |
Expand Down Expand Up @@ -72,4 +72,4 @@ Since it is not known whether $C_{24}$ is finite, results are typically stated a

# Acknowledgements

Prepared with assistance from ChatGPT 5.2 Pro.
Prepared with assistance from ChatGPT 5.2 Pro.