---
title: 'T-Rank: A Combinatorial Matrix Invariant'
url: https://www.emergentmind.com/topics/t-rank
type: topic
---

# T-Rank: A Combinatorial Matrix Invariant

In combinatorial matrix theory, the **\(t\)-term rank** of an \(m\times n\) \((0,1)\)-matrix \(A\), denoted \(p_t(A)\), is the largest number of \(1\)s in \(A\) with at most one \(1\) in each column and at most \(t\) \(1\)s in each row. The case \(t=1\) is the ordinary term rank \(p(A)\), so \(t\)-term rank extends the classical matching-based notion attached to a bipartite graph or incidence matrix. The subject was developed systematically in “On the t-Term Rank of a Matrix” [1011.5870], which generalizes König–Egerváry- and Ryser-type results, establishes exact formulas for maxima over prescribed row- and column-sum classes, and proves that within such a class there exists a single matrix simultaneously realizing the maximum \(k\)-term ranks for every \(1\le k\le t\).

## 1. Definition and combinatorial meaning

Let \(A=[a_{ij}]\) be an \(m\times n\) \((0,1)\)-matrix. The ordinary term rank is
\[
p(A)=\text{maximum number of 1s in }A\text{ with no two 1s in the same row or column}.
\]
Equivalently, by the König–Egerváry theorem,
\[
p(A)=\min\{e+f:\; \text{there is a cover of }A\text{ with }e\text{ rows and }f\text{ columns}\}.
\]
If \(G\) is the bipartite graph whose biadjacency matrix is \(A\), then \(p(A)\) is the size of a maximum matching in \(G\) [1011.5870].

For a positive integer \(t\), the \(t\)-term rank is defined by
\[
p_t(A)=\max\{\,o(B):\; B\le A,\; r_i(B)\le t\ (1\le i\le m),\; s_j(B)\le 1\ (1\le j\le n)\,\},
\]
where \(r_i(X)=\sum_j x_{ij}\), \(s_j(X)=\sum_i x_{ij}\), and \(o(X)=\sum_{i,j}x_{ij}\). Here \(B\le A\) means entrywise \(b_{ij}\le a_{ij}\). The identity
\[
p_1(A)=p(A)
\]
places the classical theory inside the \(t\)-parameter family.

This definition is combinatorial rather than linear-algebraic. The paper explicitly situates \(p_t(A)\) in matching, covering, set-system, and matroid frameworks, and states that it does not systematically develop relations between \(p_t(A)\) and rank over a field [1011.5870]. A common misconception is therefore to identify \(t\)-term rank with ordinary matrix rank; in this literature, it is instead a constrained packing parameter for \(1\)-entries.

## 2. Equivalent formulations and structural interpretations

A basic equivalence is obtained by stacking \(t\) copies of \(A\). If
\[
A^{(t)}=
\begin{bmatrix}
A\\
A\\
\vdots\\
A
\end{bmatrix}
\quad (t\text{ copies}),
\]
then
\[
p_t(A)=p(A^{(t)}).
\]
Applying König–Egerváry to \(A^{(t)}\) yields the min-cover formula
\[
p_t(A)=\min\{\,t e + f:\ \text{there is a cover of }A\text{ with }e\text{ rows and }f\text{ columns}\,\}.
\]
This is the direct \(t\)-analogue of the ordinary cover characterization [1011.5870].

There is also a Hall-type set-system formulation. If \(A\) is regarded as the incidence matrix of a family \(\mathcal C=(C_1,\dots,C_m)\) of subsets of a ground set \(X=\{x_1,\dots,x_n\}\), then
\[
p_t(A) = \min_{K\subseteq\{1,\dots,m\} }
\bigl( \bigl|\textstyle\bigcup_{i\in K} C_i\bigr| + t(m-|K|)\bigr).
\]
For \(t=1\), this reduces to the standard formula for term rank.

The matroid-theoretic interpretation is equally precise. The column sets \(K\) such that \(p(A[*,K])=|K|\) form the independent sets of a transversal matroid \(M(A)\), whose rank is \(p(A)\). Then
\[
M(A^{(t)})=M(A)\,\vee\, M(A)\,\vee\cdots\vee\,M(A)
\quad\text{(t copies)},
\]
and its rank is \(p_t(A)\). A basis of \(M(A^{(t)})\) is a set of columns \(K\) of size \(p_t(A)\) that can be partitioned into \(K_1,\dots,K_t\) so that each \(A[*,K_i]\) has at most one \(1\) per row and exactly one \(1\) per column. This matroid-union perspective underlies the concavity and joint-realization phenomena proved later in the paper.

