Related papers: A Systematic Study of Groebner Basis Methods
We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…
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…
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…
This paper is a survey of computational issues in algebraic geometry, with particular attention to the theory of Grobner bases and the regularity of an algebraic variety. 1. A geometric introduction to Grobner bases. 2. An algebraic…
Solving a polynomial system, or computing an associated Gr\"obner basis, has been a fundamental task in computational algebra. However, it is also known for its notorious doubly exponential time complexity in the number of variables in the…
This paper deals with the notion of Gr\"obner $\delta$-base for some rings of linear differential operators by adapting the works of W. Trinks, A. Assi, M. Insa and F. Pauer. We compare this notion with the one of Gr\"obner base for such…
We introduce the notion of Groebner S-basis of an ideal of the free associative algebra K<X> over a field K invariant under the action of a semigroup S of endomorphisms of the algebra. We calculate the Groebner S-bases of the ideal…
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…
In the context of algebraic statistics an experimental design is described by a set of polynomials called the design ideal. This, in turn, is generated by finite sets of polynomials. Two types of generating sets are mostly used in the…
Two fundamental questions in the theory of Groebner bases are decision ("Is a basis G of a polynomial ideal a Groebner basis?") and transformation ("If it is not, how do we transform it into a Groebner basis?") This paper considers the…
In this paper we will define analogs of Gr\"obner bases for $R$-subalgebras and their ideals in a polynomial ring $R[x_1,\ldots,x_n]$ where $R$ is a noetherian integral domain with multiplicative identity and in which we can determine ideal…
Gr{\"o}bner bases is one the most powerful tools in algorithmic non-linear algebra. Their computation is an intrinsically hard problem with a complexity at least single exponential in the number of variables. However, in most of the cases,…
In this paper, we extend the characterization of $\mathbb{Z}[x]/\ < f \ >$, where $f \in \mathbb{Z}[x]$ to be a free $\mathbb{Z}$-module to multivariate polynomial rings over any commutative Noetherian ring, $A$. The characterization allows…
Let $I$ be an ideal of the polynomial ring $A[x]=A[x_1,...,x_n]$ over the commutative, noetherian ring $A$. Geometrically $I$ defines a family of affine schemes over $\Spec(A)$: For $\p\in\Spec(A)$, the fibre over $\p$ is the closed…
In 1965 Buchberger defined Gr\"obner bases and an algorithm to compute them. Despite a slow start, already in the eighties Gr\"obner bases had become the main device for symbolic computations involving polynomials as well as a theoretical…
We report on an approach to integration-by-parts reduction based on Gr\"obner bases. We establish the underlying noncommutative rational double-shift algebra wherein the integration-by-parts relations form a left ideal. We describe in…
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…
An approach to compatibility analysis of systems of discrete relations is proposed. Unlike the Groebner basis technique, the proposed scheme is not based on the polynomial ring structure. It uses more primitive set-theoretic and topological…
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…
Experiences with the implementation of strong Gr\"obner bases respectively standard bases for polynomial rings over principal ideal rings are explained: different strategies for creating the pair set, methods to avoid coefficient growth and…