Fetching the paper…
Reading the bibliography…
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.
P. M. L. Tammes, “On the origin of number and arrangement of the places of exit on the surface of pollen-grains,” Recueil des travaux botaniques néerlandais , vol. 27, no. 1, pp. 1–84, 1930
1930
Earlier work this paper cites.
L. Tóth, “Distribution of points in the elliptic plane,” Acta Mathematica Hungarica , vol. 16, no. 3-4, pp. 437–440, 1965
1965
Earlier work this paper cites.
P. Delsarte, J. Goethals, and J. Seidel, “Bounds for systems of lines, and Jacobi polynomials,” in Geometry and Combinatorics . Elsevier, 1991, pp. 193–207
1991
Earlier work this paper cites.
J. H. Conway, R. H. Hardin, and N. J. Sloane, “Packing lines, planes, etc.: Packings in Grassmannian spaces,” Experimental mathematics , vol. 5, no. 2, pp. 139–159, 1996
1996
Earlier work this paper cites.
T. Strohmer and R. W. Heath Jr, “Grassmannian frames with applications to coding and communication,” Applied and computational harmonic analysis , vol. 14, no. 3, pp. 257–275, 2003
2003
Earlier work this paper cites.
J. M. Renes, R. Blume-Kohout, A. J. Scott, and C. M. Caves, “Symmetric informationally complete quantum measurements,” Journal of Mathematical Physics , vol. 45, no. 6, pp. 2171–2180, 2004
2004
Cited alongside, same era.
2011
Cited alongside, same era.
A. S. Bandeira, M. Fickus, D. G. Mixon, and P. Wong, “The road to deterministic matrices with the restricted isometry property,” Journal of Fourier Analysis and Applications , vol. 19, no. 6, pp. 1123–1149, 2013
2013
Cited alongside, same era.
D. G. Mixon, C. J. Quinn, N. Kiyavash, and M. Fickus, “Fingerprinting with equiangular tight frames,” IEEE Transactions on Information Theory , vol. 59, no. 3, pp. 1855–1865, 2013
2013
Cited alongside, same era.
2014
Later among the works it cites.
2015
Later among the works it cites.
D. de Laat and F. Vallentin, “A semidefinite programming hierarchy for packing problems in discrete geometry,” Mathematical Programming , vol. 151, no. 2, pp. 529–553, 2015
2015
Later among the works it cites.
J. I. Haas, N. Hammen, and D. G. Mixon, “The Levenstein bound for packings in projective spaces,” in Wavelets and Sparsity XVII , vol. 10394. International Society for Optics and Photonics, 2017, p. 103940V
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
P. G. Casazza, M. Fickus, D. G. Mixon, J. Peterson, and I. Smalyanau, “Every Hilbert space frame has a Naimark complement,” Journal of Mathematical Analysis and Applications , vol. 406, no. 1, pp. 111–119, 2013
2013
Cited alongside, same era.
N. J. A. Sloane, “Packings in Grassmannian spaces,” http://neilsloane.com/grass/
Cited in the paper.
2018
Later among the works it cites.