Finally, in bipartite-graph language, choosing \(1\)s with at most \(t\) per row and at most \(1\) per column is equivalent to a \(b\)-matching in which row vertices have capacity \(t\) and column vertices have capacity \(1\). This suggests that \(t\)-term rank is the natural \(b\)-matching extension of ordinary matching size [1011.5870].

## 3. Growth in \(t\), strength, concavity, and interchanges

For a fixed matrix \(A\), the sequence \(p_t(A)\) is nondecreasing:
\[
p_0(A):=0,\quad p_0(A)\le p_1(A)\le p_2(A)\le\cdots.
\]
If \(A\) has at least one \(1\) in each column and \(m\le n\), then \(p_t(A)\) strictly increases with \(t\) until it reaches \(n\), and then remains constant at \(n\) [1011.5870].

This motivates the **strength** \(\gamma(A)\), defined as the smallest positive integer \(t\) such that \(p_t(A)=n\). Equivalently, \(\gamma(A)\) is the smallest \(t\) for which there is a submatrix \(B\le A\) with exactly one \(1\) in each column and at most \(t\) \(1\)s in each row. One always has
\[
\gamma(A)\le \max\{r_1(A),\dots,r_m(A)\}.
\]

The increments of \(p_t(A)\) are concave in \(t\). Proposition 2.3 states that
\[
p_k(A)-p_{k-1}(A)\ \ge\ p_{k+1}(A)-p_k(A)\quad (k\ge 1).
\]
Thus the marginal gain from increasing the per-row capacity from \(k-1\) to \(k\) is nonincreasing. This is one of the central structural regularities of the theory.

