Bounds on the kth multi-g base index of nearly reducible sign pattern matrices

Li et al. [On the period and base of a sign pattern matrix, Linear Algebra Appl. 212/213 (1994) 101-120.] extended the concepts of the base and period from nonnegative matrices to powerful sign pattern matrices. Then, Shao and You [Bound on the basis of irreducible generalized sign pattern matrices, Linear Algebra Appl. 427 (2007) 285-300.] extended the concepts of the base from powerful sign pattern matrices to non-powerful irreducible sign pattern matrices. In this paper we mainly study the kth multi-g base index for non-powerful primitive nearly reducible sign pattern matrices. We obtain sharp upper bounds, together with a complete characterization of the equality cases of the kth multi-g base index for primitive nearly reducible generalized sign pattern matrices. We also show that there exist “gaps” in the kth multi-g base index set of the classes of such matrices.     

The kth lower bases of primitive non-powerful signed digraphs

In [J. Shao, L. You, H. Shan, Bound on the bases of irreducible generalized sign pattern matrices, Linear Algebra Appl. 427 (2007) 285-300], the authors extended the concept of the base from powerful sign pattern matrices to non-powerful irreducible sign pattern matrices. Recently, the kth local bases and the kth upper bases, which are generalizations of the bases, of primitive non-powerful signed digraphs were introduced. In this paper, we introduce a new parameter called the kth lower bases of primitive non-powerful signed digraphs and obtain some bounds for it. For some cases, the bounds we obtain are best possible and the extremal signed digraphs are characterized, respectively. Moreover, we show that there exist “gaps” in the kth lower bases set of primitive non-powerful signed digraphs.     

The Generalized <Emphasis Type="Italic">τ</Emphasis>-Bases of Primitive Non-Powerful Signed Digraphs with d Loops

Let n, k, τ, d be positive integers with 1 ≤ k, τ, d ≤ n. As natural extensions of the bases, the kth local bases, the kth upper bases and the kth lower bases of primitive non-powerful signed digraphs, we introduce a number of new, though, intimately related parameters called the generalized τ-bases of primitive non-powerful signed digraphs. Moreover, some sharp bounds for the generalized τ-bases of primitive non-powerful signed digraphs with n vertices and d loops are obtained, respectively.     

Primitive non-powerful sign pattern matrices with base 2

A sign pattern matrix M with zero trace is primitive non-powerful if for some positive integer k, M ^k ?=?J _#. The base l(M) of the primitive non-powerful matrix M is the smallest integer k. By considering the signed digraph S whose adjacent matrix is the primitive non-powerful matrix M, we will show that if l(M)?=?2, the minimum number of non-zero entries of M is 5n???8 or 5n???7 depending on whether n is even or odd.     

Bounds on the k-th generalized base of a primitive sign pattern matrix

You et al. [L. You, J. Shao, and H. Shan, Bounds on the bases of irreducible generalized sign pattern matrices, Lin. Alg. Appl. 427 (2007), pp. 285–300] extended the concept of the base of a powerful sign pattern matrix to the nonpowerful, irreducible sign pattern matrices. The key to their generalization was to view the relationship A ^l =A ^l?+?p as an equality of generalized sign patterns rather than of sign patterns. You, Shao and Shan showed that for primitive generalized sign patterns, the base is the smallest positive integer k such that all entries of A ^k are ambiguous. In this paper we study the k-th generalized base for nonpowerful primitive sign pattern matrices. For a primitive, nonpowerful sign pattern A, this is the smallest positive integer h such that A^k has h rows consisting entirely of ambiguous entries. Extending the work of You, Shao and Shan, we obtain sharp upper bounds on the k-th generalized base, together with a complete characterization of the equality cases for those bounds. We also show that there exist gaps in the k-th generalized base set of the classes of such matrices.     

Local bases of primitive non-powerful signed digraphs

