Matrix Representations of Transversal Matroids
Austin Alderete

TL;DR
This paper characterizes matrices associated with maximal presentations of transversal matroids, provides an algorithm for their construction, and links the problem to tropical rank determination.
Contribution
It offers a complete characterization of matrices from maximal presentations of transversal matroids and connects the problem to tropical rank computation.
Findings
Characterization of matrices from unique maximal presentations for rank 2
Algorithm for constructing such matrices
Relation between maximal presentation matrices and tropical rank
Abstract
A transversal matroid of rank on can be associated to a family of binary matrices corresponding to different presentations of . We describe those matrices which arise from unique maximal presentations of size - giving a complete characterization when -, give an algorithm for producing such a matrix, and show that determining whether a matrix corresponds to a maximal presentation is related to determining the tropical rank of arbitrary matrices.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Coding theory and cryptography · Optical Network Technologies
