2024
DOI: 10.1016/j.laa.2023.07.021
|View full text |Cite
|
Sign up to set email alerts
|

123-avoiding doubly stochastic matrices

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
5
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(5 citation statements)
references
References 15 publications
0
5
0
Order By: Relevance
“…Thus, all minimal blockers are minimum. 123-forcing matrices and blockers of 123-avoiding permutation matrices have been previously investigated in [3,2,1].…”
Section: Introductionmentioning
confidence: 99%
See 4 more Smart Citations
“…Thus, all minimal blockers are minimum. 123-forcing matrices and blockers of 123-avoiding permutation matrices have been previously investigated in [3,2,1].…”
Section: Introductionmentioning
confidence: 99%
“…We call these permutation matrices cyclic-Hankel permutation matrices or cyclic-Hankel diagonals. The cyclic-Hankel decomposition is illustrated for n = 6 using letters a, b, c, d, e, f below: Lemma 1.1 (Lemma 2.2 in [3]). The number of 0's in an n × n 123-forcing (0, 1)-matrix is at least n. An n × n 123-forcing (0, 1)-matrix with exactly n 0's contains exactly one 0 from each cyclic-Hankel permutation matrix.…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations