On the t-term rank of a matrix

DOI10.1016/J.LAA.2011.06.001MaRDI QIDQ765173zbMATH OpenOpenAlexFDO

Authors Richard A. Brualdi, Kathleen P Kiernan, Seth A. Meyer, Michael W. Schroeder

Publication date 19 March 2012

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1011.5870

zbMATH Keywords

interchange\(t\)-term rankcolumn sum vectormatrix classrow sum vector

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Transversal (matching) theory (05D15)

Abstract: For t a positive integer, the t-term rank of a (0,1)-matrix A is defined to be the largest number of 1s in A with at most one 1 in each column and at most t 1s in each row. Thus the 1-term rank is the ordinary term rank. We generalize some basic results for the term rank to the t-term rank, including a formula for the maximum term rank over a nonempty class of (0,1)-matrices with the the same row sum and column sum vectors. We also show the surprising result that in such a class there exists a matrix which realizes all of the maximum terms ranks between 1 and t.

Recommendations

• On the term rank partition
• Matrices in \(\mathcal{A}(R, S)\) with minimum \(t\)-term ranks
• A generalization of Ryser's theorem on term rank
• On the properties of interchange operations in classes of \((0,1)\)- matrices
• The structure matrix and a generalization of Ryser's maximum term rank formula

Cites work

• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• Batch codes and their applications
• Combinatorial batch codes
• Combinatorial batch codes and transversal matroids
• Combinatorial matrix theory
• On Fundamental Transversal Matroids

Cited in

(8)

• Minimal matrices in the Bruhat order for symmetric (0,1)-matrices
• scientific article; zbMATH DE number 6123192 (Why is no real title available?)
• The structure matrix and a generalization of Ryser's maximum term rank formula
• On the term rank partition
• A minimal completion of (0,1)-matrices without total support
• Matrices in \(\mathcal{A}(R, S)\) with minimum \(t\)-term ranks
• On the term rank partitions of matrices in
• Possible numbers of nonzero entries in a matrix with a given term rank

This page was built for publication: On the \(t\)-term rank of a matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765173)