Packing Planes in Four Dimensions and Other Mysteries

dc.creatorSloane, N. J. A.
dc.date2002-08-02
dc.date.accessioned2026-07-07T08:18:10Z
dc.date.available2026-07-07T08:18:10Z
dc.descriptionHow should you choose a good set of (say) 48 planes in four dimensions? More generally, how do you find packings in Grassmannian spaces? In this article I give a brief introduction to the work that I have been doing on this problem in collaboration with A. R. Calderbank, J. H. Conway, R. H. Hardin, E. M. Rains and P. W. Shor. We have found many nice examples of specific packings (70 4-spaces in 8-space, for instance), several general constructions, and an embedding theorem 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 our packings are optimal. There are a number of interesting unsolved problems.
dc.description21 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/math/0208017
dc.identifierhttp://arxiv.org/abs/math/0208017
dc.identifierIn Algebraic Combinatorics and Related Topics (Yamagata 1997), ed. E. Bannai, M. Harada and M. Ozeki, Yamagata University, 1999
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134341
dc.subjectCombinatorics
dc.subjectInformation Theory
dc.subject51E15, 52C17 (51E23, 65Y25)
dc.titlePacking Planes in Four Dimensions and Other Mysteries
dc.typetext

Files

Collections