AbstractWe study the prime Boolean matrices in the semigroup of Boolean matrices. We also study the factorization properties of the n × n rank-n Boolean matrices in terms of elementary matrices and prime matrices. Finally, we consider the minimal and the maximal prime Boolean matrices
AbstractLet A ∈ Pm × nr, the set of all m × n nonnegative matrices having the same rank r. For matri...
Matrix factorizations are commonly used methods in data mining. When the input data is Boolean,...
We establish a unique factorization result into irreducibel elements in the partial semigroup of 2×2...
AbstractLet A, B, C be n×n matrices of zeros and ones. Using Boolean addition and multiplication, we...
AbstractIn this paper, as a generalization of prime Boolean matrices and prime fuzzy matrices, we st...
AbstractIn this paper, as a generalization of prime Boolean matrices and prime fuzzy matrices, we st...
AbstractLet B be the binary Boolean algebra. The Boolean rank, or factorization rank, of a matrix A ...
Boolean matrix decomposition (BMD) refers to decomposing of an input Boolean matrix into a product ...
AbstractWe present an algorithm that generates all reduced idempotents in the semigroup of n × n Boo...
AbstractUnlike factorization theory of commutative semigroups which are well-studied, very little li...
AbstractA standard form for a Boolean matrix is used to test a conjecture about the maximal length p...
AbstractIn this paper we characterize the subsemigroup of Bn (Bn is the multiplicative semigroup of ...
AbstractLet Mm,n(B) be the semimodule of all m×n Boolean matrices where B is the Boolean algebra wit...
[[abstract]]This paper is devoted to the study of the factorization of elements of the multiplicativ...
AbstractA standard form for a Boolean matrix is used to test a conjecture about the maximal length p...
AbstractLet A ∈ Pm × nr, the set of all m × n nonnegative matrices having the same rank r. For matri...
Matrix factorizations are commonly used methods in data mining. When the input data is Boolean,...
We establish a unique factorization result into irreducibel elements in the partial semigroup of 2×2...
AbstractLet A, B, C be n×n matrices of zeros and ones. Using Boolean addition and multiplication, we...
AbstractIn this paper, as a generalization of prime Boolean matrices and prime fuzzy matrices, we st...
AbstractIn this paper, as a generalization of prime Boolean matrices and prime fuzzy matrices, we st...
AbstractLet B be the binary Boolean algebra. The Boolean rank, or factorization rank, of a matrix A ...
Boolean matrix decomposition (BMD) refers to decomposing of an input Boolean matrix into a product ...
AbstractWe present an algorithm that generates all reduced idempotents in the semigroup of n × n Boo...
AbstractUnlike factorization theory of commutative semigroups which are well-studied, very little li...
AbstractA standard form for a Boolean matrix is used to test a conjecture about the maximal length p...
AbstractIn this paper we characterize the subsemigroup of Bn (Bn is the multiplicative semigroup of ...
AbstractLet Mm,n(B) be the semimodule of all m×n Boolean matrices where B is the Boolean algebra wit...
[[abstract]]This paper is devoted to the study of the factorization of elements of the multiplicativ...
AbstractA standard form for a Boolean matrix is used to test a conjecture about the maximal length p...
AbstractLet A ∈ Pm × nr, the set of all m × n nonnegative matrices having the same rank r. For matri...
Matrix factorizations are commonly used methods in data mining. When the input data is Boolean,...
We establish a unique factorization result into irreducibel elements in the partial semigroup of 2×2...
DOI
Add to ORKG