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.
@article{bwmeta1.element.doi-10_1515_math-2016-0079, author = {Zhibin Du and Carlos M. da Fonseca}, title = {The Bruhat rank of a binary symmetric staircase pattern}, journal = {Open Mathematics}, volume = {14}, year = {2016}, pages = {832-840}, zbl = {1351.05039}, language = {en}, url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_1515_math-2016-0079} }
Zhibin Du; Carlos M. da Fonseca. The Bruhat rank of a binary symmetric staircase pattern. Open Mathematics, Tome 14 (2016) pp. 832-840. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_1515_math-2016-0079/