Translative covering densities of order n log n
There are absolute constants and such that, for every integer , some centrally symmetric convex body satisfies .
The proof is complete and rigorous. All constants are chosen in a valid dependency order independent of dimension, and the union bound over the deterministic finite pattern class F_n successfully excludes all periodic coverings simultaneously.
“Theorem 1.1. There are absolute constants c > 0 and n0 such that, for every integer n ≥ n0, some centrally symmetric convex body Kn ⊂ R^n satisfies θT (Kn) > cn log n.” · Show in paper