In 1994, Z. Li, F. Hall and C. Eschenbach extended the concept of the index of convergence from nonnegative matrices to powerful sign pattern matrices. Recently, Jiayu Shao and Lihua You studied the bases of non-powerful irreducible sign pattern matrices. In this paper, the local bases, which are generalizations of the base, of primitive non-powerful signed digraphs are introduced, and sharp bounds for local bases of primitive non-powerful signed digraphs are obtained. Furthermore, extremal digraphs are described.     

The kth upper and lower bases of primitive nonpowerful minimally strong signed digraphs

In this article, we study the kth upper and lower bases of primitive nonpowerful minimally strong signed digraphs. A bound on the kth upper bases for primitive nonpowerful minimally strong signed digraphs is obtained, and the equality case of the bound is characterized. For the kth lower bases, we obtain some bounds. For some cases, the bounds are best possible and the extremal signed digraphs are characterized. We also show that there exist ‘gaps’ in both the kth upper base set and the kth lower base set of primitive nonpowerful minimally strong signed digraphs.     

Primitive non-powerful symmetric loop-free signed digraphs with given base and minimum number of arcs

In [B.M. Kim, B.C. Song, W. Hwang, Primitive graphs with given exponents and minimum number of edges, Linear Algebra Appl. 420 (2007) 648-662], the minimum number of edges of a simple graph on n vertices with exponent k was determined. In this paper, we completely determine the minimum number, H(n,k), of arcs of primitive non-powerful symmetric loop-free signed digraphs on n vertices with base k, characterize the underlying digraphs which have H(n,k) arcs when k is 2, nearly characterize the case when k is 3 and propose an open problem.     

The base sets of primitive zero-symmetric sign pattern matrices

In [J.Y. Shao, L.H. You, Bound on the base of irreducible generalized sign pattern matrices, Discrete Math., in press], Shao and You extended the concept of the base from powerful sign pattern matrices to non-powerful (and generalized) sign pattern matrices. In this paper, we study the bases of primitive zero-symmetric sign pattern (and generalized sign pattern) matrices. Sharp upper bounds of the bases are obtained. We also show that there exist no “gaps” in the base sets of the classes of such matrices.     

Matrices with maximum kth local exponent in the class of doubly symmetric primitive matrices

Let A be a primitive matrix of order n, and let k be an integer with 1?k?n. The kth local exponent of A, is the smallest power of A for which there are k rows with no zero entry. We have recently obtained the maximum value for the kth local exponent of doubly symmetric primitive matrices of order n with 1?k?n. In this paper, we use the graph theoretical method to give a complete characterization of those doubly symmetric primitive matrices whose kth local exponent actually attain the maximum value.     

Complete reducibility of subgroups of reductive algebraic groups over nonperfect fields II

Let k be a separably closed field. Let G be a reductive algebraic k-group. We study Serre’s notion of complete reducibility of subgroups of G over k. In particular, using the recently proved center conjecture of Tits, we show that the centralizer of a k-subgroup H of G is G-completely reducible over k if it is reductive and H is G-completely reducible over k. We show that a regular reductive k-subgroup of G is G-completely reducible over k. We present examples where the number of overgroups of irreducible subgroups and the number of G(k)-conjugacy classes of k-anisotropic unipotent elements are infinite.     

Powerful arithmetic progressions

We give a complete characterization of so-called powerful arithmetic progressions, i.e. of progressions whose kth term is a kth power for all k. We also prove that the length of any primitive arithmetic progression of powers can be bounded both by any term of the progression different from 0 and ±1, and by its common difference. In particular, such a progression can have only finite length.     

Gaps in the base set of primitive nonpowerful sign patterns

For a primitive nonpowerful square sign pattern A, the base of A, denoted by l(A), is the least positive integer l such that every entry of A ^l is #. In this article, we consider the base set of the primitive nonpowerful sign pattern matrices. Some useful results about the bases for the sign pattern matrices are presented there. Some special sign pattern matrices with given bases are characterized and more ‘gaps’ in the base set are shown.     

Imprimitive non-powerful sign pattern matrices with maximum base

You et al. [L.H. You, J.Y. Shao, and H.Y. Shan, Bounds on the bases of irreducible generalized sign pattern matrices, Linear Algebra Appl. 427 (2007), pp. 285–300], obtained an upper bound of the bases for imprimitive non-powerful sign pattern matrices. In this article, we characterize those imprimitive non-powerful sign pattern matrices whose bases reach this upper bound.     

