×

Structure of the rational monoid algebra for Boolean matrices of order 3. (English) Zbl 1302.15039

Summary: We use the computer algebra system Maple to study the 512-dimensional associative algebra \(\mathbb Q \mathcal B_3\), the rational monoid algebra of \(3{\times}3\) Boolean matrices. Using the LLL algorithm for lattice basis reduction, we obtain a basis for the radical in bijection with the 42 non-regular elements of \(\mathcal B_3\). The center of the 470-dimensional semisimple quotient has dimension 14; we use a splitting algorithm to find a basis of orthogonal primitive idempotents. We show that the semisimple quotient is the direct sum of simple two-sided ideals isomorphic to matrix algebras \(M_d(\mathbb Q)\) for \(d=1,1,1,2,3,3,3,3,6,6,7,9,9,12\). We construct the irreducible representations of \(\mathcal B_3\) over \(\mathbb Q\) by calculating the representation matrices for a minimal set of generators.

MSC:

15B34 Boolean and Hadamard matrices
16S50 Endomorphism rings; matrix rings
16Z05 Computational aspects of associative rings (general theory)
20M30 Representation of semigroups; actions of semigroups on sets
68W30 Symbolic computation and algebraic computation
15-04 Software, source code, etc. for problems pertaining to linear algebra
16-04 Software, source code, etc. for problems pertaining to associative rings and algebras
16G10 Representations of associative Artinian rings

Software:

Maple

References:

[1] Belnap, N. D., How a computer should think, (Ryle, G., Contemporary Aspects of Philosophy (1976), Oriel Press: Oriel Press Stocksfield, England) · Zbl 1469.03060
[2] Belnap, N. D., A useful four-valued logic, (Dunn, J. M.; Epstein, G., Modern Uses of Multiple-Valued Logic (1977), D. Reidel Publishing Company: D. Reidel Publishing Company Dordrecht, Holland) · Zbl 0424.03012
[3] Bremner, M. R., How to compute the Wedderburn decomposition of a finite-dimensional associative algebra, Groups Complex. Cryptol., 3, 1, 47-66 (2011) · Zbl 1250.16018
[4] Bremner, M. R., Lattice Basis Reduction: An Introduction to the LLL Algorithm and Its Applications, Pure Appl. Math., vol. 300 (2012), CRC Press: CRC Press Boca Raton, Florida · Zbl 1237.68007
[5] Bremner, M. R.; El, M., Bachraoui: On the semigroup algebra of binary relations, Comm. Algebra, 38, 9, 3499-3505 (2010) · Zbl 1213.20064
[6] Chen, Y.; Zhao, X.; Yang, L., On \(n \times n\) matrices over a finite distributive lattice, Linear Multilinear Algebra, 60, 131-147 (2012) · Zbl 1238.05037
[7] de Caen, D.; Gregory, D. A., Primes in the semigroup of Boolean matrices, Linear Algebra Appl., 37, 119-134 (1981) · Zbl 0457.05001
[8] Devadze, H. N., Generating sets of the semigroup of all binary relations in a finite set, Dokl. Akad. Nauk BSSR, 12, 765-768 (1968) · Zbl 0223.20067
[9] Dickson, L. E., Algebras and Their Arithmetics (1923), Dover Publications: Dover Publications New York: University of Chicago Press, unaltered republication of first edition · JFM 49.0079.01
[10] Drazin, M. P., Maschke’s theorem for semigroups, J. Algebra, 72, 1, 269-278 (1981) · Zbl 0471.20054
[11] Ivanyos, G.; Rónyai, L., Computations in associative and Lie algebras, (Cohen, A. M.; Cuypers, H.; Sterk, H., Some Tapas of Computer Algebra (1999), Springer), (Chapter 5) · Zbl 1053.16518
[12] Ivanyos, G.; Rónyai, L.; Schicho, J., Splitting full matrix algebras over algebraic number fields, J. Algebra, 354, 211-223 (2012) · Zbl 1286.16041
[13] Kim, K. H.; Roush, F. W., Linear representations of semigroups of Boolean matrices, Proc. Amer. Math. Soc., 63, 2, 203-207 (1977) · Zbl 0329.20047
[14] Kleene, S. C., Introduction to Metamathematics (1952), D. Van Nostrand Company: D. Van Nostrand Company New York · Zbl 0047.00703
[15] Konieczny, J., A proof of Devadze’s theorem on generators of the semigroup of Boolean matrices, Semigroup Forum, 83, 2, 281-288 (2011) · Zbl 1238.20069
[16] Preston, G. B., Any group is a maximal subgroup of the semigroup of binary relations on some set, Glasg. Math. J., 14, 21-24 (1973) · Zbl 0253.20092
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.