Displaying 41 – 60 of 111

Showing per page

Linear operators preserving maximal column ranks of nonbinary boolean matrices

Seok-Zun Song, Sung-Dae Yang, Sung-Min Hong, Young-Bae Jun, Seon-Jeong Kim (2000)

Discussiones Mathematicae - General Algebra and Applications

The maximal column rank of an m by n matrix is the maximal number of the columns of A which are linearly independent. We compare the maximal column rank with rank of matrices over a nonbinary Boolean algebra. We also characterize the linear operators which preserve the maximal column ranks of matrices over nonbinary Boolean algebra.

Linear operators that preserve Boolean rank of Boolean matrices

LeRoy B. Beasley, Seok-Zun Song (2013)

Czechoslovak Mathematical Journal

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 = B C . 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...

Linear operators that preserve graphical properties of matrices: isolation numbers

LeRoy B. Beasley, Seok-Zun Song, Young Bae Jun (2014)

Czechoslovak Mathematical Journal

Let A be a Boolean { 0 , 1 } matrix. The isolation number of A is the maximum number of ones in A such that no two are in any row or any column (that is they are independent), and no two are in a 2 × 2 submatrix of all ones. The isolation number of A is a lower bound on the Boolean rank of A . A linear operator on the set of m × n Boolean matrices is a mapping which is additive and maps the zero matrix, O , to itself. A mapping strongly preserves a set, S , if it maps the set S into the set S and the complement of...

Linear preservers of row-dense matrices

Sara M. Motlaghian, Ali Armandnejad, Frank J. Hall (2016)

Czechoslovak Mathematical Journal

Let 𝐌 m , n be the set of all m × n real matrices. A matrix A 𝐌 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 , n 𝐌 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 𝐌 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...

Linear Transformations of Euclidean Topological Spaces

Karol Pąk (2011)

Formalized Mathematics

We introduce linear transformations of Euclidean topological spaces given by a transformation matrix. Next, we prove selected properties and basic arithmetic operations on these linear transformations. Finally, we show that a linear transformation given by an invertible matrix is a homeomorphism.

Linear transforms supporting circular convolution over a commutative ring with identity

Mohamed Mounir Nessibi (1995)

Commentationes Mathematicae Universitatis Carolinae

We consider a commutative ring R with identity and a positive integer N . We characterize all the 3-tuples ( L 1 , L 2 , L 3 ) of linear transforms over R N , having the “circular convolution” property, i.eṡuch that x * y = L 3 ( L 1 ( x ) L 2 ( y ) ) for all x , y R N .

Maps on matrices that preserve the spectral radius distance

Rajendra Bhatia, Peter Šemrl, A. Sourour (1999)

Studia Mathematica

Let ϕ be a surjective map on the space of n×n complex matrices such that r(ϕ(A)-ϕ(B))=r(A-B) for all A,B, where r(X) is the spectral radius of X. We show that ϕ must be a composition of five types of maps: translation, multiplication by a scalar of modulus one, complex conjugation, taking transpose and (simultaneous) similarity. In particular, ϕ is real linear up to a translation.

Maximal column rank preservers of fuzzy matrices

Seok-Zun Song, Soo-Roh Park (2001)

Discussiones Mathematicae - General Algebra and Applications

This paper concerns two notions of rank of fuzzy matrices: maximal column rank and column rank. We investigate the difference of them. We also characterize the linear operators which preserve the maximal column rank of fuzzy matrices. That is, a linear operator T preserves maximal column rank if and only if it has the form T(X) = UXV with some invertible fuzzy matrices U and V.

Multiplicative maps that are close to an automorphism on algebras of linear transformations

L. W. Marcoux, H. Radjavi, A. R. Sourour (2013)

Studia Mathematica

Let be a complex, separable Hilbert space of finite or infinite dimension, and let ℬ() be the algebra of all bounded operators on . It is shown that if φ: ℬ() → ℬ() is a multiplicative map(not assumed linear) and if φ is sufficiently close to a linear automorphism of ℬ() in some uniform sense, then it is actually an automorphism; as such, there is an invertible operator S in ℬ() such that φ ( A ) = S - 1 A S for all A in ℬ(). When is finite-dimensional, similar results are obtained with the mere assumption that there...

Non-linear maps preserving ideals on a parabolic subalgebra of a simple algebra

Deng Yin Wang, Haishan Pan, Xuansheng Wang (2010)

Czechoslovak Mathematical Journal

Let 𝒫 be an arbitrary parabolic subalgebra of a simple associative F -algebra. The ideals of 𝒫 are determined completely; Each ideal of 𝒫 is shown to be generated by one element; Every non-linear invertible map on 𝒫 that preserves ideals is described in an explicit formula.

Currently displaying 41 – 60 of 111