Related papers: The Symmetric Algebra for Certain Monomial Curves
We study the symmetric monoidal 2-category of finite semisimple module categories over a symmetric fusion category. In particular, we study $E_n$-algebras in this 2-category and compute their $E_n$-centers for $n=0,1,2$. We also compute the…
In this paper, we suggest a new efficient algorithm in order to compute S-polynomial reduction rapidly in the known algorithm for computing Grobner bases, and compare the complexity with others.
A number of models of linear logic are based on or closely related to linear algebra, in the sense that morphisms are "matrices" over appropriate coefficient sets. Examples include models based on coherence spaces, finiteness spaces and…
The Koszul homology of modules of the polynomial ring $R$ is a central object in commutative algebra.It is strongly related with the minimal free resolution of these modules, and thus with regularity, Hilbert functions, etc. Here we…
In this article, we show that the algebraic degree in semidefinite programming can be expressed in terms of the coefficient of a certain monomial in a doubly symmetric polynomial. This characterization of the algebraic degree allows us to…
We study graded symmetric algebras, which are the symmetric monoids in the monoidal category of vector spaces graded by a group. We show that a finite dimensional graded semisimple algebra is graded symmetric. The center of a symmetric…
Border bases are a generalization of Gr\"obner bases for zero-dimensional ideals in polynomial rings. In this article, we introduce border bases for a non-commutative ring of linear differential operators, namely the rational Weyl algebra.…
In this paper we propose a general method for computing a minimal free right resolution of a finitely presented graded right module over a finitely presented graded noncommutative algebra. In particular, if such module is the base field of…
A simple way of computing the Ap\'ery set of a numerical semigroup (or monoid) with respect to a generator, using Groebner bases, is presented, together with a generalization for affine semigroups. This computation allows us to calculate…
In this paper we consider systems of partial (multidimensional) linear difference equations. Specifically, such systems arise in scientific computing under discretization of linear partial differential equations and in computational high…
For Temperley-Lieb algebras of types $B$ and $D$, we construct their Gr\"obner-Shirshov bases and the corresponding standard monomials.
We describe the cell structure of the affine Temperley-Lieb algebra with respect to a monomial basis. We construct a diagram calculus for this algebra.
We introduce the theory of monoidal Groebner bases, a concept which generalizes the familiar notion in a polynomial ring and allows for a description of Groebner bases of ideals that are stable under the action of a monoid. The main…
We construct a monomial basis of a quantum affine algebra of simply-laced type, associated to the PBW basis of Beck-Nakajima. We show that there exists a simple algorithm of computing canonical basis in terms of the monomial basis. We…
Using combinatorics of chains going back to works of Anick, Green, Happel and Zacharia, we give, for any monomial algebra $A$, an explicit description of its minimal model. This also provides us with formulas for a canonical…
In our paper Semi-symmetric Algebras: General Constructions, J. Algebra, 148 (1992), pp. 479-496, we present the construction of the semi-symmetric algebra of a module over a commutative ring with unit, which generalizes the tensor algebra,…
In this paper, we apply the techniques developed in [5] to present several consequences of studying UMP algebras and the ramifications graph of a monomial bound quiver algebra. Specifically, we prove that every weakly connected component of…
We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…
We present an algorithm to compute the automorphism group of a Mori dream space. As an example calculation, we determine the automorphism groups of singular cubic surfaces with general parameters. The strategy is to study graded…
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…