Syzygies probing scattering amplitudes
- 96 Downloads
We propose a new efficient algorithm to obtain the locally minimal generating set of the syzygies for an ideal, i.e. a generating set whose proper subsets cannot be generating sets. Syzygy is a concept widely used in the current study of scattering amplitudes. This new algorithm can deal with more syzygies effectively because a new generation of syzygies is obtained in each step and the irreducibility of this generation is also verified in the process. This efficient algorithm can also be applied in getting the syzygies for the modules. We also show a typical example to illustrate the potential application of this method in scattering amplitudes, especially the Integral-By-Part(IBP) relations of the characteristic two-loop diagrams in the Yang-Mills theory.
KeywordsDifferential and Algebraic Geometry Scattering Amplitudes
This article is distributed under the terms of the Creative Commons Attribution License (CC-BY 4.0), which permits any use, distribution and reproduction in any medium, provided the original author(s) and source are credited.
- N. Arkani-Hamed et al., Scattering amplitudes and the positive Grassmannian, arXiv:1212.5605.
- D. Bayer and D. Mumford, What can be computed in algebraic geometry?, in Computational algebraic geometry and commutative algebra, (D. Eisenbud and L. Robbiano eds., Cambridge Unviersity Press, Cambridge U.K. (1993), alg-geom/9304003.
- W. Adams and P. Loustaunau, An introduction to Gröbner bases, Graduate Studies in Mathematics volume 3, American Mathematical Society, U.S.A. (1994).Google Scholar
- B. Buchberger, Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal, Ph.D. thesis, Innsbruck, Austria (1965).Google Scholar
- B. Buchberger, Gröbner bases: an algorithmic method in polynomial ideal theory, in Recent trends in multidimensional system theory, R. Bose ed., Spinger, Germany (1985).Google Scholar
- Y. Sun, Signature-based Gröbner basis algorithms — Extended MMM algorithm for computing Gröbner bases, arXiv:1308.2371.
- J.C. Faugere, A new efficient algorithm for computing Gröbner basis without reduction to zero (F5), in the proceedings of the 2002 international symposium on Symbolic and algebraic computation, July 7–10, Lille, France (2002).Google Scholar
- B.H. Roune and S. Michael, Practical Gröbner basis computation, in the proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, July 22–25, Grenoble, France (2012).Google Scholar
- T. Hodges, Computing syzygies of homogeneous polynomials using linear algebra, Diss. Colorado State University, U.S.A. (2014).Google Scholar
- W. Decker et al., Singular, A computer algebra system for polynomial computations, http://www.singular.uni-kl.de (2015).
- H. Möller, T. Mora and C. Traverso, Gröbner bases computation using syzygies, in the proceedings of the ISSAC 92 International Symposium on Symbolic Algebraic Computation, July 27–29, Berkeley, U.S.A. (1992).Google Scholar
- D. Eisenbud, The geometry of syzygies, Graduate Texts in Mathematics, Springer, Germany (2003).Google Scholar