Let rY n be integers, Γn `r `n, An n Γ n Boolean matrix A is called r-indecomposable if it contains no k Γ l zero submatrix with k l n Γ r 1. A is primitive if one of its powers, e k , has all positive entries for some integer k P 1. If A is primitive, then there is a smallest positive integer h r e
Exponents of indecomposability
β Scribed by Jian Shen; David Gregory; Stewart Neufeld
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 1019 KB
- Volume
- 288
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
β¦ Synopsis
Let r, n be integers, -n < r < n. An n x n matrix A is called r-indecomposable if it contains no k x I zero submatrix with k + ! = n -r + 1. If A is primitive, then there is a smallest positive integer, h~.(A), such that A'" is r-indecomposable for all m >1 hi'.(A). The integer h,: (A) is called the strict exponent of r-indecomposability of the primitive matrix A. It refines the well-kno~n exponent, exp(A) = h,; j(,4).
Bruaidi and Liu (Czechoslovak Math. J. 4C 115 (1990)659-670; Proc. Amer. Math. Soc. 112 (4) (1991) 1193-1201) conjectured that h;j(A)<,[n"/4j and h~(.4) ~< L(n + 1)"/4]. We show that h~.(A) <~ max{I, s(n-s + r-1) + 1} where s is the smallest positive integer such that trace(A') > 0. This improves the conjectured bounds for h~ and hi.
π SIMILAR VOLUMES
but it is not true in general. In fhis paper we will give a necessary and sufficient condition for a cyclic code to be indecomposable, using its generator polynomial.
A graph is indecomposable if its complement is connected. If a graph is locally indecomposable, then it is typically indecomposable itself. Here we study the converse. Under what circumstances does global indecomposability force local indecomposability? The results are applied to a certain class of