English
Related papers

Related papers: Two-Sided Noncommutative Gr\"{o}bner Basis on Quiv…

200 papers

Non-commutative Gr\"obner bases of two-sided ideals are not necessarily finite. Motivated by this, we provide a closed-form description of a finite and reduced Gr\"obner bases for the two-sided ideal used in the construction of Wangs…

Quantum Algebra · Mathematics 2025-03-20 Leonard Schmitz , Marcel Wack

Standard noncommutative Gr\"obner basis procedures are used for computing ideals of free noncommutative polynomial rings over fields. This paper describes Gr\"obner basis procedures for one-sided ideals in finitely presented noncommutative…

Rings and Algebras · Mathematics 2007-05-23 Anne Heyworth

Nakajima's graded quiver varieties naturally appear in the study of bases of cluster algebras. One particular family of these varieties, namely the bipartite determinantal varieties, can be defined for any bipartite quiver and gives a vast…

Commutative Algebra · Mathematics 2024-06-25 Josua Illian , Li Li

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…

Optimization and Control · Mathematics 2008-06-19 Victor Blanco , Justo Puerto

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…

Rings and Algebras · Mathematics 2010-01-15 Huishi Li

We define a new type of ideal basis called the proper basis that improves both Gr\"obner basis and Buchberger's algorithm. Let $x_1$ be the least variable of a monomial ordering in a polynomial ring $K[x_1,\dotsc,x_n]$ over a field $K$. The…

Commutative Algebra · Mathematics 2025-01-06 Sheng-Ming Ma

Proving statements about linear operators expressed in terms of identities often leads to finding elements of certain form in noncommutative polynomial ideals. We illustrate this by examples coming from actual operator statements and…

Symbolic Computation · Computer Science 2023-11-21 Clemens Hofstadler , Clemens G. Raab , Georg Regensburger

Let $KQ$ be a path algebra, where $Q$ is a finite quiver and $K$ is a field. We study $KQ/C$ where $C$ is the two-sided ideal in $KQ$ generated by all differences of parallel paths in $Q$. We show that $KQ/C$ is always finite dimensional…

Representation Theory · Mathematics 2023-10-05 Edward L. Green , Sibylle Schroll

Let $K$ be an infinite field and $K< X> =K< X_1,...,X_n>$ the free associative algebra generated by $X=\{X_1,...,X_n\}$ over $K$. It is proved that if $I$ is a two-sided ideal of $K< X>$ such that the $K$-algebra $A=K< X> /I$ is almost…

Rings and Algebras · Mathematics 2007-05-23 Huishi Li

Let $I_1\subset I_2\subset\dots$ be an increasing sequence of ideals of the ring $\Bbb Z[X]$, $X=(x_1,\dots,x_n)$ and let $I$ be their union. We propose an algorithm to compute the Gr\"obner base of $I$ under the assumption that the…

Commutative Algebra · Mathematics 2024-12-04 S. Yu. Orevkov

The universal Gr\"obner basis of an ideal is a Gr\"obner basis with respect to all term orders simultaneously. The aim of this paper is to present an algorithmic approach to compute the universal Gr\"obner basis for the toric ideal…

Commutative Algebra · Mathematics 2019-04-23 Yannis C. Stamatiou , Christos Tatakis

We propose a new more efficient method for the computation of two-sided Gr\"obner bases of ideals and bimodules shifting the problem to the enveloping algebra. Arising from the ideas this method involves, we introduce the notion of…

Rings and Algebras · Mathematics 2016-08-16 M. García Román , S. García Román

We explicitly describe two-sided ideals in Leavitt path algebras associated with a row-finite graph. Our main result is that any two-sided ideal $I$ of a Leavitt path algebra associated with a row-finite graph is generated by elements of…

Rings and Algebras · Mathematics 2010-03-16 Pinar Colak

We develop the theory of Gr\"obner bases for ideals in a polynomial ring with countably infinite variables over a field. As an application we reconstruct some of the one-one correspondences among various sets of partitions by using division…

Commutative Algebra · Mathematics 2008-06-04 Kei-ichiro Iima , Yuji Yoshino

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…

Commutative Algebra · Mathematics 2007-05-23 Mathias Lederer

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…

Commutative Algebra · Mathematics 2015-08-06 Dereje Kifle Boku , Claus Fieker , Wolfram Decker , Andreas Steenpass

It has been shown previously that a large class of monomial maps equivariant under the action of an infinite symmetric group have finitely generated kernels up to the symmetric action. We prove that these symmetric toric ideals also have…

Commutative Algebra · Mathematics 2016-04-29 Robert Krone

In this paper, the tropical differential Gr\"obner basis is studied, which is a natural generalization of the tropical Gr\"obner basis to the recently introduced tropical differential algebra. Like the differential Gr\"obner basis, the…

Symbolic Computation · Computer Science 2019-04-05 Youren Hu , Xiao-Shan Gao

In the first part of this article, we consider a Groebner basis of the differential ideal {x_1^2} with respect to "the" weighted lexicographical monomial order and show that its computation is related with an identity involving the…

Algebraic Geometry · Mathematics 2020-06-17 Pooneh Afsharijoo , Hussein Mourtada

We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…

Logic in Computer Science · Computer Science 2026-05-21 Arka Ghosh , Sławomir Lasota
‹ Prev 1 2 3 10 Next ›