Efficient recognition of totally nonnegative matrix cells

DOI10.1007/s10208-013-9169-5zbMath1299.15038arXiv1207.3613OpenAlexW2002881330MaRDI QIDQ404284

Thomas H. Lenagan, Stephane Launois

Publication date: 4 September 2014

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

totally nonnegative matricesefficient testing criteriatotally nonnegative cells

Mathematics Subject Classification ID

Positive matrices and their generalizations; cones of matrices (15B48)

Related Items

Invariance of total nonnegativity of a matrix under entry-wise perturbation and subdirect sum of totally nonnegative matrices ⋮ From Grassmann necklaces to restricted permutations and back again ⋮ Total nonnegativity of matrices related to polynomial roots and poles of rational functions ⋮ Poisson deleting derivations algorithm and Poisson spectrum ⋮ Characterization, perturbation, and interval property of certain sign regular matrices ⋮ Further applications of the Cauchon algorithm to rank determination and bidiagonal factorization ⋮ The prime spectrum of quantum SL3 and the Poisson prime spectrum of its semiclassical limit ⋮ Intervals of special sign regular matrices ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Totally nonnegative cells and matrix Poisson varieties
• Torus-invariant prime ideals in quantum matrices, totally nonnegative cells and symplectic leaves.
• Total positivity and Neville elimination
• From totally nonnegative matrices to quantum matrices and back, via Poisson geometry
• Prime spectrum of \(O_q(M_n(k))\): canonical image and normal separation
• LU decomposition of totally nonnegative matrices
• Total Positivity, $QR$ Factorization, and Neville Elimination
• Double Bruhat cells and total positivity
• Totally positive matrices
• Total positivity: tests and parametrizations.