No label defined (Q5714835)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2239274
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2239274 |
Statements
16 December 2005
0 references
\(r\)-indecomposable matrix
0 references
generalized exponents
0 references
0.92600065
0 references
0 references
0.8994476
0 references
0.8955637
0 references
The author considers the properties of \(n\times n\) \(r\)-indecomposable Boolean matrices. Let \(B_n\) be the set of all \(n\times n\) Boolean matrices whose entries are \(0\) and \(1\). A matrix \(A\in B_n\) is \(r\)-indecomposable (\(-n<r<n\)) if it contains no \(k\times l\) submatrix with \(1\leq k\), \(l\leq n\) and \(k+l=n-r+1\). The author determines all the numbers attainable as the \(k\)th upper generalized exponents of \(n\times n\) \(r\)-indecomposable Boolean matrices with \(1\leq r,k<n\). Namely, Brualdi and Liu defined the \(k\)-upper generalized exponent \(F(A,k)\) as the smallest positive integer \(p\) such that there is no \(k\times1\) zero submatrix in \(A^p\). If \(A\) is an \(r\)-indecomposable matrix, where \(r\geq1\), \(1\leq k\leq n-r-1\), the author proves that \(F(A,K)\leq\lceil(n-k)/r\rceil\) and this bound is the best possible.
0 references