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

## TL;DR

This paper investigates the conditions under which matrices with prescribed row and column sums can achieve their minimum $t$-term ranks, extending understanding of combinatorial matrix properties for various $t$ values.

## Contribution

It establishes conditions for the existence of matrices in ${
m extbf{A}}(R,S)$ that realize all minimum $t$-term ranks for any $t \,\geq\, 1$, advancing combinatorial matrix theory.

## Key findings

- Derived necessary and sufficient conditions for such matrices.
- Extended previous results to all $t \geq 1$.
- Provided a framework for constructing matrices with minimal $t$-term ranks.

## Abstract

Let $R$ and $S$ be two sequences of nonnegative integers in nonincreasing order and with the same sum, and let ${\cal A}(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 ${\cal A}(R,S)$ that realizes all the minimum $t$-term ranks, for $t\geq 1$.