97
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

The Optimal Packing of Eight Points in the Real Projective Plane

&

References

  • [Bandeira 13] A. S. Bandeira, M. Fickus, D. G. Mixon, and P. Wong. “The Road to Deterministic Matrices with the Restricted Isometry Property.” J. Fourier Anal. Appl. 19:6 (2013), 1123–1149.
  • [Böröczky 03] K. Böröczky and L. Szabó. “Arrangements of 13 Points on a Sphere.” In Discrete Geometry, vol. 253, edited by A. Bezdek, pp. 111–184, Monogr. Textbooks Pure Appl. Math. New York: Dekker, 2003.
  • [Boyd 04] S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge: Cambridge University Press, pp. xiv+716, 2004.
  • [Boyer 04] J. M. Boyer and W. J. Myrvold. “On the Cutting Edge: Simplified O(n) Planarity by Edge Addition.” J. Graph Algorithms Appl. 8:3 (2004), 241–273.
  • [Cohn 12] H. Cohn and J. Woo. “Three-Point Bounds for Energy Minimization.” J. Amer. Math. Soc. 25:4 (2012), 929–958.
  • [Collins 75] G. E. Collins. “Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition.” Lecture Notes Comput. Sci. 33 (1975), 134–183.
  • [Conway 96] J. H. Conway, R. H. Hardin, and N. J. A. Sloane. “Packing Lines, Planes, etc.: Packings in Grassmannian Spaces.” Experiment. Math. 5:2 (1996), 139–159.
  • [Danzer 86] L. Danzer. “Finite Point-Sets on S2 with Minimum Distance as Large as Possible.” Discrete Math. 60 (1986), 3–66.
  • [Delsarte 75] P. Delsarte, J. Goethals, and J. Seidel. “Bounds for Systems of Lines and Jacobi polynomials.” Philips Res. Rep. 30 (1975), 91–105.
  • [Di Battista 89] G. Di Battista and R. Tamassia. “Incremental Planarity Testing”. Paper presented at the 30th Annual Symposium Foundations of Computer Science, IEEE, Research Triangle Park, NC, USA, October 30–November 1, 1989, pp. 436–441.
  • [Di Battista 96] G. Di Battista and R. Tamassia. “On-Line Planarity Testing.” SIAM J. Comput. 25:5 (1996), 956–997.
  • [Fejes Tóth 49] L. Fejes Tóth. “On the Densest Packing of Spherical Caps.” Amer. Math. Monthly. 56 (1949), 330–331.
  • [Fejes Tóth 64] L. Fejes Tóth. Regular Figures. New York: A Pergamon Press Book/The Macmillan Co., 1964, pp. xi+339.
  • [Fejes Tóth 65] L. Fejes Tóth. “Distribution of Points in the Elliptic Plane.” Acta Math. Acad. Sci. Hungar. 16 (1965), 437–440.
  • [Fickus 18] M. Fickus, J. Jasper, and D. G. Mixon. “Packings in Real Projective Spaces.” SIAM J. Appl. Algebra Geom. 2:3 (2018), 377–409.
  • [Gutwenger 10] C. Gutwenger. “Application of SPQR-Trees in the Planarization Approach for Drawing Graphs.” PhD thesis., Dortmund University of Technology, 2010.
  • [Hopcroft 74] J. Hopcroft and R. Tarjan. “Efficient Planarity Testing.” J. ACM. 21:4 (1974), 549–568.
  • [Levenshtein 82] V. I. Levenshtein. “Bounds of the Maximal Capacity of a Code with a Limited Scalar Product Modulus.” Dokl. Akad. Nauk SSSR. 263:6 (1982), 1303–1308.
  • [Mac Lane 37] S. Mac Lane. “A Structural Characterization of Planar Combinatorial Graphs.” Duke Math. J. 3:3 (1937), 460–472.
  • [McKay 14] B. D. McKay and A. Piperno. “Practical Graph Isomorphism, II.” J. Symbolic Comput. 60 (2014), 94–112.
  • [Mixon 19] D. G. Mixon and H. Parshall. “Exact Line Packings from Numerical Solutions.” To Appear in Proceedings of SampTA 2019, arXiv:1902.00552, 2019. Available at https://arxiv.org/abs/1902.00552
  • [Mixon 13] D. G. Mixon, C. J. Quinn, N. Kiyavash, and M. Fickus. “Fingerprinting with Equiangular Tight Frames.” IEEE Trans. Inform. Theory. 59:3 (2013), 1855–1865.
  • [Musin 12] O. R. Musin and A. S. Tarasov. “The Strong Thirteen Spheres Problem.” Discrete Comput. Geom. 48:1 (2012), 128–141.
  • [Musin 15a] O. R. Musin and A. S. Tarasov. “Extremal Problems of Circle Packings on a Sphere and Irreducible Contact Graphs.” Proc. Steklov Inst. Math. 288:1 (2015a), 117–131. Translation of Tr. Mat. Inst. Steklova 288 (2015), 133–148,
  • [Musin 15b] O. R. Musin and A. S. Tarasov. “The Tammes Problem for N = 14.” Exp. Math. 24:4 (2015b), 460–468.
  • [Renes 04] J. M. Renes, R. Blume-Kohout, A. J. Scott, and C. M. Caves. “Symmetric Informationally Complete Quantum Measurements.” J. Math. Phys. 45:6 (2004), 2171–2180.
  • [Robinson 61] R. M. Robinson. “Arrangements of 24 Points on a Sphere.” Math. Ann. 144:1 (1961), 17–48.
  • [The Sage Developers 18] The Sage Developers. “SageMath, the Sage Mathematics Software System.” Version 8.3. Available at https://www.sagemath.org, 2018.
  • [Schütte 51] K. Schütte and B. L. van der Waerden. “Auf welcher Kugel haben 5, 6, 7, 8 oder 9 Punkte mit Mindestabstand Eins Platz?” Math. Ann. 123:1 (1951), 96–124.
  • [Strohmer 03] T. Strohmer and R. W. Heath. Jr.“Grassmannian Frames with Applications to Coding and Communication.” Appl. Comput. Harmon. Anal. 14:3 (2003), 257–275.
  • [Sulanke 17] T. Sulanke. “Generating Maps on Surfaces.” Discrete Comput. Geom. 57:2 (2017), 335–356.
  • [Tammes 30] 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. 27:1 (1930), 1–84.
  • [van der Waerden 52] B. L. van der Waerden. “Punkte auf der Kugel. Drei Zusätze.” Math. Ann. 125:1 (1952), 213–222.
  • [Welch 74] L. Welch. “Lower Bounds on the Maximum Cross Correlation of Signals (Corresp.).” IEEE Trans. Inform. Theory. 20:3 (1974), 397–399.
  • [Whitney 33] H. Whitney. “A Set of Topological Invariants for Graphs.” Amer. J. Math. 55:1/4 (1933), 231–235.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.