Globally optimizing small codes in real projective spaces

DOI10.1137/19M1307895MaRDI QIDQ5854456zbMATH OpenFDO

Authors Dustin G. Mixon, Hans Parshall

Publication date 17 March 2021

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

optimizationpackingsum-of-squares

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Abstract: For $din5,6$, we classify arrangements of $d+2$ points in $mathbf{RP}^{d-1}$ for which the minimum distance is as large as possible. To do so, we leverage ideas from matrix and convex analysis to determine the best possible codes that contain equiangular lines, and we introduce a notion of approximate Positivstellensatz certificates that promotes numerical approximations of Stengle's Positivstellensatz certificates to honest certificates.

Recommendations

• Packings in real projective spaces
• Optimal simplices and codes in projective spaces
• Minimal and maximal arrangements of hyperplanes in \(\mathbb P^{n}(\mathbb {F}_{q})\)
• The optimal packing of eight points in the real projective plane
• Optimality and uniqueness of the \((4,10,1/6)\) spherical code

Cites work

• A mathematical introduction to compressive sensing
• A Mathematical Theory of Communication
• A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
• A semidefinite programming hierarchy for packing problems in discrete geometry
• Auf welcher Kugel haben 5, 6, 7, 8 oder 9 Punkte mit Mindestabstand Eins Platz?
• Das Problem der dreizehn Kugeln
• Distribution of points in the elliptic plane
• Enumeration of Seidel matrices
• Error detecting and error correcting codes
• Experimental study of energy-minimizing point configurations on spheres
• Fingerprinting With Equiangular Tight Frames
• Geometric properties of Grassmannian frames for \(\mathbb R^2\) and \(\mathbb R^3\)
• Grassmannian frames with applications to coding and communication
• scientific article; zbMATH DE number 3756498 (Why is no real title available?)
• scientific article; zbMATH DE number 3497890 (Why is no real title available?)
• scientific article; zbMATH DE number 3547309 (Why is no real title available?)
• scientific article; zbMATH DE number 517393 (Why is no real title available?)
• scientific article; zbMATH DE number 1984325 (Why is no real title available?)
• scientific article; zbMATH DE number 2115094 (Why is no real title available?)
• Julia: a fresh approach to numerical computing
• JuMP: a modeling language for mathematical optimization
• Nearly orthogonal vectors and small antipodal spherical codes
• Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
• Packings in real projective spaces
• Quasi-random graphs
• Real quantifier elimination is doubly exponential
• Recovering Low-Rank Matrices From Few Coefficients in Any Basis
• Symmetric informationally complete quantum measurements
• The optimal packing of eight points in the real projective plane
• The road to deterministic matrices with the restricted isometry property
• The strong thirteen spheres problem
• The Tammes problem for N = 14
• Two-Graphs, Switching Classes and Euler Graphs are Equal in Number

Cited in

(2)

• The core of a Grassmannian frame
• Testing isomorphism between tuples of subspaces

Describes a project that uses

Uses Software

• JuMP
• Julia

This page was built for publication: Globally optimizing small codes in real projective spaces

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