Sign patterns that require almost unique rank

A sign pattern matrix is a matrix whose entries are from the set {+,-,0}. For a real matrix B, sgn(B) is the sign pattern matrix obtained by replacing each positive (respectively, negative, zero) entry of B by + (respectively, −, 0). For a sign pattern matrix A, the sign pattern class of A, denoted Q(A), is defined as {B:sgn(B)=A}. The minimum rank mr(A) (maximum rank MR(A)) of a sign pattern matrix A is the minimum (maximum) of the ranks of the real matrices in Q(A). Several results concerning sign patterns A that require almost unique rank, that is to say, the sign patterns A such that MR(A) = mr(A) + 1, are established and are extended to sign patterns A for which the spread is d=MR(A)-mr(A). A complete characterization of the sign patterns that require almost unique rank is obtained.     

r-Numbers completion problems of partial upper canonical form I

A pair (A, B), where A is an n × n matrix and B is an n × m matrix, is said to have the nonnegative integers sequence {r_j}_j=1^p as the r-numbers sequence if r₁ = rank(B) and r_j = rank[B AB … A^j−1 B] − rank[B AB … A^j−2B], 2 ≤ j ≤ p. Given a partial upper triangular matrix A of size n × n in upper canonical form and an n × m matrix B, we develop an algorithm that obtains a completion A_c of A, such that the pair (A^c, B) has an r-numbers sequence prescribed under some restrictions.     

Linear maps preserving pairs of Hermitian matrices on which the rank is additive and applications

Denote the set ofn×n complex Hermitian matrices byH _n . A pair ofn×n Hermitian matrices (A, B) is said to be rank-additive if rank (A+B)=rankA+rankB. We characterize the linear maps fromH _n into itself that preserve the set of rank-additive pairs. As applications, the linear preservers of adjoint matrix onH _n and the Jordan homomorphisms ofH _n are also given. The analogous problems on the skew Hermitian matrix space are considered.     

Eine Bemerkung zu einem Satz von W. Hahn aus der Stabilitätstheorie linearer Systeme

A short proof of the following theorem ofW. Hahn is given: LetP be a real n×n matrix,B=1/2(P+P ^T ),A=1/2(P?P ^T ) and letB be negative semidefinite. All eigenvalues ofA have negative real parts if and only if, rank (B, AB, ..., A ^n?1 B)=n.     

Preservers of pairs of bivectors with bounded distance

We extend Liu’s fundamental theorem of the geometry of alternate matrices to the second exterior power of an infinite dimensional vector space and also use her theorem to characterize surjective mappings T from the vector space V of all n×n alternate matrices over a field with at least three elements onto itself such that for any pair A, B in V, rank(A-B)?2k if and only if rank(T(A)-T(B))?2k, where k is a fixed positive integer such that n?2k+2 and k?2.     

Uniform and minimal {0,1} – cp matrices

Let A be an n?×?n real matrix. A is called {0,1}-cp if it can be factorized as A?=?BB ^T with b_ij =0 or 1. The smallest possible number of columns of B in such a factorization is called the {0,1}-rank of A. A {0,1}-cp matrix A is called minimal if for every nonzero nonnegative n?×?n diagonal matrix D, A-D is not {0,1}-cp, and r-uniform if it can be factorized as A=BB ^T, where B is a (0,?1) matrix with r 1s in each column. In this article, we first present a necessary condition for a nonsingular matrix to be {0,1}-cp. Then we characterize r-uniform {0,1}-cp matrices. We also obtain some necessary conditions and sufficient conditions for a matrix to be minimal {0,1}-cp, and present some bounds for {0,1}-ranks.     

The primitive Boolean matrices with the second largest scrambling index by Boolean rank

The scrambling index of an n × n primitive Boolean matrix A is the smallest positive integer k such that A ^k (A ^T) ^k = J, where A ^T denotes the transpose of A and J denotes the n×n all ones matrix. For an m×n Boolean matrix M, its Boolean rank b(M) is the smallest positive integer b such that M = AB for some m × b Boolean matrix A and b×n Boolean matrix B. In 2009, M. Akelbek, S. Fital, and J. Shen gave an upper bound on the scrambling index of an n×n primitive matrix M in terms of its Boolean rank b(M), and they also characterized all primitive matrices that achieve the upper bound. In this paper, we characterize primitive Boolean matrices that achieve the second largest scrambling index in terms of their Boolean rank.     

Simultaneous triangularization of a pair of matrices whose commutator has rank two

Let A,B be n×n matrices with entries in an algebraically closed field F of characteristic zero, and let C=AB?BA. It is shown that if C has rank two and AⁱB^jC^k is nilpotent for 0?i, j?n?1, 1?k?2, then A, B are simultaneously triangularizable over F. An example is given to show that this result is in some sense best possible.     

Bijective linear maps on semimodules spanned by Boolean matrices of fixed rank

Let M_m,n(B) be the semimodule of all m×n Boolean matrices where B is the Boolean algebra with two elements. Let k be a positive integer such that 2?k?min(m,n). Let B(m,n,k) denote the subsemimodule of M_m,n(B) spanned by the set of all rank k matrices. We show that if T is a bijective linear mapping on B(m,n,k), then there exist permutation matrices P and Q such that T(A)=PAQ for all A∈B(m,n,k) or m=n and T(A)=PA^tQ for all A∈B(m,n,k). This result follows from a more general theorem we prove concerning the structure of linear mappings on B(m,n,k) that preserve both the weight of each matrix and rank one matrices of weight k². Here the weight of a Boolean matrix is the number of its nonzero entries.     

