Related papers: Right Buchberger algorithm over bijective skew PBW…
Many rings and algebras arising in quantum mechanics, algebraic analysis, and non-commutative algebraic geometry can be interpreted as skew PBW (Poincar\'e-Birkhoff-Witt) extensions. In the present paper we study two aspects of these…
For sigma-PWB extensions, we extend to modules the theory of Gr\"obner bases of left ideals presented in [5]. As an application, if A is a bijective quasi-commutative sigma-PWB extension, we compute the module of syzygies of a submodule of…
We prove that if R is a left Noetherian and left regular ring then the same is true for any bijective skew PBW extension A of R. From this we get Serre's Theorem for such extensions. We show that skew PBW extensions and its localizations…
In this paper we compute the $Tor$ and $Ext$ modules over skew $PBW$ extensions. If $A$ is a bijective skew $PBW$ extension of a ring $R$, we give presentations of $Tor_r^{A}(M,N)$, where $M$ is a finitely generated centralizing subbimodule…
In this paper we present the formal, computer-supported verification of a functional implementation of Buchberger's critical-pair/completion algorithm for computing Gr\"obner bases in reduction rings. We describe how the algorithm can be…
In this paper we define the algebraic sets and the ideal of points for bijective skew PBW extensions with coefficients in left Noetherian domains. Some properties of affine algebraic sets of commutative algebraic geometry will be extended,…
In this paper, we compute the Gr\"obner-Shirshov bases for certain regular double extension algebras by means of an algorithm implemented in Matlab, which facilitates the underlying algebraic computations. Moreover, we establish that these…
We review some applications of Gr\"obner-Shirshov bases, including PBW theorems, linear bases of free universal algebras, normal forms for groups and semigroups, extensions of groups and algebras, embedding of algebras.
As the case of free $\Bbbk$-algebras and $PBW$ algebras, given a bijective skew $PBW$ extension $A$, we will show that it is possible transfer Gr\"obner bases between $A$ and its associated graded ring.
In this paper we present a new methodology for solving multiobjective integer linear programs using tools from algebraic geometry. We introduce the concept of partial Gr\"obner basis for a family of multiobjective programs where the…
Ihe first author presented an efficient algorithm for computing involutive (and reduced Groebner) bases. In this paper, we consider a modification of this algorithm which simplifies matters to understand it and to implement. We prove…
Developed by Buchberger for commutative polynomial rings, Groebner Bases are frequently applied to solve algorithmic problems, such as the congruence problem for ideals. Until now, these ideas have been transmitted to different in part…
We present here a new approach for computing Gr\"obner bases for bilateral modules over an effective ring. Our method is based on Weispfenning notion of restricted Gr\"obner bases and related multiplication.
In this paper we present the first-ever computer formalization of the theory of Gr\"obner bases in reduction rings, which is an important theory in computational commutative algebra, in Theorema. Not only the formalization, but also the…
We consider the problem of determining Gr\"obner bases of binomial ideals associated with linear error correcting codes. Computation of Gr\"obner bases of linear codes have become a topic of interest to many researchers in coding theory…
Although Buchberger's algorithm, in theory, allows us to compute Gr\"obner bases over any field, in practice, however, the computational efficiency depends on the arithmetic of the ground field. Consider a field $K = \mathbb{Q}(\alpha)$, a…
Signature-based algorithms have become a standard approach for computing Gr\"obner bases in commutative polynomial rings. However, so far, it was not clear how to extend this concept to the setting of noncommutative polynomials in the free…
The new type of ideal basis introduced herein constitutes a compromise between the Gr\"obner bases based on the Buchberger's algorithm and the characteristic sets based on the Wu's method. It reduces the complexity of the traditional…
In this paper, we introduce (almost) skew 2-nomial algebras and look for a one-sided or two-sided Gr\"obner basis theory for such algebras at a modest level. That is, we establish the existence of a skew multiplicative $K$-basis for every…
What can be (machine) learned about the complexity of Buchberger's algorithm? Given a system of polynomials, Buchberger's algorithm computes a Gr\"obner basis of the ideal these polynomials generate using an iterative procedure based on…