On the term rank partition

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

For each positive integer t, the t-term rank of a (0, 1)-matrix Ais the maximum number of 1’s in Awith at most one 1in each column and at most t1’s in each row. In [5]R. Brualdi et al. (2012)stated several results for the t-term rank, including a formula for the maximum t-term rank over a nonempty class of (0, 1)-matrices with the same row sum and column sum vectors. In this paper we state more results for the t-term rank. Using these results we define and we study the term rank partition. We also deduce a formula for the minimal t-term rank over a nonempty class of (0, 1)-matrices with the same row sum and column sum vectors.
Original languageEnglish
Pages (from-to)134–148
Number of pages15
JournalLinear Algebra and Its Applications
Volume458
DOIs
Publication statusPublished - 1 Oct 2014

Keywords

  • Column sum vector
  • Interchange
  • Row sum vector
  • t-Term rank

Fingerprint Dive into the research topics of 'On the term rank partition'. Together they form a unique fingerprint.

Cite this