Packing Lines, Planes, etc.: Packings in Grassmannian Spaces

From MaRDI portal
Publication:4717345


DOI10.1080/10586458.1996.10504585zbMath0864.51012arXivmath/0208004WikidataQ56049947 ScholiaQ56049947MaRDI QIDQ4717345

Conway, John H., N. J. A. Sloane, R. H. Hardin

Publication date: 14 January 1997

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0208004


51M20: Polyhedra and polytopes; regular figures, division of spaces

14M15: Grassmannians, Schubert varieties, flag manifolds

52C17: Packing and covering in (n) dimensions (aspects of discrete geometry)


Related Items

Three-point bounds for energy minimization, Packing regular triplets of circles on a sphere, Nonsmooth Riemannian Optimization with Applications to Sphere Packing and Grasping, Radon transforms and packings, Impacts of high dimensionality in finite samples, Probability modelled optimal frames for erasures, Two are better than one: fundamental parameters of frame coherence, A kernel-based framework to tensorial data analysis, On block coherence of frames, Geometric mean and geodesic regression on Grassmannians, On \(p\)-tuples of equi-isoclinic 3-spaces in the Euclidean space, On the performance of high-gain observers with gain adaptation under measurement noise, On the size of incoherent systems, A bound on Grassmannian codes, A note on equiangular tight frames, Explicit volume-preserving splitting methods for linear and quadratic divergence-free vector fields, Equiangular tight frames from Paley tournaments, On the existence of equiangular tight frames, Codebooks from almost difference sets, A survey on spherical designs and algebraic combinatorics on spheres, A group-theoretic framework for the construction of packings in Grassmannian spaces, A family of optimal packings in Grassmannian manifolds, Grassmannian frames with applications to coding and communication, Optimal frames for erasures., Codes and designs in Grassmannian spaces., Some constructions of superimposed codes in Euclidean spaces., Designs in Grassmannian spaces and lattices, Block orthogonal greedy algorithm for stable recovery of block-sparse signal representations, Tight \(p\)-fusion frames, Grassmannian frequency of Sobolev dimension distortion, Every Hilbert space frame has a Naimark complement, Bounds for codes and designs in complex subspaces, Two families of nearly optimal codebooks, An estimator for the diagonal of a matrix, Designs, groups and lattices, Unit time-phase signal sets: bounds and constructions, A new class of near-optimal partial Fourier codebooks from an almost difference set, Robust dimension reduction, fusion frames, and Grassmannian packings, Random fusion frames are nearly equiangular and tight, Universally optimal distribution of points on spheres, Packing of twinned circles on a sphere, Mutually unbiased bases and Hadamard matrices of order six


Uses Software


Cites Work