Abstract
Let $${{\fancyscript{T}\fancyscript{B}_n}}$$ denote the submonoid of all upper triangular boolean n × n matrices. It was shown by Volkov and Goldberg that $${{\fancyscript{T}\fancyscript{B}_n}}$$ is nonfinitely based if n > 3, but the cases when n = 2, 3 remained open. In this paper, it is shown that the monoid $${{\fancyscript{T}\fancyscript{B}_2}}$$ is finitely based, and a finite identity basis for the monoid $${{\fancyscript{T}\fancyscript{B}_2}}$$ is given. Moreover, it is shown that $${{\fancyscript{T}\fancyscript{B}_3}}$$ is inherently nonfinitely based. Hence, $${{\fancyscript{T}\fancyscript{B}_n}}$$ is finitely based if and only if n ≤ 2.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.