Related papers: An Algorithm to Construct Groebner Bases for Solvi…
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…
In this paper we present the formal, computer-supported verification of a functional implementation of Buchberger's critical-pair/completion algorithm for computing Gr\"obner bases in reduction rings. We describe how the algorithm can be…
The problem of simplifying tensor expressions is addressed in two parts. The first part presents an algorithm designed to put tensor expressions into a canonical form, taking into account the symmetries with respect to index permutations…
Proving statements about linear operators expressed in terms of identities often leads to finding elements of certain form in noncommutative polynomial ideals. We illustrate this by examples coming from actual operator statements and…
In this note, we extend modular techniques for computing Gr\"obner bases from the commutative setting to the vast class of noncommutative $G$-algebras. As in the commutative case, an effective verification test is only known to us in the…
Standard integration-by-parts (IBP) reduction methods typically yield Feynman integral bases where the reduction of some integrals gives rise to coefficients singular as the dimensional regulator $\epsilon\rightarrow 0$. These singular…
We discuss a progress in calculation of Feynman integrals which has been done with help of the Gegenbauer Polynomial Technique and demonstrate the results for most complicated parts of O(1/N^3) contributions to critical exponents of \phi^4…
A generalized criterion for signature related algorithms to compute Gr\"obner basis is proposed in this paper. Signature related algorithms are a popular kind of algorithms for computing Gr\"obner basis, including the famous F5 algorithm,…
Twenty years after the discovery of the F5 algorithm, Gr\"obner bases with signatures are still challenging to understand and to adapt to different settings. This contrasts with Buchberger's algorithm, which we can bend in many directions…
We show herein that a pattern based on FGLM techniques can be used for computing Gr\"obner bases, or related structures, associated to linear codes. This Gr\"obner bases setting turns out to be strongly related to the combinatorics of the…
For associative algebras in many different categories, it is possible to develop the machinery of Gr\"obner bases. A Gr\"obner basis of defining relations for an algebra of such a category provides a "monomial replacement" of this algebra.…
This article is partly a survey and partly a research paper. It tackles the use of Groebner bases for addressing problems of numerical semigroups, which is a topic that has been around for some years, but it does it in a systematic way…
In this note we show how to apply the Gr\"obner--Shirshov bases (GSB) method for modules over an associative algebra to the study of vertex algebras defined by generators and relations. We compute GSBs for a series of vertex algebras and…
The Zippel algorithm performs a rational reconstruction of multivariate polynomials and aims specifically at the sparse case. It is applied in different fields of science, lately becoming an important step in Feynman integral reduction in…
We present Groebner.jl, a Julia package for computing Groebner bases with the F4 algorithm. Groebner.jl is an efficient, portable, and open-source software. Groebner.jl works over integers modulo a prime and over the rationals, supports…
The purpose of this work is to generalize part of the theory behind Faugere's "F5" algorithm. This is one of the fastest known algorithms to compute a Groebner basis of a polynomial ideal I generated by polynomials f_{1},...,f_{m}. A major…
Insa and Pauer presented a basic theory of Groebner basis for differential operators with coefficients in a commutative ring in 1998, and a criterion was proposed to determine if a set of differential operators is a Groebner basis. In this…
Signature-based algorithms have brought large improvements in the performances of Gr\"obner bases algorithms for polynomial systems over fields. Furthermore, they yield additional data which can be used, for example, to compute the module…
We consider the problem of determining Gr\"obner bases of binomial ideals associated with linear error correcting codes. Computation of Gr\"obner bases of linear codes have become a topic of interest to many researchers in coding theory…
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…