The Bruhat rank of a binary symmetric staircase pattern

The Bruhat rank of a binary symmetric staircase pattern

In this work we show that the Bruhat rank of a symmetric (0,1)-matrix of order n with a staircase pattern, total support, and containing In, is at most 2. Several other related questions are also discussed. Some illustrative examples are presented.

Bibliographic Details
Main Authors: Du Zhibin, da Fonseca Carlos M.
Format: Article
Language:English
Published: De Gruyter 2016-01-01
Series:Open Mathematics
Subjects:
permutation matrix
bruhat order
bruhat shadow
bruhat rank
inversion
05b20
06a07
15a36
Online Access:http://www.degruyter.com/view/j/math.2016.14.issue-1/math-2016-0079/math-2016-0079.xml?format=INT
Description
Summary:In this work we show that the Bruhat rank of a symmetric (0,1)-matrix of order n with a staircase pattern, total support, and containing In, is at most 2. Several other related questions are also discussed. Some illustrative examples are presented.
ISSN:2391-5455

Similar Items