The phaseless rank of a matrix
From MaRDI portal
Publication:6324740
DOI10.1137/19M1289820zbMATH Open1510.14045arXiv1909.02417MaRDI QIDQ6324740FDOQ6324740
Authors: António Pedro Goucha, João Gouveia 
Publication date: 5 September 2019
Abstract: We consider the problem of finding the smallest rank of a complex matrix whose absolute values of the entries are given. We call this minimum the phaseless rank of the matrix of the entrywise absolute values. In this paper we study this quantity, extending a classic result of Camion and Hoffman and connecting it to the study of amoebas of determinantal varieties and of semidefinite representations of convex sets. As a consequence, we prove that the set of maximal minors of a matrix of indeterminates form an amoeba basis for the ideal they define, and we attain a new upper bound on the complex semidefinite extension complexity of polytopes, dependent only on their number of vertices and facets. We also highlight the connections between the notion of phaseless rank and the problem of finding large sets of complex equiangular lines or mutually unbiased bases.
Factorization of matrices (15A23) Nonconvex programming, global optimization (90C26) Semidefinite programming (90C22) Semialgebraic sets and related spaces (14P10) Vector spaces, linear dependence, rank, lineability (15A03) Foundations of tropical geometry and relations with algebra (14T10)
This page was built for publication: The phaseless rank of a matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6324740)
