A class of unary semigroups admitting a Rees matrix representation

In Billhardt et al. (Semigroup Forum 79:101–118, 2009) the authors introduced the notion of an associate inverse subsemigroup of a regular semigroup, extending the concept of an associate subgroup of a regular semigroup, first presented in Blyth et al. (Glasgow Math. J. 36:163–171, 1994). The main result of the present paper, Theorem 2.15, establishes that a regular semigroup S with an associate inverse subsemigroup S ^? satisfies three simple identities if and only if it is isomorphic to a generalised Rees matrix semigroup M(T;A,B;P), where T is a Clifford semigroup, A and B are bands, with common associate inverse subsemigroup E(T) satisfying the referred identities, and P is a sandwich matrix satisfying some natural conditions. If T is a group and A, B are left and right zero semigroups, respectively, then the structure described provides a usual Rees matrix semigroup with normalised sandwich matrix, thus generalising the Rees matrix representation for completely simple semigroups.     

M-matrices leading to semiconvergent splittings

An M-matrix as defined by Ostrowski is a matrix that can be split into A = sI ? B, s > 0, B ? 0 with s ? ρ(B), the spectral radius of B. M-matrices with the property that the powers of T = (1/s)B converge for some s are studied and are characterized here in terms of the nonnegativity of the group generalized inverse of A on the range space of A, extending the well-known property that A^{? 1} ? 0 whenever A is nonsingular.     

Linear mappings derivable at some nontrivial elements

Suppose that A is an algebra and M is an A-bimodule. Let A be any element in A. A linear mapping δ from A into M is said to be derivable at A if δ(ST)=δ(S)T+Sδ(T) for any S,T in A with ST=A. Given an algebra A, such as a non-abelian von Neumann algebra or an irreducible CDCSL algebra on a Hilbert space H with dimH?2, we show that there exists a nontrivial idempotent P in A such that for any Q∈PAP which is invertible in PAP, every linear mapping derivable at Q from A into some unital A-bimodule (for example, A or B(H)) is derivation.     

Solving balanced Procrustes problem with some constraints by eigenvalue decomposition

The balanced Procrustes problem with some special constraints such as symmetric orthogonality and symmetric idempotence are considered. By one time eigenvalue decomposition of the matrix product generated by the matrices A and B, the constrained solutions are constructed simply. Similar strategy is applied to the problem with the corresponding P-commuting constraints with a given symmetric matrix P. Numerical examples are presented to show the efficiency of the proposed methods.     

Addition requirements for matrix and transposed matrix products

Let M be an s × t matrix and let M^T be the transpose of M. Let x and y be t- and s-dimensional indeterminate column vectors, respectively. We show that any linear algorithm A that computes Mx has associated with it a natural dual linear algorithm denoted A^T that computes M^Ty. Furthermore, if M has no zero rows or columns then the number of additions used by A^T exceeds the number of additions used by A by exactly s − t. In addition, a strong correspondence is established between linear algorithms that compute the product Mx and bilinear algorithms that compute the bilinear form y^TMx.     

Factorization of cp-rank-3 completely positive matrices

A symmetric positive semi-definite matrix A is called completely positive if there exists a matrix B with nonnegative entries such that A = BB^?. If B is such a matrix with a minimal number p of columns, then p is called the cp-rank of A. In this paper we develop a finite and exact algorithm to factorize any matrix A of cp-rank 3. Failure of this algorithm implies that A does not have cp-rank 3. Our motivation stems from the question if there exist three nonnegative polynomials of degree at most four that vanish at the boundary of an interval and are orthonormal with respect to a certain inner product.     

Products of nilpotent matrices

We show that any complex singular square matrix T is a product of two nilpotent matrices A and B with rank A = rank B = rank T except when T is a 2×2 nilpotent matrix of rank one.     

Elementary operators on self-adjoint operators

Let H be a Hilbert space and let A and B be standard ∗-operator algebras on H. Denote by As and Bs the set of all self-adjoint operators in A and B, respectively. Assume that and are surjective maps such that M(AM^∗(B)A)=M(A)BM(A) and M^∗(BM(A)B)=M^∗(B)AM^∗(B) for every pair A∈As, B∈Bs. Then there exist an invertible bounded linear or conjugate-linear operator and a constant c∈{−1,1} such that M(A)=cTAT^∗, A∈As, and M^∗(B)=cT^∗BT, B∈Bs.     

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.     

Elementary divisors of s-symmetric matrices

Let A be an n X n matrix over a field of characteristic 2. If n is odd, then A is similar to an s-symmetric matrix (one symmetric around the diagonal from lower left to upper right). If n is even, this holds iff the elementary divisors of A that are odd powers of separable polynomials occur with even multiplicity. The proof uses the structure theory for pairs consisting of an inner product and a self-adjoint mapping for that inner product.     

Sensitivity of convergent matrices and polynomials

A matrix A is said to be convergent if and only if all its characteristic roots have modulus less than unity. When A is real an explicit expression is given for real matrices B such that A + B is also convergent, this expression depending upon the solution of a quadratic matrix equation of Riccati type. If A and A + B are taken to be in companion form, then the result becomes one of convergent polynomials (i.e., polynomials whose roots have modulus less then unity), and is much easier to apply. A generalization is given for the case when A and A + B are complex and have the same number of roots inside and outside a general circle.     

