Matroids and the Minimum Rank Problem for Matrix Patterns

DOI10.1080/00029890.2020.1801078zbMath1473.05043OpenAlexW3094581814MaRDI QIDQ5127269

Louis Deaett

Publication date: 22 October 2020

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00029890.2020.1801078

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Sign pattern matrices (15B35)

Cites Work

• The extent to which triangular sub-patterns explain minimum rank
• An upper bound for the minimum rank of a graph
• Minimum rank of matrices described by a graph or pattern over the rational, real and complex numbers
• Minimum ranks of sign patterns and zero-nonzero patterns and point-hyperplane configurations
• The minimum rank problem: A counterexample
• ON THE POSSIBLE RANKS AMONG MATRICES WITH A GIVEN PATTERN
• A Class of Non-Desarguesian Projective Planes
• On the minimum rank of not necessarily symmetric matrices: A preliminary study
• An Introduction to Matroid Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Matroids and the Minimum Rank Problem for Matrix Patterns