Related papers: On Computing Groebner Basis in the Rings of Differ…
A contemporary and exciting application of Groebner bases is their use in computational biology, particularly in the reverse engineering of gene regulatory networks from experimental data. In this setting, the data are typically limited to…
The Gr\"obner basis technique for calculating Feynman diagrams proposed in [O.V. Tarasov, Acta Physica Polonica, v. B29 (1998) 2655] is applied to the two-loop propagator type integrals with arbitrary masses and momentum. We describe the…
There are several efficient methods to solve linear interval polynomial systems in the context of interval computations, however, the general case of interval polynomial systems is not yet covered as well. In this paper we introduce a new…
In one variable, there exists a satisfactory classification of commutative rings of differential operators. In several variables, even the simplest generalizations seem to be unknown and in this report we give examples and pose questions…
A motivation to study Gr\"{o}bner theory for fields with valuations comes from tropical geometry, for example, they can be used to compute tropicalization of varieties \citep{maclagan2009introduction}. The computational aspect of this…
Quaternionic polynomials occur naturally in applications of quaternions in science and engineering, and normalization of quaternionic polynomials is a basic manipulation. Once a Groebner basis is certified for the defining ideal I of 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…
Ihe first author presented an efficient algorithm for computing involutive (and reduced Groebner) bases. In this paper, we consider a modification of this algorithm which simplifies matters to understand it and to implement. We prove…
This paper is a survey on the study of the behaviour of the composition of polynomials on the computation of Gr\"obner bases. This survey brings together some works published between 1995 and 2007. The authors of these papers gave answers…
In the first part of this article, we consider a Groebner basis of the differential ideal {x_1^2} with respect to "the" weighted lexicographical monomial order and show that its computation is related with an identity involving the…
The new type of ideal basis introduced herein constitutes a compromise between the Gr\"obner bases based on the Buchberger's algorithm and the characteristic sets based on the Wu's method. It reduces the complexity of the traditional…
In 1992, V. Weispfenning proved the existence of Comprehensive Groebner Bases (CGB) and gave an algorithm to compute one. That algorithm was not very efficient and not canonical. Using his suggestions, A. Montes obtained in 2002 a more…
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…
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 study the problem of the computation of Groebner basis for the ideal of linear recurring relations of a doubly periodic array. We find a set of indexes such that, along with some conditions, guarantees that the set of polynomials…
Using a new definition of generalized divisors we prove that the lattice of such divisors for a given linear partial differential operator is modular and obtain analogues of the well-known theorems of the Loewy-Ore theory of factorization…
We study the relationship between certain Groebner bases for zero dimensional ideals, and the interpolation condition functionals of ideal interpolation. Ideal interpolation is defined by a linear idempotent projector whose kernel is a…
We use the definition of differential operators on noncommutative rings given by V.Lunts and A.Rosenberg to find the differential operators on Azumaya algebras and the Heisenberg algebras.
Using evaluation at appropriately chosen points, we propose a Gr\"obner basis free approach for calculating the secondary invariants of a finite permutation group. This approach allows for exploiting the symmetries to confine the…
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…