Related papers: On Computing Groebner Basis in the Rings of Differ…
This habilitation (German variant of a PhD on top of a PhD) thesis presents the quintessence of the ideas and experiences with Groebner Bases of Birgit Reinert. She died unexpectedly without providing an abstract. As arXiv requires an…
This paper is a detailed description of an algorithm based on a generalized Buchberger algorithm for constructing Groebner-type bases associated with polynomials of shift operators. The algorithm is used for calculating Feynman integrals…
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…
One of the main contributions which Volker Weispfenning made to mathematics is related to Groebner bases theory. In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational…
Border bases, a generalization of Groebner bases, have actively been researched during recent years due to their applicability to industrial problems. A. Kehrein and M. Kreuzer formulated the so called Border Basis Algorithm, an algorithm…
Developed by Buchberger for commutative polynomial rings, Groebner Bases are frequently applied to solve algorithmic problems, such as the congruence problem for ideals. Until now, these ideas have been transmitted to different in part…
We construct an explicit minimal strong Groebner basis of the ideal of vanishing polynomials in the polynomial ring over Z/m for m>=2. The proof is done in a purely combinatorial way. It is a remarkable fact that the constructed Groebner…
Using the language of operated algebras, we construct and investigate a class of operator rings and enriched modules induced by a derivation or Rota-Baxter operator. In applying the general framework to univariate polynomials, one is led to…
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…
A long standing problem of Gian-Carlo Rota for associative algebras is the classification of all linear operators that can be defined on them. In the 1970s, there were only a few known operators, for example, the derivative operator, the…
By reading a standard formula for the ring of Grothendieck differential operators in a derived way, we construct a derived (sheaf of) ring of Grothendieck differential operators for Noetherian schemes $X$ separated and finite-type over a…
An algorithm to generate a minimal comprehensive Gr\"obner\, basis of a parametric polynomial system from an arbitrary faithful comprehensive Gr\"obner\, system is presented. A basis of a parametric polynomial ideal is a comprehensive…
We consider the Weyl algebra A (=A_n(k)) and its Rees algebra B with respect to the Bernstein filtration. The homogenisation of a differential operator in A is an element in B. In this paper we establish the validity of the division theorem…
In this paper we present the first-ever computer formalization of the theory of Gr\"obner bases in reduction rings, which is an important theory in computational commutative algebra, in Theorema. Not only the formalization, but also the…
We describe how Groebner bases can be used to solve the reduction problem for Feynman integrals, i.e. to construct an algorithm that provides the possibility to express a Feynman integral of a given family as a linear combination of some…
Motivated by the differential basis theorem of Kolchin and the difference-differential basis theorem of Cohn, in this paper we present a basis theorem for polynomial rings equipped with commuting generalised Hasse-Schmidt operators (in the…
Classically, Groebner bases are computed by first prescribing a set monomial order. Moss Sweedler suggested an alternative and developed a framework to perform such computations by using valuation rings in place of monomial orders. We build…
Algorithmic computation in polynomial rings is a classical topic in mathematics. However, little attention has been given to the case of rings with an infinite number of variables until recently when theoretical efforts have made possible…
We present foundational work on standard bases over rings and on Boolean Groebner bases in the framework of Boolean functions. The research was motivated by our collaboration with electrical engineers and computer scientists on problems…
In this article we produce Groebner bases for the defining ideal of a monomial curve that corresponds to an almost arithmetic sequence of positive integers, correcting previous work of Sengupta,(2003).