Related papers: Two-Sided Noncommutative Gr\"{o}bner Basis on Quiv…
In this paper we consider the problem of computing all possible order ideals and also sets connected to 1, and the corresponding border bases, for the vanishing ideal of a given finite set of points. In this context two different approaches…
We study the connection between two combinatorial notions associated to a quiver: the quiver algebra and the path coalgebra. We show that the quiver coalgebra can be recovered from the quiver algebra as a certain type of finite dual, and we…
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.
We associate to every proof structure in multiplicative linear logic an ideal which represents the logical content of the proof as polynomial equations. We show how cut-elimination in multiplicative proof nets corresponds to instances of…
In this paper we introduce an algebra embedding $\iota:K< X >\to S$ from the free associative algebra $K< X >$ generated by a finite or countable set $X$ into the skew monoid ring $S = P * \Sigma$ defined by the commutative polynomial ring…
We show that for any positive integer $n$, there exists a quiver $Q$ with $O(n^2)$ vertices and $O(n^2)$ edges such that any quiver on $n$ vertices is a full subquiver of a quiver mutation equivalent to $Q$. We generalize this statement to…
There is a natural infinite graph whose vertices are the monomial ideals in a polynomial ring. The definition involves Gr\"obner bases or the action of an algebraic torus. We present algorithms for computing the (affine schemes…
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…
We consider quotients of the unit cube semigroup algebra by particular $\mathbb{Z}_r\wr S_n$-invariant ideals. Using Gr\"obner basis methods, we show that the resulting graded quotient algebra has a basis where each element is indexed by…
It is shown that path algebras modulo relations of the form $\Lambda = KQ/I$, where $Q$ is a quiver, $K$ a coefficient field, and $I \subseteq KQ$ the ideal generated by all paths of a given length, can be readily analyzed homologically,…
We survey some recent developments on the theory of dual canonical bases for quantum groups and $\imath$quantum groups. The $\imath$quiver algebras were introduced by Wang and the first author, which are used to give two realizations of…
We give algorithms for computing multiplier ideals using Gr\"obner bases in Weyl algebras. The algorithms are based on a newly introduced notion which is a variant of Budur--Musta\c{t}\v{a}--Saito's (generalized) Bernstein--Sato polynomial.…
We generalize signature Gr\"obner bases, previously studied in the free algebra over a field or polynomial rings over a ring, to ideals in the mixed algebra $R[x_1,...,x_k]\langle y_1,\dots,y_n \rangle$ where $R$ is a principal ideal…
We give a criterion for a collection of polynomials to be a universal Gr\"{o}bner basis for an ideal in terms of the multidegree of the closure of the corresponding affine variety in $(\mathbb{P}^1)^N$. This criterion can be used to give…
The Gr\"obner basis detection (GBD) is defined as follows: Given a set of polynomials, decide whether there exists -and if "yes" find- a term order such that the set of polynomials is a Gr\"obner basis. This problem was shown to be NP-hard…
In this paper we compute Gr\"obner bases for determinantal ideals of the form $I_{1}(XY)$, where $X$ and $Y$ are both matrices whose entries are indeterminates over a field $K$. We use the Gr\"obner basis structure to determine Betti…
In this paper we introduce a new class of $K$-algebras associated with quivers. Given any finite chain $\mathbf{K}_r: K=K_0\subseteq K_1\subseteq ... \subseteq K_r$ of fields and a chain $\mathbf{E}_r : H_0\subset H_1\subset ... \subset…
Given a parametric polynomial ideal I, the algorithm DISPGB, introduced by the author in 2002, builds up a binary tree describing a dichotomic discussion of the different reduced Groebner bases depending on the values of the parameters,…
We give a description of the mod 2 cohomology algebra of the oriented Grassmann manifold $\widetilde G_{2^t,4}$ as the quotient of a polynomial algebra by a certain ideal. In the process we find a Gr\"obner basis for that ideal, which we…
For the class of quantum integrable models generated from the $q-$Onsager algebra, a basis of bispectral multivariable $q-$orthogonal polynomials is exhibited. In a first part, it is shown that the multivariable Askey-Wilson polynomials…