Minimal matrices in the Bruhat order for symmetric (0, 1)-matrices

Maria do Rosário Silva Franco Fernandes, Susana Furtado, Henrique F. da Cruz

Research output: Contribution to journalArticle

Abstract

In this paper we study the minimal matrices for the Bruhat order on the class of symmetric (0, 1)-matrices with given row sum vector. We will show that, when restricted to the symmetric matrices, new minimal matrices may appear besides the symmetric matrices for the nonrestricted Bruhat order. We modify the algorithm presented by Brualdi and Hwang (2004), which gives a minimal matrix for the Bruhat order on the class of (0, 1)-matrices with given row and column sum vectors, in order to obtain a minimal matrix for the Bruhat order on the class of symmetric (0, 1)-matrices with given row sum vector. We identify other minimal matrices in some of these classes. Namely, we determine all the minimal matrices when the row sums are constant and equal to 3. We then describe a family of symmetric matrices that are minimal for the Bruhat order on the class of 2k-by-2k (0, 1)-matrices with constant row sums equal to k + 1 and identify, in terms of the term rank of a matrix, a class of symmetric matrices that are related in the Bruhat order with one of these minimal matrices. (C) 2017 Elsevier Inc. All rights reserved.
Original languageEnglish
Pages (from-to)160-184
JournalLinear Algebra and its Applications
Volume530
DOIs
Publication statusPublished - 2017

Keywords

  • (0 , 1)-matrices
  • Bruhat order
  • Minimal matrices
  • Symmetric matrices
  • Term rank

Fingerprint Dive into the research topics of 'Minimal matrices in the Bruhat order for symmetric (0, 1)-matrices'. Together they form a unique fingerprint.

  • Cite this