Related papers: Noncommutative Gr\"obner bases over rings

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…

For ungraded quotients of an arbitrary $\mathbb{Z}$-graded ring, we define the general PBW property, that covers the classical PBW property and the $N$-type PBW property studied via the $N$-Koszulity by several authors ([BG1], BG2], [FV]).…

In this paper, by using Composition-Diamond lemma for Lie algebras, we give a Gr\"obner-Shirshov basis for free partially commutative Lie algebra over a commutative ring with unit. As an application, we obtain a normal form for such a Lie…

In this paper we will define analogs of Gr\"obner bases for $R$-subalgebras and their ideals in a polynomial ring $R[x_1,\ldots,x_n]$ where $R$ is a noetherian integral domain with multiplicative identity and in which we can determine ideal…

Given a finite set of closed rational points of affine space over a field, we give a Gr\"obner basis for the lexicographic ordering of the ideal of polynomials which vanish at all given points. Our method is an alternative to the…

In this paper we outline the most general and universal algorithmic approach to reduction of loop integrals to basic integrals. The approach is based on computation of Groebner bases for recurrence relations derived from the integration by…

We develop an approach to noncommutative algebraic geometry ``in the perturbative regime" around ordinary commutative geometry. Let R be a noncommutative algebra and A=R/[R,R] its commutativization. We describe what should be the formal…

This paper is a detailed description of an algorithm based on a generalized Buchberger algorithm for constructing Groebner-type bases associated with polynomials of shift operators. The algorithm is used for calculating Feynman integrals…

The theory of border bases for zero-dimensional ideals has attracted several researchers in symbolic computation due to their numerical stability and mathematical elegance. As shown in (Francis & Dukkipati, J. Symb. Comp., 2014), one can…

Signature-based algorithms is a popular kind of algorithms for computing Gr\"obner bases, and many related papers have been published recently. In this paper, no new signature-based algorithms and no new proofs are presented. Instead, a…

Let R be an associative ring.In the paper we study n-generalized commutators of rings and prove that if R is a noncommutative prime ring and n > 2, then every nonzero n-generalized Lie ideal of R contains a nonzero ideal. Therefore, if R is…

In this paper we present a new approach to Grothendieck duality over commutative rings. Our approach is based on the idea of rigid dualizing complexes, which was introduced by Van den Bergh in the context of noncommutative algebraic…

Our starting point is Mumford's conjecture, on representations of Chevalley groups over fields, as it is phrased in the preface of "Geometric Invariant Theory". After extending the conjecture appropriately, we show that it holds over an…

We give illustrative examples of how the computer algebra system OSCAR can support research in commutative algebra and algebraic geometry. We start with a thorough introduction to Groebner basis techniques, with particular emphasis on the…

This paper presents a conception for computing gr\"{o}bner basis. We convert some of gr\"{o}bner-computing algorithms, e.g., F5, extended F5 and GWV algorithms into a special type of algorithm. The new algorithm's finite termination problem…

A contemporary and exciting application of Groebner bases is their use in computational biology, particularly in the reverse engineering of gene regulatory networks from experimental data. In this setting, the data are typically limited to…

In principle, non-Hermitian quantum equations of motion can be formulated using as a starting point either the Heisenberg's or the Schr\"odinger's picture of quantum dynamics. Here it is shown in both cases how to map the algebra of…

Galois closures of commutative rank n ring extensions were introduced by Bhargava and the second author. In this paper, we generalize the construction to the case of non-commutative rings. We show that non-commutative Galois closures…

Border bases, a generalization of Groebner bases, have actively been researched during recent years due to their applicability to industrial problems. A. Kehrein and M. Kreuzer formulated the so called Border Basis Algorithm, an algorithm…

We give an algebraic quantifier elimination algorithm for the first-order theory over any given finite field using Gr\"obner basis methods. The algorithm relies on the strong Nullstellensatz and properties of elimination ideals over finite…