Related papers: Groebner Bases in Perturbative Calculations
We present here a new approach for computing Gr\"obner bases for bilateral modules over an effective ring. Our method is based on Weispfenning notion of restricted Gr\"obner bases and related multiplication.
This paper introduces a strategy for signature-based algorithms to compute Groebner basis. The signature-based algorithms generate S-pairs instead of S-polynomials, and use s-reduction instead of the usual reduction used in the Buchberger…
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…
In this paper, a polynomial-time algorithm is given to compute the generalized Hermite normal form for a matrix F over Z[x], or equivalently, the reduced Groebner basis of the Z[x]-module generated by the column vectors of F. The algorithm…
We present an algorithm for computing Groebner bases of vanishing ideals of points that is optimized for the case when the number of points in the associated variety is less than the number of indeterminates. The algorithm first identifies…
In this paper, we consider parametric ideals and introduce a notion of comprehensive involutive system. This notion plays the same role in theory of involutive bases as the notion of comprehensive Groebner system in theory of Groebner…
We develop a Gr\"obner basis theory for a class of algebras that generalizes both PBW-algebras and rings of differential algebras on smooth varieties. Emphasis lies on methods to compute filtrations and graded structures defined by weight…
We report on our experiences exploring state of the art Groebner basis computation. We investigate signature based algorithms in detail. We also introduce new practical data structures and computational techniques for use in both signature…
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…
We provide a scheme for inferring causal relations from uncontrolled statistical data based on tools from computational algebraic geometry, in particular, the computation of Groebner bases. We focus on causal structures containing just two…
In this talk I give an elementary introduction to the key algorithm used in recent applications of computational algebraic geometry to the subject of string phenomenology. I begin with a simple description of the algorithm itself and then…
When using a Groebner basis to solve the highly symmetric system of algebraic equations defining the cyclic p-roots, one has the feeling that much of the advantage of computerized symbolic algebra over hand calculation is lost through the…
In this work, it is proposed a method for computing Noncommutative Gr\"obner bases over a valuation n{\oe}therian ring. We have generalized the fundamental theorem on normal forms over an arbitrary ring. The classical method of dynamical…
A perturbative approach to quantum field theory involves the computation of loop integrals, as soon as one goes beyond the leading term in the perturbative expansion. First I review standard techniques for the computation of loop integrals.…
We present a new algorithm for computing integral bases in algebraic function fields of one variable, or equivalently for constructing the normalization of a plane curve. Our basic strategy makes use of the concepts of localization and…
In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…
We compute the Groebner basis of a system of polynomial equations related to the Jacobian conjecture, and describe completely the solution set.
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…
In arXiv:2204.03190, we proposed a universal method to reduce one-loop integrals with both tensor structure and higher-power propagators. But the method is quite redundant as it does not utilize the results of lower rank cases when…
We extend the notion of generalized unitarity cuts to accommodate loop integrals with higher powers of propagators. Such integrals frequently arise in for example integration-by-parts identities, Schwinger parametrizations and Mellin-Barnes…