On the polynomial of a path

Let A(P_n) be the adjacency matrix of the path on n vertices. Suppose that r(λ) is a polynomial of degree less than n, and consider the matrix M = r(A>/(P_n)). We determine all polynomials for which M is the adjacency matrix of a graph.     

Linear preservers of row-dense matrices

Let M_m,n be the set of all m × n real matrices. A matrix A ∈ M_m,n is said to be row-dense if there are no zeros between two nonzero entries for every row of this matrix. We find the structure of linear functions T: M_m,n → M_m,n that preserve or strongly preserve row-dense matrices, i.e., T(A) is row-dense whenever A is row-dense or T(A) is row-dense if and only if A is row-dense, respectively. Similarly, a matrix A ∈ M_n,m is called a column-dense matrix if every column of A is a column-dense vector. At the end, the structure of linear preservers (strong linear preservers) of column-dense matrices is found.     

Properties of Hadamard product of inverse M‐matrices

This paper concerns with the properties of Hadamard product of inverse M‐matrices. Structures of tridiagonal inverse M‐matrices and Hessenberg inverse M‐matrices are analysed. It is proved that the product A ○ A^T satisfies Willoughby's necessary conditions for being an inverse M‐matrix when A is an irreducible inverse M‐matrix. It is also proved that when A is either a Hessenberg inverse M‐matrix or a tridiagonal inverse M‐matrix then A ○ A^T is an inverse M‐matrix. Based on these results, the conjecture that A ○ A^T is an inverse M‐matrix when A is an inverse M‐matrix is made. Unfortunately, the conjecture is not true. Copyright © 2004 John Wiley Sons, Ltd.     

On derivable mappings

A linear mapping δ from an algebra A into an A-bimodule M is called derivable at c∈A if δ(a)b+aδ(b)=δ(c) for all a,b∈A with ab=c. For a norm-closed unital subalgebra A of operators on a Banach space X, we show that if C∈A has a right inverse in B(X) and the linear span of the range of rank-one operators in A is dense in X then the only derivable mappings at C from A into B(X) are derivations; in particular the result holds for all completely distributive subspace lattice algebras, J-subspace lattice algebras, and norm-closed unital standard algebras of B(X). As an application, every Jordan derivation from such an algebra into B(X) is a derivation. For a large class of reflexive algebras A on a Banach space X, we show that inner derivations from A into B(X) can be characterized by boundedness and derivability at any fixed C∈A, provided C has a right inverse in B(X). We also show that if A is a canonical subalgebra of an AF C^∗-algebra B and M is a unital Banach A-bimodule, then every bounded local derivation from A into M is a derivation; moreover, every bounded linear mapping from A into B that is derivable at the unit I is a derivation.     

Rational spectral transformations and orthogonal polynomials

We show that generic rational transformations of the Stieltjes function with polynomial coefficients (ST) can be presented as a finite superposition of four fundamental elementary transforms: Christoffel transform (CT), Geronimus transform (GT) and forward and backward associated transformations A⁺T, A⁻T. It is shown that the Laguerre-Hahn polynomials (LHP) on arbitrary nonuniform lattice are covariant with respect to ST (i.e., ST of a LHP yields another LHP), whereas the semi-classical polynomials are covariant with respect to a subclass of linear ST. Some applications of these results to the theory of the semi-classical polynomials are considered.     

KKM-type theorems for best proximity points

Let us consider two nonempty subsets A,B of a normed linear space X, and let us denote by 2^B the set of all subsets of B. We introduce a new class of multivalued mappings {T:A→2^B}, called R-KKM mappings, which extends the notion of KKM mappings. First, we discuss some sufficient conditions for which the set ∩{T(x):x∈A} is nonempty. Using this nonempty intersection theorem, we attempt to prove a extended version of the Fan-Browder multivalued fixed point theorem, in a normed linear space setting, by providing an existence of a best proximity point.     

Linear transformations on symmetric matrices that preserve the permanent

It is shown that if a linear transformation T on the space of n-square symmetric matrices over any subfield of the real field preserves the permanent, where n ? 3, then T(A)= ± PAP^t for all symmetric matrices A and a fixed generalized permutation matrix P with per P= ± 1.     

Factorization of symmetric singular M-matrices

Suppose A is a symmetric, singular M-matrix. A sufficient condition for A to have a triangular, singular M-matrix factorization is given, and it is shown that PAP^T always has such a factorization for a particular permutation matrix P.     

Imbedding conditions for λ-matrices

We say that A(λ) is λ-imbeddable in B(λ) whenever B(λ) is equivalent to a λ-matrix having A(λ) as a submatrix. In this paper we solve the problem of finding a necessary and sufficient condition for A(λ) to be λ-imbeddable in B(λ). The solution is given in terms of the invariant polynomials of A(λ) and B(λ). We also solve an analogous problem when A(λ) and B(λ) are required to be equivalent to regular λ-matrices. As a consequence we give a necessary and sufficient condition for the existence of a matrix B, over a field F, with prescribed similarity invariant polynomials and a prescribed principal submatrix A.