Matrices with different Gondran–Minoux and determinantal ranks over max-algebras

Let GMr(A) be the row Gondran–Minoux rank of a matrix, GMc(A) be the column Gondran–Minoux rank, and d(A) be the determinantal rank, respectively. The following problem was posed by M. Akian, S. Gaubert, and A. Guterman: Find the minimal numbers m and n such that there exists an (m × n)-matrix B with different row and column Gondran–Minoux ranks. We prove that in the case GMr(B) > GMc(B) the minimal m and n are equal to 5 and 6, respectively, and in the case GMc(B) > GMr(B) the numbers m = 6 and n = 5 are minimal. An example of a matrix $ A \in {\mathcal{M}_{5 \times 6}}\left( {{\mathbb{R}_{\max }}} \right) $ such that GMr(A) = GMc(A ^t) = 5 and GMc(A) = GMr(A ^t) = 4 is provided. It is proved that p = 5 and q = 6 are the minimal numbers such that there exists an (p×q)-matrix with different row Gondran–Minoux and determinantal ranks.     

Moufang polygons and irreducible spherical BN-pairs of rank 2, I

Let G be a group with an irreducible spherical BN-pair of rank 2 satisfying the additional condition: (∗) There exists a normal nilpotent subgroup U of B with B=TU, where T=B∩N and |W|≠16 for the Weyl group W=N/B∩N. We show that G corresponds to a Moufang polygon and hence is essentially known.     

On products of two nilpotent subgroups of a finite group

LetG be a finite group with an abelian Sylow 2-subgroup. LetA be a nilpotent subgroup ofG of maximal order satisfying class (A)≦k, wherek is a fixed integer larger than 1. Suppose thatA normalizes a nilpotent subgroupB ofG of odd order. ThenAB is nilpotent. Consequently, ifF(G) is of odd order andA is a nilpotent subgroup ofG of maximal order, thenF(G)?A.     

On a conjecture of ōshima

The set of homotopy classes of self maps of a compact, connected Lie group G is a group by the pointwise multiplication which we denote by H(G), and it is known to be nilpotent. ōshima [H. ōshima, Self homotopy group of the exceptional Lie group G₂, J. Math. Kyoto Univ. 40 (1) (2000) 177-184] conjectured: if G is simple, then H(G) is nilpotent of class ?rankG. We show this is true for PU(p) which is the first high rank example.     

Jordan forms for mutually annihilating nilpotent pairs

In this paper we completely characterize all possible pairs of Jordan canonical forms for mutually annihilating nilpotent pairs, i.e. pairs (A,B) of nilpotent matrices such that AB=BA=0.     

Numerical solution to low rank perturbed Lyapunov equations by the sign function method

We investigate the numerical solution to a low rank perturbed Lyapunov equation A^TX + XA = W via the sign function method (SFM). The sign function method has been proposed to solve Lyapunov equations, see e.g. [1], but here we focus on a framework where the matrix A has a special structure, i. e. A = B + UCV^T , where B is a blockdiagonal matrix and UCV^T is a low rank perturbation. We show that this structure can be kept throughout the sign function iteration but the rank of the perturbation doubles per iteration. Therefore, we apply a low rank approximation to the perturbation in order to keep its numerical rank small. We compare the standard SFM with its structure preserving variant presented in this paper by means of numerical examples from viscously damped mechanical systems. (© 2016 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Linear operators that preserve Boolean rank of Boolean matrices

The Boolean rank of a nonzero m × n Boolean matrix A is the minimum number k such that there exist an m× k Boolean matrix B and a k × n Boolean matrix C such that A = BC. In the previous research L. B. Beasley and N. J. Pullman obtained that a linear operator preserves Boolean rank if and only if it preserves Boolean ranks 1 and 2. In this paper we extend this characterizations of linear operators that preserve the Boolean ranks of Boolean matrices. That is, we obtain that a linear operator preserves Boolean rank if and only if it preserves Boolean ranks 1 and k for some 1 < k ? m.     

A two-dimensional matrix Padé-type approximation in the inner product space

By introducing a bivariate matrix-valued linear functional on the scalar polynomial space, a general two-dimensional (2-D) matrix Padé-type approximant (BMPTA) in the inner product space is defined in this paper. The coefficients of its denominator polynomials are determined by taking the direct inner product of matrices. The remainder formula is developed and an algorithm for the numerator polynomials is presented when the generating polynomials are given in advance. By means of the Hankel-like coefficient matrix, a determinantal expression of BMPTA is presented. Moreover, to avoid the computation of the determinants, two efficient recursive algorithms are proposed. At the end the method of BMPTA is applied to partial realization problems of 2-D linear systems.     

Self-pure-generators over Dedekind domains

We prove that all pure submodules of a finite rank torsion-free module A over a Dedekind domain are A-generated (i.e. A is a self-pure-generator) if and only if A has a rank 1 direct summand B such that $\mathbf{type}(B)$ is the inner type of A. This result is applied to describe the direct products of torsion-free groups of finite rank which are self-pure-generators.     

On a particular case of the inconsistent linear matrix equation AX+YB=C

We consider the linear matrix equation AX+YB=C where A,B, and C are given matrices of dimensions (r+1)×r, s×(s+1), and (r+1)×(s+1), respectively, and rank A = r, rank B = s. We give a connection between the least-squares solution and the solution which minimizes an arbitrary norm of the residual matrix C?AX? YB.