Greedy vector balancing on finite unit-vector sets T in R^d achieves norm bound (2/δ_T)^{d-1} independent of sequence length n.
Broder and Moses Charikar and Alan M
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Pairwise reflection symmetry exists in generalized Latin rectangles for λ=1 if and only if n is a power of two, with constructions for sufficiently large odd λ and computational searches revealing group structure.
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.
-
Pairwise Reflection Symmetry in Generalized Latin Rectangles
Pairwise reflection symmetry exists in generalized Latin rectangles for λ=1 if and only if n is a power of two, with constructions for sufficiently large odd λ and computational searches revealing group structure.