Exact orthant certificates and Newton obstructions for polynomials in minors
Statement
An algorithmic process is known to identify inequalities that compare the products of two minors for all matrices.
Classify real linear combinations of products of minors that are nonnegative for all matrices. More concretely, given a polynomial , when can one certify, via some constructive algorithmic process, that evaluating at yields a non-negative output for all matrices .
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.