The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 61 –
80 of
126
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.
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.
Let be an associative unital ring and let be a strongly nil clean element. We introduce a new idea for examining the properties of these elements. This approach allows us to generalize some results on nil clean and strongly nil clean rings. Also, using this technique many previous proofs can be significantly shortened. Some shorter proofs concerning nil clean elements in rings in general, and in matrix rings in particular, are presented, together with some generalizations of these results.
A ring is feebly nil-clean if for any there exist two orthogonal idempotents and a nilpotent such that . Let be a 2-primal feebly nil-clean ring. We prove that every matrix ring over is feebly nil-clean. The result for rings of bounded index is also obtained. These provide many classes of rings over which every matrix is the sum of orthogonal idempotent and nilpotent matrices.
Currently displaying 61 –
80 of
126