A non-commutative F5 algorithm with an application to the computation of Loewy layers
Commutative Algebra
2015-03-17 v2 Group Theory
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.
Keywords
Cite
@article{arxiv.1210.6614,
title = {A non-commutative F5 algorithm with an application to the computation of Loewy layers},
author = {Simon A. King},
journal= {arXiv preprint arXiv:1210.6614},
year = {2015}
}
Comments
21 pages; minor revision