A non-commutative F5 algorithm with an application to the computation of Loewy layers
classification
🧮 math.AC
math.GR
keywords
algebraalgorithmlayersloewynon-commutativepathadditionapplication
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.