Greedy vector balancing on finite unit-vector sets T in R^d achieves norm bound (2/δ_T)^{d-1} independent of sequence length n.
Discrepancy in arithmetic progressions
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Proves that sum of Steinhaus random multiplicative function over A converges to CN(0,1) only if |A|=o(N), with sharpness for most sets of density ρ where (1-ρ)^{-1}=o((log log N)^{1/2}).
citing papers explorer
-
Greedy Vector Balancing
Greedy vector balancing on finite unit-vector sets T in R^d achieves norm bound (2/δ_T)^{d-1} independent of sequence length n.
-
Escaping Chaos in Random Multiplicative Functions
Proves that sum of Steinhaus random multiplicative function over A converges to CN(0,1) only if |A|=o(N), with sharpness for most sets of density ρ where (1-ρ)^{-1}=o((log log N)^{1/2}).