Computational algorithms in modular groupoids
From MaRDI portal
Recommendations
Cited in
(5)- An algorithm for determining the simplicity of a modular group representation
- A classification of computational assumptions in the algebraic group model
- Vector subgroupoids. The computation of all vector subgroupoids of a modular vector groupoid.
- Computing of group-subgroupoids of modular group-groupoid \(\mathbf{Z}_n(a,b)\)
- The program BGroidAP8 for computing the unital subgroupoids of a groupoid.
This page was built for publication: Computational algorithms in modular groupoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3588711)