Legendre duality in combinatorial study of matrix pencils

DOI10.1007/s13160-011-0051-zzbMath1259.15015OpenAlexW2085125059MaRDI QIDQ691986

Kazuo Murota

Publication date: 4 December 2012

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13160-011-0051-z

zbMATH Keywords

ranksmatroidsmatrix pencilsKronecker canonical formLegendre transformationdiscrete convexitycombinatorial matrix theorysubdeterminants

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of matroids and geometric lattices (05B35) Matrix pencils (15A22)

Cites Work

• Matroids and linking systems
• The computation of Kronecker's canonical form of a singular pencil
• Valuated matroids: A new look at the greedy algorithm
• An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
• Kronecker's canonical form and the QZ algorithm
• Valuated matroids
• Bimatroids and invariants
• Computing the maximum degree of minors in matrix pencils via combinatorial relaxation
• 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
• On the Kronecker Canonical Form of Mixed Matrix Pencils
• Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation
• Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems—
• On the Degree of Mixed Polynomial Matrices
• The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part I
• The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part II
• Discrete Convex Analysis
• LINKING SYSTEMS AND MATROID PENCILS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
• Combinatorial Analysis of Singular Matrix Pencils
• Matrices and matroids for systems analysis
• Combinatorial relaxation algorithm for mixed polynomial matrices
• Unnamed Item
• Unnamed Item

This page was built for publication: Legendre duality in combinatorial study of matrix pencils