Matrices in A(R, S) with minimum t-term ranks

DOI10.1016/J.LAA.2019.10.010MaRDI QIDQ2282786zbMATH OpenOpenAlexFDO

Authors Rosário Fernandes, Susana C. Palheira, 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

1)\)-matrix\((0Gale-Ryser theoremnetwork flows

Mathematics Subject Classification ID

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

Abstract: Let $R$ and $S$ be two sequences of nonnegative integers in nonincreasing order and with the same sum, and let $calA(R,S)$ be the class of all $(0,1)$-matrices having row sum $R$ and column sum $S$. For a positive integer $t$, the $t$-term rank of a $(0,1)$-matrix $A$ is defined as the maximum number of $1$'s in $A$ with at most one $1$ in each column, and at most $t$ $1$'s in each row. In this paper, we address conditions for the existence of a matrix in a class $calA(R,S)$ that realizes all the minimum $t$-term ranks, for $tgeq1$.

Recommendations

• On the \(t\)-term rank of a matrix
• Further results on the minimum rank of regular classes of (0,1)-matrices
• On upper bounds for the minimum rank of regular classes of (0,1)-matrices
• Minimum matrix rank of k-regular (0,1) matrices
• On Rédei matrices with minimal rank
• On the minimum rank of regular classes of matrices of zeros and ones
• The maximal and minimal ranks of matrix expression with applications
• The extremal ranks of \(A_1-B_1XC_1\) subject to a pair of matrix equations
• scientific article; zbMATH DE number 1059231
• The lower bounds for the rank of matrices and some sufficient conditions for nonsingular matrices

Cites work

• A theorem on flows in networks
• An extension of Brualdi's algorithm for the construction of (0,1)-matrices with prescribed row and column sum vectors
• Batch codes and their applications
• Combinatorial batch codes
• Combinatorial batch codes and transversal matroids
• Combinatorial matrix classes
• Combinatorial matrix theory
• Combinatorial Properties of Matrices of Zeros and Ones
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• Matrices of zeros and ones with given line sums and a zero block
• Minimal matrices in the Bruhat order for symmetric (0,1)-matrices
• On the \(t\)-term rank of a matrix
• On the Bruhat order of labeled graphs
• On the term rank partition

Cited in

(9)

• A generalization of Ryser's theorem on term rank
• On certain trees with the same degree sequence
• On the term rank partition
• The Variety of Pairs of Matrices with rank(AB - BA) ≤1
• On the little secondary Bruhat order
• On upper bounds for the minimum rank of regular classes of (0,1)-matrices
• On the term rank partitions of matrices in
• On the \(t\)-term rank of a matrix
• On the minimal number of matrices which form a locally hypercyclic, non-hypercyclic tuple

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

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