Related papers: A Systematic Study of Groebner Basis Methods
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…
The concept of Gorenstein dimension, defined by Auslander and Bridger for finitely generated modules over a Noetherian ring, is studied in the context of finitely presented modules over a coherent ring. A generalization of the…
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…
We give an introduction to the theory of initial ideals and initial algebras with emphasis on the transfer of structural properties.
The purpose of this paper is twofold. In the first part we concentrate on hyperplane sections of algebraic schemes, and present results for determining when Gr\"obner bases pass to the quotient and when they can be lifted. The main…
The aim of this paper is mainly to build a new representation-theoretic realization of finite root systems through the so-called Frobenius-type triangular matrix algebras by the method of reflection functors over any field. Finally, we give…
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 investigate the reduction of Feynman integrals to master integrals using Gr\"obner bases in a rational double-shift algebra Y in which the integration-by-parts (IBP) relations form a left ideal. The problem of reducing a given family of…
Let $\cal R$ be either the Grothendieck semiring (semiring with multiplication) of complex algebraic varieties, or the Grothendieck ring of these varieties, or the Grothendieck ring localized by the class of the complex affine line. We…
Two correspondences have been provided that associate any linear code over a finite field with a binomial ideal. In this paper, algorithms for computing their Graver bases and universal Gr\"obner bases are given. To this end, a connection…
This short note is the generalization of Faugere F4-algorithm for polynomial rings with coefficients in Euclidean rings. This algorithm computes successively a Groebner basis replacing the reduction of one single s-polynomial in…
In this paper, we generalize the notion of border bases of zero-dimensional polynomial ideals to the module setting. To this end, we introduce order modules as a generalization of order ideals and module border bases of submodules with…
We give an algebraic quantifier elimination algorithm for the first-order theory over any given finite field using Gr\"obner basis methods. The algorithm relies on the strong Nullstellensatz and properties of elimination ideals over finite…
Previous work by Mora and Sala provides the reduced Groebner basis of the ideal formed by the elementary symmetric polynomials in $n$ variables of degrees $k=1,\dots,n$, $\langle e_{1,n}(x), \dots, e_{n,n}(x) \rangle$. Haglund, Rhoades, and…
Of the many interesting insights in the Auslander-Bridger Memoir of 1969, the theory of Gorenstein dimension has most often been taken up by commutative algebraists. Over a local ring, it deals with resolutions by modules which are totally…
The aim of this note is to present an easy proof of Hilbert's Nullstellensatz using Groebner basis. I believe, that the proof has some methodical advantage in a course on Groebner bases. Key words: Hilbert's Nullstellensatz, Groebner bases.
To compute difference Groebner bases of ideals generated by linear polynomials we adopt to difference polynomial rings the involutive algorithm based on Janet-like division. The algorithm has been implemented in Maple in the form of the…
Modular algorithm are widely used in computer algebra systems (CAS), for example to compute efficiently the gcd of multivariate polynomials. It is known to work to compute Groebner basis over $\Q$, but it does not seem to be popular among…
Two models were recently proposed to explore the robust hardness of Gr\"obner basis computation. Given a polynomial system, both models allow an algorithm to selectively ignore some of the polynomials: the algorithm is only responsible for…
Let R be a commutative ring with unity and a let A be a not necessarily commutative R-algebra which is free as an R-module. If I is an ideal in A, one can ask when A/I is also free as an R-module. We show that if A has an admissible system…