Related papers: Computing Free Non-commutative Groebner Bases over…
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.…
The classical commutative coding theory has been recently extended to noncommutative rings of polynomial type. There are many interesting works in coding theory over single Ore extensions. In this review article we present the most relevant…
We study determining the posture of an in-parallel planar manipulator, which has three connectors composed of revolute, prismatic and revolute joints, from specified active joint variables. We construct an ideal in the field of complex…
This paper continues a research program on constructive investigations of non-commutative Ore localizations, initiated in our previous papers, and particularly touches the constructiveness of arithmetics within such localizations. Earlier…
We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties…
Working in a polynomial ring $S=\mathbf{k}[x_1,\ldots,x_n]$ where $\mathbf{k}$ is an arbitrary commutative ring with $1$, we consider the $d^{th}$ Veronese subalgebras $R=S^{(d)}$, as well as natural $R$-submodules $M=S^{(\geq r, d)}$…
The main objective of this paper is to connect the theory of $Gr\"obner$ bases to concepts of homological algebra. $Gr\"obner$ bases, an important tool in algebraic system and in linear algebra help us to understand the structure of an…
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…
These are expanded lecture notes of a series of expository talks surveying basic aspects of group cohomology and homology. They were written for someone who has had a first course in graduate algebra but no background in cohomology. You…
Computations with integro-differential operators are often carried out in an associative algebra with unit, and they are essentially non-commutative computations. By adjoining a cocommutative co-product, one can have those operators perform…
In this paper, we propose methods for computing the Hilbert series of multigraded right modules over the free associative algebra. In particular, we compute such series for noncommutative multigraded algebras. Using results from the theory…
Motivated by work of Barot, Geiss and Zelevinsky, we study a collection of Z-bases (which we call companion bases) of the integral root lattice of a root system of simply-laced Dynkin type. Each companion basis is associated with the quiver…
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…
Solving systems of polynomial equations is a central problem in nonlinear and computational algebra. Since Buchberger's algorithm for computing Gr\"obner bases in the 60s, there has been a lot of progress in this domain. Moreover, these…
A Maple package for computing Groebner bases of linear difference ideals is described. The underlying algorithm is based on Janet and Janet-like monomial divisions associated with finite difference operators. The package can be used, for…
We first offer a fast method for calculating the Gelfand-Kirillov dimension of a finitely presented commutative algebra by investigating certain finite set. Then we establish a Groebner-Shirshov bases theory for bicommutative algebras, and…
We define a generalization $\mathfrak{G}$ of the Grassmann algebra $G$ which is well-behaved over arbitrary commutative rings $C$, even when $2$ is not invertible. In particular, this enables us to define a notion of superalgebras that does…
We propose a novel encoding scheme for algebraic codes such as codes on algebraic curves, multidimensional cyclic codes, and hyperbolic cascaded Reed-Solomon codes and present numerical examples. We employ the recurrence from the Gr\"obner…
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 work we develop the theory of Gr\"obner bases for modules over the ring of univariate linearized polynomials with coefficients from a finite field.