Abstract
The Boolean rank of a nonzero m × n Boolean matrix A is the least integer k such that there are an m × k Boolean matrix B and a k × n Boolean matrix C with A = BC. We investigate the structure of linear transformations T : Mm,n ! Mp,q which preserve Boolean rank. We also show that if a linear transformation preserves the set of Boolean rank 1 matrices and the set of Boolean rank k matrices for any k, 2 � k � min{m,n} (or if T strongly preserves the set of Boolean rank 1 matrices), then T preserves all Boolean ranks.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