On reducible matrix patterns

A tool to study the inertias of reducible nonzero (resp. sign) patterns is presented. Sumsets are used to obtain a list of inertias attainable by the pattern 𝒜 ⊕ ? dependent upon inertias attainable by patterns 𝒜 and ?. It is shown that if ? is a pattern of order n, and 𝒜 is an inertially arbitrary pattern of order at least 2(n ? 1), then 𝒜 ⊕ ? is inertially arbitrary if and only if ? allows the inertias (0, 0, n), (0, n, 0) and (n, 0, 0). We illustrate how to construct other reducible inertially (resp. spectrally) arbitrary patterns from an inertially (resp. spectrally) arbitrary pattern 𝒜 ⊕ ?, by replacing 𝒜 with an inertially (resp. spectrally) arbitrary pattern 𝒮. We identify reducible inertially (resp. spectrally) arbitrary patterns of the smallest orders that contain some irreducible components that are not inertially (resp. spectrally) arbitrary. It is shown there exist nonzero (resp. sign) patterns 𝒜 and ? of orders 4 and 5 (resp. 4 and 4) such that both 𝒜 and ? are non-inertially-arbitrary, and 𝒜 ⊕ ? is inertially arbitrary.     

Complete reducibility of subgroups of reductive algebraic groups over nonperfect fields III

Let G be a reductive group over a nonperfect field k. We study rationality problems for Serre’s notion of complete reducibility of subgroups of G. In our previous work, we constructed examples of subgroups H of G that are G-completely reducible but not G-completely reducible over k (and vice versa). In this article, we give a theoretical underpinning of those constructions. Then using Geometric Invariant Theory, we obtain a new result on the structure of G(k)-(and G-) orbits in an arbitrary affine G-variety. We discuss several related problems to complement the main results.     

Factorization of Trinomials over Galois Fields of Characteristic 2

We study the parity of the number of irreducible factors of trinomials over Galois fields of characteristic 2. As a consequence, some sufficient conditions for a trinomial being reducible are obtained. For example,xⁿ+ax^k+bGF(2^t)[x] is reducible if bothn,tare even, except possibly whenn= 2k,kodd. The caset= 1 was treated by R. G. Swan (Pacific J. Math.12,No. 2 (1962), 1099–1106), who showed thatxⁿ+x^k+ 1 is reducible overGF(2) if 8|n.     

Inverting the Motivic Bott Element

We prove a version for motivic cohomology of Thomason's theorem on Bott-periodic K-theory, namely, that for a field k containing the nth roots of unity, the mod n motivic cohomology of a smooth k-scheme agrees with mod n étale cohomology, after inverting the element in H⁰(k,(1)) corresponding to a primitive nth root of unity.     

A Note on Lewin’s Problem

The parameter l(G) for a primitive digraph G introduced by Lewin is the minimum positive integer k for which there are walks of both lengths k and k + 1 from some vertex u to some vertex v. We obtain upper bounds on l(G) if G is primitive ministrong, or G is just primitive and not necessarily ministrong, or G is primitive symmetric. We also discuss the numbers attainable as l(G).AMS Subject Classification (2000): 05C20, 15A48Partially supported by the National Natural Science Foundation of China (19771040) and the Guangdong Provincial Natural Science Foundation of China (990447).     

Cubic and symmetric compositions over rings

We consider generalized symmetric compositions over a ring k on the one hand, and unital algebras with multiplicative cubic forms on the other. Given a primitive sixth root of unity in k, we construct functors between these categories which are equivalences if 3 is a unit in k. This extends to arbitrary base rings, and with new proofs, results of Elduque and Myung on non-degenerate symmetric compositions and separable alternative algebras of degree 3 over fields. It also answers a problem posed in “The Book of Involutions” [Knus et al.: American Mathematical Society Colloquium Publications, vol. 44. American Mathematical Society, Providence, RI (1998), 34.26].