A non-commutative F₅ algorithm with an application to the computation of Loewy layers.
From MaRDI portal
(Redirected from Publication:2447640)
A non-commutative \(F 5\) algorithm with an application to the computation of Loewy layers.
A non-commutative \(F 5\) algorithm with an application to the computation of Loewy layers.
Abstract: We provide a non-commutative version of the F5 algorithm, namely for right-modules over path algebra quotients. It terminates, if the path algebra quotient is a basic algebra. In addition, we use the F5 algorithm in negative degree monomial orderings to compute Loewy layers.
Recommendations
Cites work
- Blocks of tame representation type and related algebras
- Cohomology rings of finite groups. With an appendix: Calculations of cohomology rings of groups of order dividing 64.
- Constructing projective resolutions
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Gröbner bases and the computation of group cohomology.
- scientific article; zbMATH DE number 3649988 (Why is no real title available?)
- scientific article; zbMATH DE number 1181204 (Why is no real title available?)
- scientific article; zbMATH DE number 2151220 (Why is no real title available?)
- scientific article; zbMATH DE number 2228448 (Why is no real title available?)
- Minimal projective resolutions
- SINGULAR
- Synergy in the Theories of Gröbner Bases and Path Algebras
- The computation of the cohomology rings of all groups of order 128.
- The F5 criterion revised
- The mod-2 cohomology ring of the third Conway group is Cohen-Macaulay.
Cited in
(4)
This page was built for publication: A non-commutative \(F_5\) algorithm with an application to the computation of Loewy layers.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2447640)