Fetching the paper…
Reading the bibliography…
It is often of interest to identify a given number of points in projective space such that the minimum distance between any two points is as large as possible.
1907
Earlier work this paper cites.
Relation: https://www.rug.nl/ Rights: De Bussy
Tammes, P., On the origin of number and arrangement of the places of exit on the surface of pollen-grains · 1930
Earlier work this paper cites.
Fejes Tóth, L., “On the densest packing of spherical caps,” Amer. Math. Monthly
1949
Earlier work this paper cites.
Fejes Tóth, L., “On the densest packing of spherical caps,” The American Mathematical Monthly
1949
Earlier work this paper cites.
Schütte, K. and Van der Waerden, B., “Auf welcher kugel haben 5, 6, 7, 8 oder 9 punkte mit mindestabstand eins platz?,” Mathematische Annalen
1951
Earlier work this paper cites.
Rankin, R. A., “The closest packing of spherical caps in n n dimensions,” Proc Glasgow Math Assoc
1955
Earlier work this paper cites.
Robinson, R. M., “Arrangement of 24 points on a sphere,” Mathematische Annalen
1961
Earlier work this paper cites.
Fejes Tóth, L., “Distribution of points in the elliptic plane,” Acta Math. Acad. Sci. Hungar
1965
Earlier work this paper cites.
Van Lint, J. H. and Seidel, J. J., “Equilateral point sets in elliptic geometry,” Indagationes Mathematicae, Proc. Koninkl. Ned. Akad. Wetenschap. Ser. A
1966
Earlier work this paper cites.
Delsarte, P., “Bounds for unrestricted codes, by linear programming,” Philips Res. Rep
1972
Earlier work this paper cites.
Lemmens, P. W. H. and Seidel, J. J., “Equiangular lines,” J. Algebra
1973
Earlier work this paper cites.
Delsarte, P., “An algebraic approach to the association schemes of coding theory,” Philips Res. Rep. Suppl
1973
Earlier work this paper cites.
Welch, L., “Lower bounds on the maximum cross correlation of signals,” IEEE Trans Inf Theory
1974
Earlier work this paper cites.
Delsarte, P., Goethals, J. M., and Seidel, J. J., “Spherical codes and designs,” Geometriae Dedicata
1977
Earlier work this paper cites.
Kabatjanskiĭ, G. A. and Levenšteĭn, V. I., “Bounds for packings on the sphere and in space,” Problemy Peredači Informacii
1978
Earlier work this paper cites.
Levenšteĭn, V. I., “Bounds on the maximal cardinality of a code with bounded modules of the inner product,” Soviet Math. Dokl
1982
Earlier work this paper cites.
Danzer, L., “Finite point-sets on S 2 {S}^{2} with minimum distance as large as possible,” Discrete mathematics
1986
Earlier work this paper cites.
Conway, J. H., Hardin, R. H., and Sloane, N. J. A., “Packing lines, planes, etc.: packings in Grassmannian spaces,” Experiment. Math
1996
Earlier work this paper cites.
Rosenfeld, M., “In praise of the Gram matrix,” in [ The mathematics of Paul Erdős, II
1997
Cited alongside, same era.
With additional contributions by E. Bannai, R. E. Borcherds, J. Leech, S. P. Norton, A. M. Odlyzko, R. A. Parker, L. Queen and B. B. Venkov
Conway, J. H. and Sloane, N. J. A., [ Sphere packings, lattices and groups · 1999
Cited alongside, same era.
Strohmer, T. and Heath, Jr., R. W., “Grassmannian frames with applications to coding and communication,” Appl. Comput. Harmon. Anal
2003
Cited alongside, same era.
Renes, J. M., Blume-Kohout, R., Scott, A. J., and Caves, C. M., “Symmetric informationally complete quantum measurements,” J. Math. Phys
2004
Cited alongside, same era.
Klappenecker, A. and Rötteler, M., “Constructions of mutually unbiased bases,” in [ Finite fields and applications
2004
Cited alongside, same era.
Medra, A. and Davidson, T. N., “Flexible codebook design for limited feedback systems via sequential smooth optimization on the Grassmannian manifold,” IEEE Trans. Signal Process
2014
Later among the works it cites.
Szöllősi, F., “All complex equiangular tight frames in dimension 3 3 ,” arXiv:1402.6429 (2014)
2014
Later among the works it cites.
King, E. J., “Algebraic and geometric spread in finite frames,” in [ Wavelets and Sparsity XVI
2015
Later among the works it cites.
de Laat, D. and Vallentin, F., “A semidefinite programming hierarchy for packing problems in discrete geometry,” Math. Program
2015
Later among the works it cites.
Musin, O. R. and Tarasov, A. S., “The Tammes problem for N = 14 {N}=14 ,” Experimental Mathematics
2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Tropp, J. A., Dhillon, I. S., Jr., R. W. H., and Strohmer, T., “Designing structured tight frames via alternating projection,” IEEE Trans. Info. Theory
2005
Cited alongside, same era.
Benedetto, J. J. and Kolesar, J. D., “Geometric properties of Grassmannian frames for ℝ 2 \mathbb{R}^{2} and ℝ 3 \mathbb{R}^{3} ,” EURASIP J. Appl. Signal Process
2006
Cited alongside, same era.
Bodmann, B. G., “Optimal linear transmission by loss-insensitive packet encoding,” Appl. Comput. Harmon. Anal
2007
Cited alongside, same era.
Sustik, M. A., Tropp, J. A., Dhillon, I. S., and Jr, R. W. H., “On the existence of equiangular tight frames,” Linear Algebra Appl
2007
Cited alongside, same era.
Bachoc, C. and Vallentin, F., “New upper bounds for kissing numbers from semidefinite programming,” J. Amer. Math. Soc
2008
Cited alongside, same era.
Musin, O. R., “Spherical two-distance sets,” J. Combin. Theory Ser. A
2009
Cited alongside, same era.
Godsil, C. and Roy, A., “Equiangular lines, mutually unbiased bases, and spin models,” European J. Combin
2009
Cited alongside, same era.
2016
Later among the works it cites.
Bodmann, B. G. and Haas, J., “Achieving the orthoplex bound and constructing weighted complex projective 2-designs with Singer sets,” Linear Algebra Appl
2016
Later among the works it cites.
Fuchs, C. A., Hoang, M. C., and Stacey, B. C., “The SIC question: History and state of play,” Axioms
2017
Later among the works it cites.
Haas IV, J. I. and Casazza, P. G., “On the structures of Grassmannian frames,” in [ 2017 International Conference on Sampling Theory and Applications (SampTA)
2017
Later among the works it cites.
Waldron, S., “A sharpening of the Welch bounds and the existence of real and complex spherical t t -designs,” IEEE Trans. Inform. Theory
2017
Later among the works it cites.
Haas IV, J. I., Hammen, N., and Mixon, D. G., “The Levenstein bound for packings in projective spaces,” in [ Wavelets and Sparsity XVII
2017
Later among the works it cites.
Fickus, M., Jasper, J., and Mixon, D. G., “Packings in real projective spaces,” SIAM J. Appl. Algebra Geom
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
Appleby, M., Chien, T.-Y., Flammia, S., and Waldron, S., “Constructing exact symmetric informationally complete measurements from numerical solutions,” J. Phys. A
2018
Later among the works it cites.
Glazyrin, A., “Moments of isotropic measures and optimal projective codes,” arXiv:1904.11159 (2019)
2019
Closest in time.
To appear
Magsino, M., Mixon, D. G., and Parshall, H., “A Delsarte-style proof of the Bukh–Cox bound,” Sampl. Theory Signal Image Process · 2019
Closest in time.
To appear
Mixon, D. G. and Parshall, H., “Exact line packings from numerical solutions,” Sampl. Theory Signal Image Process · 2019
Closest in time.