DOIAbstract
AbstractA standard form for a Boolean matrix is used to test a conjecture about the maximal length possible for chains of principal ideals in the semigroup of n × n Boolean matrices
AbstractA standard form for a Boolean matrix is used to test a conjecture about the maximal length possible for chains of principal ideals in the semigroup of n × n Boolean matrices
A factorization, which provides a factored form, is an extremely important part of multi-level logic...
AbstractLet Σ be a set of n×n matrices with entries from a field, for n>1, and let c(Σ) be the maxim...
summary:Let $n$ be a positive integer, and $C_{n} (r)$ the set of all $n\times n$ $r$-circulant mat...
AbstractA standard form for a Boolean matrix is used to test a conjecture about the maximal length p...
AbstractWe study the prime Boolean matrices in the semigroup of Boolean matrices. We also study the ...
AbstractWe answer a question by Brualdi and Deaett about the maximal length of a chain in the Bruhat...
AbstractThis paper gives an efficient, direct method for testing whether an arbitrary Boolean matrix...
A Boolean matrix algebra is described which enables many logical functions to be manipulated simulta...
AbstractWe present an algorithm that generates all reduced idempotents in the semigroup of n × n Boo...
Let n be a positive integer and M a set of rational n × n-matrices such that M generates a finite mu...
AbstractLet Mm,n(B) be the semimodule of all m×n Boolean matrices where B is the Boolean algebra wit...
We investigate the maximum length of a chain of subsemigroups in various classes of semigroups, such...
We investigate the maximum length of a chain of subsemigroups in various classes of semigroups, such...
An n x n matrix A over a general Boolean algebra Bk is called regular if there exists an n x n matri...
International audienceWe determine the dimension of every simple module for the algebra of the monoi...
A factorization, which provides a factored form, is an extremely important part of multi-level logic...
AbstractLet Σ be a set of n×n matrices with entries from a field, for n>1, and let c(Σ) be the maxim...
summary:Let $n$ be a positive integer, and $C_{n} (r)$ the set of all $n\times n$ $r$-circulant mat...
AbstractA standard form for a Boolean matrix is used to test a conjecture about the maximal length p...
AbstractWe study the prime Boolean matrices in the semigroup of Boolean matrices. We also study the ...
AbstractWe answer a question by Brualdi and Deaett about the maximal length of a chain in the Bruhat...
AbstractThis paper gives an efficient, direct method for testing whether an arbitrary Boolean matrix...
A Boolean matrix algebra is described which enables many logical functions to be manipulated simulta...
AbstractWe present an algorithm that generates all reduced idempotents in the semigroup of n × n Boo...
Let n be a positive integer and M a set of rational n × n-matrices such that M generates a finite mu...
AbstractLet Mm,n(B) be the semimodule of all m×n Boolean matrices where B is the Boolean algebra wit...
We investigate the maximum length of a chain of subsemigroups in various classes of semigroups, such...
We investigate the maximum length of a chain of subsemigroups in various classes of semigroups, such...
An n x n matrix A over a general Boolean algebra Bk is called regular if there exists an n x n matri...
International audienceWe determine the dimension of every simple module for the algebra of the monoi...
A factorization, which provides a factored form, is an extremely important part of multi-level logic...
AbstractLet Σ be a set of n×n matrices with entries from a field, for n>1, and let c(Σ) be the maxim...
summary:Let $n$ be a positive integer, and $C_{n} (r)$ the set of all $n\times n$ $r$-circulant mat...
Add to ORKG