The paper also studies **interchanges**, the local moves
\[
\begin{bmatrix}1&0\\0&1\end{bmatrix}
\quad\longleftrightarrow\quad
\begin{bmatrix}0&1\\1&0\end{bmatrix},
\]
which preserve row and column sums. Proposition 2.4 shows that a single interchange changes \(p_t(A)\) by at most \(1\):
\[
p_t(A)-1\ \le\ p_t(A')\ \le\ p_t(A)+1.
\]
For \(t\ge 2\), Proposition 2.5 strengthens this: if an interchange increases the \((t-1)\)-term rank, then it cannot decrease the \(t\)-term rank. In symbols, if
\[
p_{t-1}(A')=p_{t-1}(A)+1,
\]
then
\[
p_t(A)\ \le\ p_t(A')\ \le\ p_t(A)+1.
\]

The examples in the paper show that different levels \(p_1,p_2,\dots\) can respond differently to a given interchange. One example gives a matrix with
\[
p_1(A)=6,\quad p_2(A)=8,
\]
while after a specific interchange
\[
p_1(A')=7,\quad p_2(A')=8=p_2(A).
\]
This demonstrates that higher \(t\)-levels are robust but not rigidly tied to lower ones [1011.5870].

## 4. Classes \(A(R,S)\), semiregular matrices, and extremal behavior

A major part of the theory concerns classes of matrices with prescribed row and column sums. Let
\[
R=(r_1,\dots,r_m),\qquad S=(s_1,\dots,s_n),
\]
where the entries are nonnegative integers, monotone nonincreasing, and satisfy
\[
r_1+\cdots+r_m=s_1+\cdots+s_n.
\]
Then \(A(R,S)\) denotes the class of all \((0,1)\)-matrices with row sum vector \(R\) and column sum vector \(S\). When nonempty, this class is governed by the classical Gale–Ryser/Ford–Fulkerson existence theory; the paper uses the equivalent Ford–Fulkerson matrix \(T(R,S)=[t_{kl}]\), whose nonnegativity characterizes nonemptiness [1011.5870].

For such a class, the maximum \(t\)-term rank is
\[
p_t(R,S):=\max\{p_t(A): A\in A(R,S)\}.
\]
When \(t=1\), Ryser’s formula gives
\[
p(R,S)=p_1(R,S)=\min\{\;t_{ef}(R,S)+e+f:\ 0\le e\le m,\ 0\le f\le n\;\}.
\]

A particularly rigid case is the semiregular class
\[
A(m,n;k,\ell),
\]
consisting of all \(m\times n\) \((0,1)\)-matrices with exactly \(k\) \(1\)s in each row and \(\ell\) \(1\)s in each column, where \(km=n\ell\). Theorem 3.1 states that for any nonempty semiregular class and any positive integer \(t\),
\[
p_t(A)=\min\{tm,n\}\quad\text{for all }A\in A(m,n;k,\ell).
\]
Thus in the semiregular situation the \(t\)-term rank depends only on \(t,m,n\), not on the specific values of \(k,\ell\) beyond the balancing condition \(km=n\ell\). When \(m\le n\), Corollary 3.2 gives
\[
\gamma(A)=\left\lceil\frac{n}{m}\right\rceil\quad\text{for all }A\in A(m,n;k,\ell).
\]
This suggests that semiregularity imposes a uniform extremal geometry on the entire class.

## 5. Ryser-type formula and joint realization of all maximum \(k\)-term ranks

The central extremal result is the \(t\)-analogue of Ryser’s formula. If \(A(R,S)\neq\varnothing\), then Theorem 4.3 states
\[
p_t(R,S)=\min\bigl\{\, t_{ef}(R,S) + te + f\ :\ 0\le e\le m,\ 0\le f\le n\,\bigr\}.
\]
This is exactly Ryser’s formula with \(e+f\) replaced by \(te+f\), reflecting the fact that in the covering interpretation each selected row has multiplicity \(t\) rather than \(1\) [1011.5870].

The proof uses Anstee’s existence theorem, a specialization giving embeddings \(A'\le A\) between classes \(A(R',S')\subseteq A(R,S)\), and a reduction to the full-\(tm\) case via enlarged matrices \(A^*\). The paper summarizes the resulting criterion as follows: the existence of an \(A\in A(R,S)\) with \(p_t(A)\ge p\) is equivalent to the family of inequalities
\[
t_{ef}(R,S)+te+f\ge p,\quad 0\le e\le m,\ 0\le f\le n.
\]
Taking the largest admissible \(p\) yields the formula above.

The paper’s most distinctive theorem is the **joint realization** result. Let
\[
p_k:=p_k(R,S),\qquad k=1,\dots,t.
\]
Then Theorem 5.2 asserts that there exists a matrix \(A\in A(R,S)\) and a submatrix \(B\le A\) such that:

1. \(p_k(A)=p_k\) for all \(k=1,2,\dots,t\).
2. \(B\) contains exactly \(p_t\) ones.
3. All these ones lie in the leading \(p_1\times p_t\) submatrix.
4. Each of the first \(p_t\) columns of \(B\) contains exactly one \(1\).
5. Each of the first \(p_1\) rows of \(B\) contains at most \(t\) ones, with row counts arranged in descending blocks:
   - the first \(p_t\) rows each containing \(t\) ones,
   - the next \(p_{t-1}\) rows each containing \(t-1\) ones,
   - and so on down to rows containing one \(1\).

The consequence is that a single matrix can simultaneously attain every extremal value \(p_1(R,S),p_2(R,S),\dots,p_t(R,S)\). The abstract describes this as a surprising result, and it generalizes Haber’s canonical form for maximum ordinary term rank to a block structure encoding all maximum \(k\)-term ranks at once [1011.5870].

## 6. Related notions and terminological ambiguity

Within combinatorial matrix theory, \(t\)-term rank is best understood as a constrained matching or covering invariant. It is the rank of the union of \(t\) copies of the transversal matroid \(M(A)\), and it is equivalent to a bipartite \(b\)-matching parameter with row capacity \(t\) and column capacity \(1\) [1011.5870]. It is not the ordinary rank of a matrix over a field.

The label **“T-rank”** is, however, used in other literatures for unrelated concepts. In tensor analysis based on the \(t\)-product and \(t\)-SVD, “T-rank” commonly refers to the **tensor tubal rank**, the number of nonzero T-singular values of a third-order tensor [2103.00976]. A more recent tensor paper introduces **T-phase rank**, defined for sectorial third-order tensors as the number of nonzero canonical T-phases, thereby distinguishing a phase-based notion from tubal rank [2602.12121]. In partition theory, Garvan’s **higher \(T\)-rank** denotes a family of partition statistics generalizing the crank and rank for odd \(T\), with moment asymptotics developed in [1205.2904]. These usages are terminologically parallel but mathematically disjoint.

A further possible source of confusion is “TFRank,” an LLM-based ranking system whose name abbreviates “Think-Free Reasoning” rather than any matrix or tensor rank notion [2508.09539]. The combinatorial \(t\)-term rank of \((0,1)\)-matrices is therefore a specific, classical object, and its theory is centered on matchings, covers, prescribed degree sequences, and matroid union rather than on tensor decompositions, partition statistics, or information retrieval.

In that specific sense, \(t\)-term rank occupies a precise place in extremal combinatorics. It extends the ordinary term rank, preserves the matching-covering duality in a modified form, admits exact optimization formulas over classes \(A(R,S)\), behaves concavely as a function of \(t\), and supports a canonical extremal structure that simultaneously realizes all maximum levels up to a prescribed \(t\) [1011.5870].

Source: https://www.emergentmind.com/topics/t-rank