Optimal simplices and codes in projective spaces

DOI10.2140/GT.2016.20.1289zbMath1353.90084arXiv1308.3188OpenAlexW1674264077MaRDI QIDQ309017

Gregory Minton, Henry Cohn, Abhinav Kumar

Publication date: 7 September 2016

Published in: Geometry \& Topology (Search for Journal in Brave)

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

zbMATH Keywords

designprojective spaceGrassmanniancoderegular simplexlinear programming boundsoctonionic projective planequaternionic projective space

Mathematics Subject Classification ID

Newton-type methods (49M15) Linear programming (90C05) Algorithms with automatic result verification (65G20)

Related Items (18)

Optimal configurations of lines and a statistical application ⋮ Admissibility and frame homotopy for quaternionic frames ⋮ Trace optimality of SIC POVMs ⋮ Octonions and the two strictly projective tight 5-designs ⋮ Optimal measures for \(p\)-frame energies on spheres ⋮ New dense superball packings in three dimensions ⋮ Frames over finite fields: basic theory and equiangular lines in unitary geometry ⋮ Harmonic Grassmannian codes ⋮ Frame Potential in CPⁿ Some Numerical and Analytical Results ⋮ Nearly orthogonal vectors and small antipodal spherical codes ⋮ Orthogonal realizations of random sign patterns and other applications of the SIPP ⋮ Repeated Minimizers of $p$-Frame Energies ⋮ On the search for tight frames of low coherence ⋮ Grassmannian codes from paired difference sets ⋮ Effective bounds for monochromatic connectivity measures in two dimensions ⋮ Packings in Real Projective Spaces ⋮ Stolarsky's invariance principle for projective spaces ⋮ POINT DISTRIBUTIONS IN TWO‐POINT HOMOGENEOUS SPACES

This page was built for publication: Optimal simplices and codes in projective spaces