Recovering a magnitude-symmetric matrix from its principal minors
From MaRDI portal
Publication:6635256
DOI10.1016/j.laa.2024.09.004MaRDI QIDQ6635256
John C. Urschel, Victor-Emmanuel Brunel
Publication date: 9 November 2024
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Learning and adaptive systems in artificial intelligence (68T05) Determinants, permanents, traces, other special matrix functions (15A15) Inverse problems in linear algebra (15A29) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)
Cites Work
- Cycle bases in graphs characterization, algorithms, complexity, and applications
- Set-theoretic defining equations of the variety of principal minors of symmetric matrices
- Skew-symmetric matrices and their principal minors
- On matrices having equal corresponding principal minors
- Principal minors. II: The principal minor assignment problem
- Principal minors and diagonal similarity of matrices
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- An efficient algorithm for the symmetric principal minor assignment problem
- Determinantal Point Processes for Machine Learning
- Negative dependence and the geometry of polynomials
- A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
- Disjoint paths in a network
- Convex sets of nonsingular and P:–Matrices
- High-performance sampling of generic determinantal point processes
- Non-separable and planar graphs.
This page was built for publication: Recovering a magnitude-symmetric matrix from its principal minors
