AbstractWe find the group-theoretic complexity of many subsemigroups of the semigroup Bn of n × n Boolean matrices, including Hall matrices, reflexive matrices, fully indecomposable matrices, upper triangular matrices, row-rank-n matrices, and others
2000 Mathematics Subject Classification: 20M20, 20M10.We describe maximal nilpotent subsemigroups of...
AbstractLet Gn be the semigroup of n × n generalized circulant Boolean matrices and M(E) a maximal s...
A semigroup is simply a set with an associative binary operation; computational semigroup theory is ...
Computational semigroup theory is concerned with developing and implementing algorithms for determin...
AbstractWe show that finding roots of Boolean matrices is an NP-hard problem. This answers a 20 year...
We consider the Krohn–Rhodes complexity of certain semigroups of upper triangular matrices over fini...
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty...
AbstractA standard form for a Boolean matrix is used to test a conjecture about the maximal length p...
AbstractLet S be a finite semigroup and let K be an algebraically closed field of characteristic zer...
AbstractThe Krohn-Rhodes Theorem shows that any finite semigroup S can be built by cascading (via wr...
We investigate the complexity of deciding, given a multiplication table representing a semigroup S, ...
Let A in {0,1}^{n x n} be a matrix with z zeroes and u ones and x be an n-dimensional vector of form...
AbstractWe study the regular matrices in the semigroup Hn of Hall matrices (Boolean matrices with po...
The prefix problem consists of computing all the products $x_{0}x_{1}\ldots x_{j} (j=0,\ldots,N-1)$...
The Krohn-Rhodes Theorem shows that any nite semigroup S can be built by cascading [via wreath produ...
2000 Mathematics Subject Classification: 20M20, 20M10.We describe maximal nilpotent subsemigroups of...
AbstractLet Gn be the semigroup of n × n generalized circulant Boolean matrices and M(E) a maximal s...
A semigroup is simply a set with an associative binary operation; computational semigroup theory is ...
Computational semigroup theory is concerned with developing and implementing algorithms for determin...
AbstractWe show that finding roots of Boolean matrices is an NP-hard problem. This answers a 20 year...
We consider the Krohn–Rhodes complexity of certain semigroups of upper triangular matrices over fini...
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty...
AbstractA standard form for a Boolean matrix is used to test a conjecture about the maximal length p...
AbstractLet S be a finite semigroup and let K be an algebraically closed field of characteristic zer...
AbstractThe Krohn-Rhodes Theorem shows that any finite semigroup S can be built by cascading (via wr...
We investigate the complexity of deciding, given a multiplication table representing a semigroup S, ...
Let A in {0,1}^{n x n} be a matrix with z zeroes and u ones and x be an n-dimensional vector of form...
AbstractWe study the regular matrices in the semigroup Hn of Hall matrices (Boolean matrices with po...
The prefix problem consists of computing all the products $x_{0}x_{1}\ldots x_{j} (j=0,\ldots,N-1)$...
The Krohn-Rhodes Theorem shows that any nite semigroup S can be built by cascading [via wreath produ...
2000 Mathematics Subject Classification: 20M20, 20M10.We describe maximal nilpotent subsemigroups of...
AbstractLet Gn be the semigroup of n × n generalized circulant Boolean matrices and M(E) a maximal s...
A semigroup is simply a set with an associative binary operation; computational semigroup theory is ...
DOI
Add to ORKG