Editors' Note on Packing Lines, Planes, etc.: Packings in Grassmannian Spaces

  title={Editors' Note on Packing Lines, Planes, etc.: Packings in Grassmannian Spaces},
  author={John H. Conway and Ronald H. Hardin and N. J. A. Sloane},
  journal={Exp. Math.},
We addressthe question: How should N n-dimensional subspaces of m-dimensional Euclidean space be arranged so that they are as far apart as possible? The resuIts of extensive computations for modest values of N, n, m are described, as well as a reformulation of the problem that was suggested by these computations. The reformulation gives a way to describe n-dimensional subspaces of m-space as points on a sphere in dimension ½(m–l)(m+2), which provides a (usually) lowerdimensional representation… 

Combinatorial constructions of packings in Grassmannian spaces

This paper gives a general construction of equiangular lines, and gives three constructions of optimal packings in Grassmannian spaces based on difference sets and Latin squares, and obtains many new classes of optimal Grassmanian packings.

Packing Planes in Four Dimensions and Other Mysteries

An embedding theorem is shown which shows that a packing in Grassmannian space G(m,n) is a subset of a sphere in R^D, where D = (m+2)(m-1)/2, and leads to a proof that many of the authors' packings are optimal.

The Optimal Packing of Eight Points in the Real Projective Plane

The contact graph of the putatively optimal numerical packing of Conway, Hardin and Sloane is the only graph that survives, and from this graph an exact expression for the minimum distance of eight optimally packed points in the real projective plane is recovered.

Game of Sloanes: best known packings in complex projective space

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. Such configurations yield


This report presents a numerical method for finding good packings on spheres, in projective spaces, and in Grassmannian manifolds equipped with various metrics. In each case, producing a good packing

Packings in real projective spaces

A computer-assisted proof of the optimality of a particular 6-packing in $\mathbb{R}\mathbf{P}^3$, a linear-time constant-factor approximation algorithm for packing in the so-called Gerzon range, and local optimality certificates for two infinite families of packings are provided.

A Notion of Optimal Packings of Subspaces with Mixed-Rank and Solutions

We resolve a longstanding open problem by reformulating the Grassmannian fusion frames to the case of mixed dimensions and show that this satisfies the proper properties for the problem. In order to

Constructing Packings in Grassmannian Manifolds via Alternating Projection

The alternating projection method can be used to produce packings of subspaces in real and complex Grassmannian spaces equipped with the Fubini–Study distance and can prove that some of the novel configurations constructed by the algorithm have packing diameters that are nearly optimal.

Volume of Metric Balls in High-Dimensional Complex Grassmann Manifolds

The volume of balls in complex Grassmann manifolds is evaluated for an arbitrary radius and the obtained asymptotic volume is refined using moment-matching techniques to provide a tighter approximation in finite-size regimes.



Improved packing of equal circles on a sphere and rigidity of its graph

  • T. TarnaiZ. Gáspár
  • Mathematics
    Mathematical Proceedings of the Cambridge Philosophical Society
  • 1983
Abstract How must n equal non-overlapping circles be packed on a sphere so that the angular diameter of the circles will be as great as possible? In the paper, the conjectured solutions of this

Sphere Packings, Lattices and Groups

The second edition of this book continues to pursue the question: what is the most efficient way to pack a large number of equal spheres in n-dimensional Euclidean space? The authors also continue to

Sphere packings, I

  • T. Hales
  • Physics, Mathematics
    Discret. Comput. Geom.
  • 1997
A program to prove the Kepler conjecture on sphere packings is described and it is shown that every Delaunay star that satisfies a certain regularity condition satisfies the conjecture.

The Cell Structures of Certain Lattices

The most important lattices in Euclidean space of dimension n≤ 8 are the lattices An (n≥ 2), Dn (n≥ 4), En (n = 6, 7, 8) and their duals. In this paper we determine the cell structures of all these

Discrete Non-Euclidean Geometry

Hadamard matrices, Sequences, and Block Designs

One hundred years ago, in 1893, Jacques Hadamard [31] found square matrices of orders 12 and 20, with entries ±1, which had all their rows (and columns) pairwise orthogonal. These matrices, X =

Finding Cuts in the TSP (A preliminary report)

TSPLIB is Gerhard Reinelt''s library of some hundred instances of the traveling salesman problem. Some of these instances arise from drilling holes in printed circuit boards; others arise from X-ray