Well-layered maps and the maximum-degree \(k \times k\)-subdeterminant of a matrix of rational functions

DOI10.1016/0893-9659(95)00040-WzbMath0824.15023OpenAlexW2082976908MaRDI QIDQ1895106

Werner F. Terhalle, Andreas W. M. Dress

Publication date: 15 November 1995

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(95)00040-w

zbMATH Keywords

control theoryvaluated matroidsgreedy algorithmsgreedoids\(p\)-adic geometrymatrix of rational functionswell-layered maps

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Combinatorial aspects of matroids and geometric lattices (05B35) Matrices over function rings in one or more variables (15A54)

Related Items (5)

Convexity and Steinitz's exchange property ⋮ Two algorithms for valuated \(\Delta\)-matroids ⋮ On circuit valuation of matroids ⋮ A disturbed version of the greedy algorithm ⋮ Discrete convex analysis

Cites Work

• Greedoids
• Valuated matroids: A new look at the greedy algorithm
• A greedy-algorithm characterization of valuated \(\Delta\)-matroids
• Valuated matroids
• Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form
• Finding optimal minors of valuated bimatroids
• Well-layered maps---a class of greedily optimizable set functions
• Rewarding maps: On greedy optimization of set functions

This page was built for publication: Well-layered maps and the maximum-degree \(k \times k\)-subdeterminant of a matrix of rational functions