Right Buchberger algorithm over bijective skew PBW extensions
Abstract
In this paper we present a right version of the algorithms developed for to compute Gr\"obner bases over bijective skew PBW extensions in the left case given in [3]. In particular, we adapt the theory of reduction and we build a right division algorithm and generate a right version of Buchberger algorithm over bijective skew PBW extensions, finally we illustrate some examples using the SPBWE.lib library implemented in Maple (see [1], [4]). It is important to note that the development of this theory is fundamental to complete the SPBWE.lib library and to be able to develop many of the homological applications that arise as result of obtaining the right Gr\"obner bases over skew PBW extensions.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.