Optimal simplices and codes in projective spaces

DOI10.2140/GT.2016.20.1289zbMATH Open1353.90084arXiv1308.3188OpenAlexW1674264077MaRDI QIDQ309017FDOQ309017

Gregory Minton, Henry Cohn, Abhinav Kumar

Publication date: 7 September 2016

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

Abstract: We find many tight codes in compact spaces, i.e., optimal codes whose optimality follows from linear programming bounds. In particular, we show the existence (and abundance) of several hitherto unknown families of simplices in quaternionic projective spaces and the octonionic projective plane. The most noteworthy cases are 15-point simplices in HP^2 and 27-point simplices in OP^2, both of which are the largest simplices and the smallest 2-designs possible in their respective spaces. These codes are all universally optimal, by a theorem of Cohn and Kumar. We also show the existence of several positive-dimensional families of simplices in the Grassmannians of subspaces of R^n with n <= 8; close numerical approximations to these families had been found by Conway, Hardin, and Sloane, but no proof of existence was known. Our existence proofs are computer-assisted, and the main tool is a variant of the Newton-Kantorovich theorem. This effective implicit function theorem shows, in favorable conditions, that every approximate solution to a set of polynomial equations has a nearby exact solution. Finally, we also exhibit a few explicit codes, including a configuration of 39 points in OP^2 that form a maximal system of mutually unbiased bases. This is the last tight code in OP^2 whose existence had been previously conjectured but not resolved.

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

Recommendations

• scientific article; zbMATH DE number 6902639
• Optimal Few-Weight Codes From Simplicial Complexes
• Infinite Families of Optimal Linear Codes Constructed From Simplicial Complexes
• On certain projective geometry codes (Corresp.)
• Linear programming bounds for codes in infinite projective spaces
• Some optimal codes from algebraic geometry and their covering radii
• On the Bounds of Certain Maximal Linear Codes in a Projective Space
• Linear codes from projective spaces
• The dimension of projective geometry codes
• Minimal codewords arising from the incidence of points and hyperplanes in projective spaces

zbMATH Keywords

designcodeprojective spaceGrassmannianlinear programming boundsoctonionic projective planequaternionic projective spaceregular simplex

Mathematics Subject Classification ID

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

Cited In (25)

• Optimal measures for \(p\)-frame energies on spheres
• Grassmannian codes from paired difference sets
• Repeated Minimizers of $p$-Frame Energies
• Optimal configurations of lines and a statistical application
• POINT DISTRIBUTIONS IN TWO‐POINT HOMOGENEOUS SPACES
• Harmonic Grassmannian codes
• Admissibility and frame homotopy for quaternionic frames
• Title not available (Why is that?)
• Trace optimality of SIC POVMs
• Nearly orthogonal vectors and small antipodal spherical codes
• \(p\)-adic Welch bounds and \(p\)-adic Zauner conjecture
• Metric problems in projective and Grassmann spaces
• The topology of projective codes and the distribution of zeros of odd maps
• Effective bounds for monochromatic connectivity measures in two dimensions
• Minimal codewords arising from the incidence of points and hyperplanes in projective spaces
• Stolarsky's invariance principle for projective spaces
• Orthogonal realizations of random sign patterns and other applications of the SIPP
• On the search for tight frames of low coherence
• Octonions and the two strictly projective tight 5-designs
• Packings in Real Projective Spaces
• Nearly orthogonal vectors and small antipodal spherical codes
• Naimark-spatial families of equichordal tight fusion frames
• Frame Potential in CPⁿ Some Numerical and Analytical Results
• Frames over finite fields: basic theory and equiangular lines in unitary geometry
• New dense superball packings in three dimensions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q309017)