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

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

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

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

zbMATH Keywords

packings; Grassmannian space

Mathematics Subject Classification ID

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

Unnamed Item, A Short Introduction to Optimal Line Packings, Computing the Distance Between Frames and Between Subspaces of a Hilbert Space, Maximal orthoplectic fusion frames from mutually unbiased bases and block designs, Constructions of biangular tight frames and their relationships with equiangular tight frames, Packings in Real Projective Spaces, A Notion of Optimal Packings of Subspaces with Mixed-Rank and Solutions, Learning Subspaces of Different Dimensions, The Optimal Packing of Eight Points in the Real Projective Plane, Optimal arrangements of classical and quantum states with limited purity, Quantum polarization characterization and tomography, New Upper Bounds for Equiangular Lines by Pillar Decomposition, OPTIMAL LINE PACKINGS FROM FINITE GROUP ACTIONS, POINT DISTRIBUTIONS IN TWO‐POINT HOMOGENEOUS SPACES, On symmetric decompositions of positive operators, Three-point bounds for energy minimization, Achieving the orthoplex bound and constructing weighted complex projective 2-designs with Singer sets, 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, Lattices from equiangular tight frames, Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\), Families of optimal packings in real and complex Grassmannian spaces, More constructions of near optimal codebooks associated with binary sequences, 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, Well-distributed great circles on \(\mathbb S^2\), Uniform recovery of fusion frame structured sparse signals, Regular two-distance sets, A bound on Grassmannian codes, Frame potentials and the geometry of frames, 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., Equiangular tight frames that contain regular simplices, Uncertainty quantification for complex systems with very high dimensional response using Grassmann manifold variations, Equiangular lines and subspaces in Euclidean spaces, Two new constructions of approximately SIC-POVMs from multiplicative characters, Equiangular subspaces in Euclidean spaces, Combinatorial constructions of packings in Grassmannian spaces, Nearly optimal codebooks based on generalized Jacobi sums, 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, Optimal line packings from nonabelian groups, Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes, Two constructions of asymptotically optimal codebooks according to the Welch bound, Two classes of near-optimal codebooks with respect to the Welch bound, Constructing subspace packings from other packings, Two constructions of asymptotically optimal codebooks via the trace functions, Bounds on antipodal spherical designs with few angles, The gradient projection method with Armijo's step size on manifolds, Physics-informed cluster analysis and a priori efficiency criterion for the construction of local reduced-order bases, Equioverlapping measurements, Generalized asymptotically optimal codebooks, Six constructions of asymptotically optimal codebooks via the character sums, Gradient projection method on matrix manifolds, Equichordal tight fusion frames, On the search for tight frames of low coherence, Biangular lines revisited, Grassmannian codes from paired difference sets, Doubly transitive lines. I: Higman pairs and roux, 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, A further construction of asymptotically optimal codebooks with multiplicative characters, Harmonic equiangular tight frames comprised of regular simplices, Stolarsky's invariance principle for projective spaces, Codebooks from generalized bent \(\mathbb{Z}_4\)-valued quadratic forms, Principal symmetric space analysis, Two constructions of asymptotically optimal codebooks, Two families of nearly optimal codebooks, Optimal configurations of lines and a statistical application, An estimator for the diagonal of a matrix, Designs, groups and lattices, Unit time-phase signal sets: bounds and constructions, Toward the classification of biangular harmonic frames, 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, Hadamard equiangular tight frames, A General Least Squares Regression Framework on Matrix Manifolds for Computer Vision, Schubert Varieties and Distances between Subspaces of Different Dimensions, A short history of frames and quantum designs, Universally optimal distribution of points on spheres, Packing of twinned circles on a sphere, Mutually unbiased bases and Hadamard matrices of order six, Packing regular triplets of circles on a sphere, Nonsmooth Riemannian Optimization with Applications to Sphere Packing and Grasping, Radon transforms and packings, Globally Optimizing Small Codes in Real Projective Spaces, New Constructions of Codebooks Nearly Meeting the Welch Bound

Uses Software

XGobi

Cites Work