Legendre duality in combinatorial study of matrix pencils
type: Item
instance of: scholarly article
title: Legendre duality in combinatorial study of matrix pencils
zbMATH Open document ID: 1259.15015
author: Kazuo Murota
published in: Japan Journal of Industrial and Applied Mathematics
publication date: 2012-12-04T00:00:00Z
Mathematics Subject Classification ID: 15A22
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 52B40
Mathematics Subject Classification ID: 05B35
zbMATH DE Number: 6112410
zbMATH Keywords: combinatorial matrix theory
zbMATH Keywords: matrix pencils
zbMATH Keywords: Kronecker canonical form
zbMATH Keywords: matroids
zbMATH Keywords: discrete convexity
zbMATH Keywords: Legendre transformation
zbMATH Keywords: subdeterminants
zbMATH Keywords: ranks
MaRDI profile type: Publication
full work available at URL: s13160-011-0051-z
OpenAlex ID: W2085125059
cites work: An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
cites work: The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part I
cites work: The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part II
cites work: Valuated matroids: A new look at the greedy algorithm
cites work: Valuated matroids
cites work: Q3254327
cites work: Computing the maximum degree of minors in matrix pencils via combinatorial relaxation
cites work: LINKING SYSTEMS AND MATROID PENCILS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
cites work: Combinatorial relaxation algorithm for mixed polynomial matrices
cites work: Combinatorial Analysis of Singular Matrix Pencils
cites work: On the Kronecker Canonical Form of Mixed Matrix Pencils
cites work: Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation
cites work: Bimatroids and invariants
cites work: Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form
cites work: Finding optimal minors of valuated bimatroids
cites work: On the Degree of Mixed Polynomial Matrices
cites work: Matrices and matroids for systems analysis
cites work: Discrete Convex Analysis
cites work: Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems—
cites work: Q4000391
cites work: Matroids and linking systems
cites work: The computation of Kronecker's canonical form of a singular pencil
cites work: Kronecker's canonical form and the QZ algorithm
DOI: 10.1007/S13160-011-0051-Z
description: scientific article; zbMATH DE number 6112410