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

An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…

We construct bar-invariant $\mathbb{Z}[q^{\pm 1/2}]-$bases of the quantum cluster algebra of the Kronecker quiver which are quantum analogues of the canonical basis, semicanonical basis and dual semicanonical basis of the cluster algebra of…

We compute the reduced Gr\"{o}bner basis of the toric ideal with respect to a suitable monomial order and we study the Hilbert series of the vertex cover algebra $A(G)$, where $G$ is an unmixed bipartite graph without isolated vertices.

We develop a method for approximating the Gr\"obner basis of the ideal of polynomials which vanish at a finite set of points, when the coordinates of the points are known with only limited precision. The method consists of a preprocessing…

A theory of canonical basis for a two-parameter quantum algebra is developed in parallel with the one in one-parameter case. A geometric construction of the negative part of a two-parameter quantum algebra is given by using mixed perverse…

Analytical expressions for spectrum, eigenfunctions and dipole matrix elements of a square double quantum well (DQW) are presented for a general case when the potential in different regions of the DQW has different heights and effective…

Let G be a finite graph on [n] = {1,2,3,...,n}, X a 2 times n matrix of indeterminates over a field K, and S = K[X] a polynomial ring over K. In this paper, we study about ideals I_G of S generated by 2-minors [i,j] of X which correspond to…

It has been discovered that linear codes may be described by binomial ideals. This makes it possible to study linear codes by commutative algebra and algebraic geometry methods. In this paper, we give a decoding algorithm for binary linear…

We present a $p$-adic algorithm to recover the lexicographic Gr\"obner basis $\mathcal G$ of an ideal in $\mathbb Q[x,y]$ with a generating set in $\mathbb Z[x,y]$, with a complexity that is less than cubic in terms of the dimension of…

Given a finite set of arbitrarily distributed points in affine space with arbitrary multiplicity structures, we present an algorithm to compute the reduced Groebner basis of the vanishing ideal under the lexicographic ordering. Our method…

We define a one-parameter family of two-sided coideals in U_q(gl(n)) and study the corresponding algebras of infinitesimally right invariant functions on the quantum unitary group U_q(n). The Plancherel decomposition of these algebras with…

Let R be a Stanley-Reisner ring (that is, a reduced monomial ring) with coefficients in a domain k, and K its associated simplicial complex. Also let D_k(R) be the ring of k-linear differential operators on R. We give two different…

Each linear code can be described by a code ideal given as the sum of a toric ideal and a non-prime ideal. In this way, several concepts from the theory of toric ideals can be translated into the setting of code ideals. It will be shown…

In this paper, we extend the idea of comprehensive Gr\"{o}bner bases given by Weispfenning (1992) to border bases for zero dimensional parametric polynomial ideals. For this, we introduce a notion of comprehensive border bases and border…

For a finite dimensional semisimple Lie algebra ${\frak{g}}$ and a root $q$ of unity in a field $k,$ we associate to these data a double quiver $\bar{\cal{Q}}.$ It is shown that a restricted version of the quantized enveloping algebras…

Gr\"obner bases can be used for computing the Hilbert basis of a numerical submonoid. By using these techniques, we provide an algorithm that calculates a basis of a subspace of a finite-dimensional vector space over a finite prime field…

Dotsenko and Vallette discovered an extension to nonsymmetric operads of Buchberger's algorithm for Gr\"obner bases of polynomial ideals. In the free nonsymmetric operad with one ternary operation $({\ast}{\ast}{\ast})$, we compute a…

Hilbert schemes of zero-dimensional ideals in a polynomial ring can be covered with suitable affine open subschemes whose construction is achieved using border bases. Moreover, border bases have proved to be an excellent tool for describing…

This note computes a Gr\"obner basis for the ideal defining a union of Schubert varieties. More precisely, it computes a Gr\"obner basis for unions of schemes given by northwest rank conditions on the space of all matrices of a fixed size.…

Let k a characteristic zero field. We give a characterization for the finite quiver k-algebras, based on double derivations. More precisely, we prove that if an associative and unitary k-algebra have a family of double derivations…