A Delsarte-Style Proof of the Bukh-Cox Bound

by   Mark Magsino, et al.

The line packing problem is concerned with the optimal packing of points in real or complex projective space so that the minimum distance between points is maximized. Until recently, all bounds on optimal line packings were known to be derivable from Delsarte's linear program. Last year, Bukh and Cox introduced a new bound for the line packing problem using completely different techniques. In this paper, we use ideas from the Bukh--Cox proof to find a new proof of the Welch bound, and then we use ideas from Delsarte's linear program to find a new proof of the Bukh--Cox bound. Hopefully, these unifying principles will lead to further refinements.


page 1

page 2

page 3

page 4


A lower bound for online rectangle packing

We slightly improve the known lower bound on the asymptotic competitive ...

Exact Line Packings from Numerical Solutions

Recent progress in Zauner's conjecture has leveraged deep conjectures in...

An improved exact algorithm and an NP-completeness proof for sparse matrix bipartitioning

We formulate the sparse matrix bipartitioning problem of minimizing the ...

Revisiting zero-rate bounds on the reliability function of discrete memoryless channels

We present a new proof of Berlekamp's zero-rate upper bound on the relia...

The optimal packing of eight points in the real projective plane

How can we arrange n lines through the origin in three-dimensional Eucli...

An explicit analysis of the entropic penalty in linear programming

Solving linear programs by using entropic penalization has recently attr...

Algorithms to Approximate Column-Sparse Packing Problems

Column-sparse packing problems arise in several contexts in both determi...

Please sign up or login with your details

Forgot password? Click here to reset