Matrices in \(\mathcal{A}(R, S)\) with minimum \(t\)-term ranks

DOI10.1016/j.laa.2019.10.010zbMath1429.05029arXiv1904.11069OpenAlexW2980856645MaRDI QIDQ2282786

Susana C. Palheira, Rosário Fernandes, Henrique F. da Cruz

Publication date: 19 December 2019

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

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

zbMATH Keywords

network flows\((0Gale-Ryser theorem1)\)-matrix

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Related Items (3)

On certain trees with the same degree sequence ⋮ Unnamed Item ⋮ On the term rank partitions of matrices in

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An extension of Brualdi's algorithm for the construction of \((0,1)\)-matrices with prescribed row and column sum vectors
• Combinatorial batch codes and transversal matroids
• On the \(t\)-term rank of a matrix
• A theorem on flows in networks
• On the Bruhat order of labeled graphs
• Minimal matrices in the Bruhat order for symmetric (0,1)-matrices
• On the term rank partition
• Combinatorial batch codes
• Combinatorial Properties of Matrices of Zeros and Ones
• Batch codes and their applications
• Matrices of zeros and ones with given line sums and a zero block

This page was built for publication: Matrices in \(\mathcal{A}(R, S)\) with minimum \(t\)-term ranks