Packing Lines, Planes, etc.: Packings in Grassmannian Space
| dc.creator | Conway, J. H. | |
| dc.creator | Hardin, R. H. | |
| dc.creator | Sloane, N. J. A. | |
| dc.date | 2002-08-01 | |
| dc.date.accessioned | 2026-07-07T04:49:59Z | |
| dc.date.available | 2026-07-07T04:49:59Z | |
| dc.description | This paper addresses the question: how should N n-dimensional subspaces of m-dimensional Euclidean space be arranged so that they are as far apart as possible? The results 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-1)(m+2)/2, which provides a (usually) lower-dimensional representation than the Pluecker embedding, and leads to a proof that many of the new packings are optimal. The results have applications to the graphical display of multi-dimensional data via Asimov's "Grand Tour" method. | |
| dc.description | 36 pages, 15 figures | |
| dc.identifier | https://arxiv.org/abs/math/0208004 | |
| dc.identifier | http://arxiv.org/abs/math/0208004 | |
| dc.identifier | Experimental Mathematics, 5 (1996), 139-159 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/64638 | |
| dc.subject | Combinatorics | |
| dc.subject | 51E15, 52C17 (51E23, 65Y25) | |
| dc.title | Packing Lines, Planes, etc.: Packings in Grassmannian Space | |
| dc.type | text |