Finding optimal minors of valuated bimatroids
From MaRDI portal
Publication:1895110
DOI10.1016/0893-9659(95)00043-PzbMath0833.05017OpenAlexW2130529283MaRDI QIDQ1895110
Publication date: 5 March 1996
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0893-9659(95)00043-p
Determinants, permanents, traces, other special matrix functions (15A15) Combinatorial aspects of matroids and geometric lattices (05B35) Real rational functions (26C15)
Related Items
Convexity and Steinitz's exchange property, Well-layered maps and the maximum-degree \(k \times k\)-subdeterminant of a matrix of rational functions, Well-layered maps---a class of greedily optimizable set functions, Two algorithms for valuated \(\Delta\)-matroids, Presentations of transversal valuated matroids, Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors, Legendre duality in combinatorial study of matrix pencils, On circuit valuation of matroids, Even factors, jump systems, and discrete convexity, Discrete convex analysis, \(k\)-best solutions under distance constraints in valuated \(\Delta\)-matroids, Extension of M-convexity and L-convexity to polyhedral convex functions, Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors in mixed polynomial matrices, Computing valuations of the Dieudonné determinants
Cites Work
- Unnamed Item
- Unnamed Item
- Matroids and linking systems
- Valuated matroids: A new look at the greedy algorithm
- Valuated matroids
- Bimatroids and invariants
- Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form
- Rational matrix structure
- Computing the Degree of Determinants via Combinatorial Relaxation
