Academia.edu no longer supports Internet Explorer.
To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser.
Commentationes Mathematicae Universitatis Carolinae
We investigate the perimeter of nonnegative integer matrices. We also charac- terize the linear operators which preserve the rank and perimeter of nonnegative integer matrices. That is, a linear operator T preserves the rank and perimeter of rank-1 ma- trices if and only if it has the form T(A )= P(A ◦ B)Q ,o rT(A )= P(At ◦ B)Q with appropriate permutation matrices P and Q and positive integer matrix B ,w here◦ denotes Hadamard product.
Journal of the Korean Mathematical Society, 2009
A rank one matrix can be factored as u t v for vectors u and v of appropriate orders. The perimeter of this rank one matrix is the number of nonzero entries in u plus the number of nonzero entries in v. A matrix of rank k is the sum of k rank one matrices. The perimeter of a matrix of rank k is the minimum of the sums of perimeters of the rank one matrices. In this article we characterize the linear operators that preserve perimeters of matrices over semirings.
Discussiones Mathematicae - General Algebra and Applications, 2003
For a rank-1 matrix A = a ⊗ b t over max algebra, we define the perimeter of A as the number of nonzero entries in both a and b. We characterize the linear operators which preserve the rank and perimeter of rank-1 matrices over max algebra. That is, a linear operator T preserves the rank and perimeter of rank-1 matrices if and only if it has the form T
Czechoslovak Mathematical Journal, 2006
Journal of the Korean Mathematical Society, 2004
For a Boolean rank-1 matrix A = ab t , we define the perimeter of A as the number of nonzero entries in both a and b. We characterize the Boolean linear operators that preserve rank and perimeter of Boolean rank-1 matrices.
Bulletin of the Korean Mathematical Society, 2008
For a Boolean rank 1 matrix A = ab t , we define the perimeter of A as the number of nonzero entries in both a and b. The perimeter of an m × n Boolean matrix A is the minimum of the perimeters of the rank-1 decompositions of A. In this article we characterize the linear operators that preserve the perimeters of Boolean matrices.
2020
Let A be an m × n matrix over nonnegative integers. The isolation number of A is the maximum number of isolated entries in A. We investigate linear operators that preserve the isolation number of matrices over nonnegative integers. We obtain that T is a linear operator that strongly preserve isolation number k for 1 ≤ k ≤ min{m,n} if and only if T is a (P,Q)-operator, that is, for fixed permutation matrices P and Q, T (A) = PAQ or, m = n and T (A) = PAtQ for any m× n matrix A, where At is the transpose of A.
Short proofs are given to various characterizations of the (circum-)Euclidean squared distance matrices. Linear preserver problems related to these matrices are discussed.
Linear Algebra and its Applications, 2012
The term rank of an n × n matrix A is the least number of lines (rows or columns) needed to include all the nonzero entries in A.
Linear Algebra and its Applications, 2013
This paper concerns three notions of matrix functions over semirings; term rank, reduced term rank and star cover number. We compare these matrix functions and we study those linear operators that preserve these matrix functions of n × n symmetric matrices with zero diagonal. In particular, we obtain important characterizations of term-rank (reduced term rank, star cover number) preservers with respect to a term rank (a reduced term rank, a star cover number, respectively) and a special matrix.
Communications of the Korean Mathematical Society, 2007
The maximal column rank of an m × n matrix A over the ring of integers, is the maximal number of the columns of A that are weakly independent. We characterize the linear operators that preserve the maximal column ranks of integer matrices.
Communications of the Korean Mathematical Society, 2005
The set of all m × n matrices with entries in Z + is denoted by Mm×n(Z+). We say that a linear operator T on Mm×n(Z+) is a (U, V)-operator if there exist invertible matrices U ∈ M m×m (Z +) and V ∈ M n×n (Z +) such that either T (X) = U XV for all X in Mm×n(Z+), or m = n and T (X) = U X t V for all X in Mm×n(Z+). In this paper we show that a linear operator T preserves the rank of matrices over the nonnegative integers if and only if T is a (U, V)operator. We also obtain other characterizations of the linear operator that preserves rank of matrices over the nonnegative integers.
2006
We characterize the linear operators which preserve the factor rank of integer matrices. That is, if M is the set of all m £ n matrices with entries in the integers and min(m;n) > 1, then a linear operator T on M preserves the factor rank of all matrices in M if and only if T has the form either T(X) = UXV for all X 2 M, or m = n and T(X) = UX t V for all X 2 M, where U and V are suitable nonsingular integer matrices. Other characterizations of factor rank-preservers of integer matrices are also given.
Kyungpook mathematical journal, 2013
In this paper, we consider the row rank inequalities derived from comparisons of the row ranks of the additions and multiplications of nonnegative integer matrices and construct the sets of nonnegative integer matrix pairs which is occurred at the extreme cases for the row rank inequalities. We characterize the linear operators that preserve these extreme sets of nonnegative integer matrix pairs * Corresponding Author.
Linear and Multilinear Algebra, 2017
A rank one matrix can be factored as uv t for vectors u and v of appropriate orders. The perimeter of this rank one matrix is the number of nonzero entries in u plus the number of nonzero entries in v. A matrix of rank k is the sum of k rank one matrices, a rank one decomposition. The perimeter of a matrix A of rank k is the minimum over all rank one of A of the sums of perimeters of the rank one matrices. The arctic rank of a matrix is one half the perimeter. In this article, we characterize the linear operators that preserve the symmetric arctic ranks of nonnegative symmetric matrices.
Linear Algebra and its Applications, 2007
Let m, n and k be positive integers such that 2 k < n m. Let V denote either the vector space of all m × n matrices over a field with at least three elements or the vector space of all n × n Hermitian matrices over a field F of characteristic / = 2 associated with an involution. We characterize surjective mappings T from V onto itself such that for every pair A, B ∈ V , rank(A -B) k if and only if rank(T (A) -T (B)) k.
Czechoslovak Mathematical Journal, 2000
Linear and Multilinear Algebra, 2001
We characterize those linear operators on triangular or diagonal matrices preserving the numerical range or radius.
Rocky Mountain Journal of Mathematics, 2006
Let A and B be n × n matrices. A classical result about the rank function is Sylvester's inequality which states that the rank of the product of AB is at most min{rank (A), rank (B)} and at least rank (A) + rank (B) − n. A generalization of Sylvester's inequality is Frobenius's inequality which states that rank (AB) + rank (BC) ≤ rank (ABC) + rank (B).
Proceedings of the American Mathematical Society, 1998
The maximal column rank of an m by n matrix over a semiring is the maximal number of the columns of A which are linearly independent. We characterize the linear operators which preserve the maximal column ranks of nonnegative integer matrices.
Electronic Journal of Linear Algebra
Let $\S$ denote the set of symmetric matrices over some semiring, $\s$. A line of $A\in\S$ is a row or a column of $A$. A star of $A$ is the submatrix of $A$ consisting of a row and the corresponding column of $A$. The term rank of $A$ is the minimum number of lines that contain all the nonzero entries of $A$. The star cover number is the minimum number of stars that contain all the nonzero entries of $A$. This paper investigates linear operators that preserve sets of symmetric matrices of specified term rank and sets of symmetric matrices of specific star cover numbers. Several equivalences to the condition that $T$ preserves the term rank of any matrix are given along with characterizations of a couple of types of linear operators that preserve certain sets of matrices defined by the star cover number that do not preserve all term ranks.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.