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. We show that the signatures used in the F5 algorithm allow to read off a basis for each Loewy layer, provided that a negative degree monomial ordering is used. As a byproduct, Gröbner bases in this setting can be computed more efficiently with the F5 algorithm than with Buchberger's algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
