2009
DOI: 10.4134/bkms.2009.46.2.373
|View full text |Cite
|
Sign up to set email alerts
|

Boolean Regular Matrices and Their Strongly Preservers

Abstract: Abstract. An m×n Boolean matrix A is called regular if there exists an n × m Boolean matrix X such that AXA = A. We have characterizations of Boolean regular matrices. We also determine the linear operators that strongly preserve Boolean regular matrices.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 6 publications
0
2
0
Order By: Relevance
“…In favour of the the Remark 3.41 we produce an example as follows. In [3] and [39], the authors have defined the rank of a Boolean matrix through space decomposition. Next, we discuss the rank and weight of a Boolean tensors.…”
Section: Space Decompositionmentioning
confidence: 99%
“…In favour of the the Remark 3.41 we produce an example as follows. In [3] and [39], the authors have defined the rank of a Boolean matrix through space decomposition. Next, we discuss the rank and weight of a Boolean tensors.…”
Section: Space Decompositionmentioning
confidence: 99%
“…Among these papers, Song, Kang and Beasley etc. studied the linear operators strongly preserving regular matrices over antinegative commutative semirings with no zero divisors, including the binary Boolean algebra, the nonnegative reals, the nonnegative integers and the fuzzy scalars (refer to [12], [23], [25]); Li, Tan, and Tang [14] characterized the linear operators strongly preserving invertible matrices over some antinegative commutative semirings with no zero divisors. Besides, Song, Kang, and Jun etc.…”
Section: Introductionmentioning
confidence: 99%