Structure of the rational monoid algebra for Boolean matrices of order 3
DOI10.1016/j.laa.2014.02.035zbMath1302.15039arXiv1307.2161MaRDI QIDQ2447975
Publication date: 29 April 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.2161
radical; rational representations; LLL algorithm; Boolean matrices; Wedderburn decomposition; associative algebras; semisimple quotient; simple two-sided ideals
68W30: Symbolic computation and algebraic computation
16S50: Endomorphism rings; matrix rings
16G10: Representations of associative Artinian rings
16Z05: Computational aspects of associative rings (general theory)
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
20M30: Representation of semigroups; actions of semigroups on sets
15B34: Boolean and Hadamard matrices
Related Items
Uses Software
Cites Work
- Splitting full matrix algebras over algebraic number fields.
- A proof of Devadze's theorem on generators of the semigroup of Boolean matrices.
- Primes in the semigroup of Boolean matrices
- Maschke's theorem for semigroups
- Onn×nmatrices over a finite distributive lattice
- How to compute the Wedderburn decomposition of a finite-dimensional associative algebra
- On the Semigroup Algebra of Binary Relations
- How a Computer Should Think
- Linear Representations of Semigroups of Boolean Matrices
- Any group is a maximal subgroup of the semigroup of binary relations on some set
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item