Scattering Amplitudes from Multivariate Polynomial Division
Abstract
We show that the evaluation of scattering amplitudes can be formulated as a problem of multivariate polynomial division, with the components of the integrationmomenta as indeterminates. We present a recurrence relation which, independently of the number of loops, leads to the multiparticle pole decomposition of the integrands of the scattering amplitudes. The recursive algorithm is based on the Weak Nullstellensatz Theorem and on the division modulo the Gröbner basis associated to all possible multiparticle cuts. We apply it to dimensionally regulated oneloop amplitudes, recovering the wellknown integranddecomposition formula. Finally, we focus on the maximumcut, defined as a system of onshell conditions constraining the components of all the integrationmomenta. By means of the Finiteness Theorem and of the Shape Lemma, we prove that the residue at the maximumcut is parametrized by a number of coefficients equal to the number of solutions of the cut itself.
keywords:
Scattering amplitudes, Unitarity, Polynomial Division1 Introduction
Scattering amplitudes in quantum field theories are analytic functions of the momenta of the particles involved in the scattering process, and can be determined by their singularity structure. The multiparticle factorization properties of the amplitudes are exposed when propagating particles go on their massshell Bern:1994zx (); Britto:2004nc (); Cachazo:2004kj (); Britto:2004ap ().
The investigation of the residues at the singular points has been fundamental for discovering new relations fulfilled by scattering amplitudes. The BCFW recurrence relation Britto:2004ap (), its link to the leading singularity of oneloop amplitudes Britto:2004nc (), and the OPP integranddecomposition formula for oneloop integrals Ossola:2006us () have shown the underlying simplicity beneath the rich mathematical structure of quantum field theory. Moreover they have become efficient techniques leading to quantitative predictions at the nexttoleading order in perturbation theory Berger:2008sj (); Giele:2008bc (); Badger:2010nx (); Bevilacqua:2011xh (); Hirschi:2011pa (); Cullen:2011ac (); Agrawal:2011tm (); Cascioli:2011va ().
The integrand reduction methods Ossola:2006us () allow to decompose oneloop amplitudes in terms of Master Integrals (MI’s) without performing the loop integration, and are based on the multiparticle pole expansion of the integrand. The expansion is equivalent to the decomposition of the numerator in terms of (a combination of) products of denominators, with polynomial coefficients. In the context of an integrandreduction, any integration is replaced by polynomial fitting.
The first extension of the integrand reduction method beyond oneloop was proposed in Mastrolia:2011pr (), and it was used to reproduce the results of twoloop 5point planar and nonplanar amplitudes in SYM Bern:2006ew (); Carrasco:2011mn (). A key point of the higherloop extension is the proper parametrization of the residues at the multiparticle poles. Each residue is a multivariate polynomial in the irreducible scalar products (ISP’s) among the loop momenta and either external momenta or polarization vectors constructed out of them. ISP’s cannot be expressed in terms of denominators, thus any monomial formed by ISP’s is the numerator of a potential MI which may appear in the final result. Hence, a systematic classification of the polynomial structures of the residues is mandatory. In Mastrolia:2011pr (), the residues have been obtained by relating the ISPs to monomials in the components of the loop momenta expressed in a basis chosen according to the topology of the onshell diagram.
Badger, Frellesvig and Zhang Badger:2012dp () combined onshell conditions with Gramidentities Gluza:2010ws () to limit the number of monomials appearing in the residues. This technique was applied to the integrand decomposition of twoloop 4point planar and nonplanar diagrams in supersymmetric as well as nonsupersymmetric YM theories.
In this work, we show that the shape of the residues is uniquely determined by the onshell conditions alone, without any additional constraint. We derive a simple integrand recurrence relation that generates the required multiparticle pole decomposition for arbitrary amplitudes, independently of the number of loops.
The algorithm treats the numerator and the denominators of any Feynman integrand, as multivariate polynomials in the components of the loop variables. The properties of multivariate polynomials have been extensively studied in the mathematical literature, see e.g. buch1 (); Cox1 (); Cox2 (); moller (); rouillier (); sturmfels (); verschelde (). The method uses both the weak Nullstellensatz theorem and the multivariate polynomial division modulo appropriate Gröbner basis buch1 (). In the context of the integrand reduction, univariate polynomial division has been already introduced in Mastrolia:2012bu () to improve the decomposition of oneloop scattering amplitudes.
The algorithm, which is described in Section II, relies on general properties of the loop integrand:

When the number of denominators is larger than the total number of the components of the loop momenta, the weak Nullstellensatz theorem yields the trivial reduction of an denominator integrand in terms of integrands with denominators.

When is equal or less than the total number of components of the loop momenta, we divide the numerator modulo the Gröbner basis of the ple cut, namely modulo a set of polynomials vanishing on the same onshell solutions as the cut denominators. The remainder of the division is the residue of the ple cut. The quotients generate integrands with denominators which should undergo the same decomposition.

By iterating this procedure, we extract the polynomial forms of all residues. The algorithm will stop when all cuts are exhausted, and no denominator is left, leaving us with the integrand reduction formula.
In Section III we apply the algorithm to a generic oneloop integrand, reproducing the dimensional integrand decomposition formula Ossola:2006us (); Ellis:2007br (); Giele:2008ve (); Ellis:2008ir ().
In Section IV we conclude by proving a theorem on the maximumcuts, i.e.
the cuts defined by the maximum number of onshell conditions which can
be simultaneously satisfied by the loop momenta. The onshell conditions
of a maximum cut lead to a zerodimensional system.
The
Finiteness Theorem and the
Shape Lemma ensure that the
residue at the maximumcut is parametrized
by coefficients, where is the number of
solutions of the multiple cutconditions.
This guarantees that the
corresponding residue can always be reconstructed by evaluating the numerator
at the solutions of the cut.
During the completion of this work, Zhang has presented an algorithm Zhang:2012ce () embedding the ideas presented in Badger:2012dp () within more general techniques of algebraic geometry, among which the division modulo Gröbner basis is used as well.
2 Multivariate polynomial division
In what follows, we assume 4dimensional loopmomenta. Extensions to higherdimensional cases, according to the chosen dimensional regularization scheme, can be treated analogously  as we will show when discussing the oneloop integrand reduction.
The integrand reduction methods Ossola:2006us (); Ossola:2007bb (); Ossola:2007ax (); Ossola:2008xq (); Ellis:2007br (); Giele:2008ve (); Ellis:2008ir (); Mastrolia:2008jb (); Mastrolia:2012bu (); Mastrolia:2011pr (); Badger:2012dp () recast the problem of computing loop amplitudes with denominators as the reconstruction of integrand functions of the type
(1) 
where are integration momenta. The generic propagator can be written as follows:
(2) 
The numerator and any of the denominators are polynomial in the components of the loop momenta, say , i.e.
(3) 
Let us consider the ideal generated by the denominators in Eq. (3) ,
where is the set of polynomials in . The common zeros of the elements of are exactly the common zeros of the denominators.
The multipole decomposition of Eq. (1) is explicitly
achieved by performing multivariate polynomial division,
yielding an expression of
in terms of denominators and residues.
We construct a Gröbner basis buch1 ()
(see Ch. 2 of Cox1 ()), generating the ideal
with respect to a chosen monomial order,
(4) 
Unless otherwise indicated, we will assume lexicographic order.
In this formalism, the ple cutconditions , are equivalent to . The number of elements of the Gröbner basis is the cardinality of the basis. In general, is different from . We then consider the multivariate division of modulo (see Ch. 2, Thm. 3 of Cox1 ()),
(5) 
where
is a compact notation for the sum of the products of the quotients
and the divisors .
The polynomial is the remainder of the
division. Since is a Gröbner basis,
the remainder is uniquely determined once the monomial order is fixed.
The term belongs to the ideal
, thus it can be expressed
in terms of denominators, as
(6) 
The explicit form of can be found by expressing the elements of the Gröbner basis in terms of the denominators.
2.1 Reducibility criterion.
An integrand is said to be reducible if it can be written in terms of lowerpoint integrands: that happens when the numerator can be written in terms of denominators. The concept of reducibility can be formalized in algebraic geometry. Indeed a direct consequence of Eqs. (5) and (6) is the following
Proposition 2.0.
The integrand is reducible iff the remainder of the division modulo a Gröbner basis vanishes, i.e. iff .
Proposition 1 allows to prove
Proposition 2.0.
An integrand is reducible if the cut leads to a system of equations with no solution.
Proof.
In this case, the system is overconstrained. The propagators cannot vanish simultaneously, i.e.
(7) 
has no solution. Therefore, according to the weak Nullstellensatz theorem (Thm. 1, Ch. 4 of Cox1 ()),
(8) 
for some . Irrespective of the monomial order, a (reduced) Gröbner basis is . Eq. (5) becomes
(9) 
thus is reducible. ∎
2.2 Integrand Recursion Formula
After substituting Eqs. (5) and (6) in Eq. (3), we get a nonhomogeneous recurrence relation for the denominator integrand,
(10) 
According to Eq. (10), is expressed in terms of integrands, , with denominators. are obtained from by pinching the th denominator. The numerator of the nonhomogeneous term is the remainder of the division (5). By construction, it contains only irreducible monomials with respect to , thus it is identified with the residue at the cut .
The integrands can be decomposed repeating the procedure described in Eqs. (3)(5). In this case the polynomial division of has to be performed modulo the Gröbner basis of the ideal , generated by the corresponding denominators.
The complete multipole decomposition of the integrand is achieved by successive iterations of Eqs. (3)(5). Like an Erathostene’s sieve, the recursive application of Eqs. (5) and (10) extracts the unique structures of the remainders ’s. The procedure naturally stops when all cuts are exhausted, and no denominator is left, leaving us with the integrand reduction formula.
If all quotients of the last divisions vanish, the integrand is cutconstructible, i.e. it can be determined by sampling the numerator on the solutions of the cuts. If the quotients do not vanish, they give rise to noncutconstructible terms, i.e. terms vanishing at every multipole. They can be reconstructed by sampling the numerator away from the cuts. Noncutconstructible terms may occur in nonrenormalizable theories, where the rank of the numerator is higher than the number of denominators Mastrolia:2012bu ().
3 Oneloop integrand decomposition
In this section we decompose an point integrand of rank with , using the procedure described in Section 2. The reduction of higherrank and/or lowerpoint integrands proceeds along the same lines.
In dimensions, the generic point oneloop integrand reads as follows:
(11) 
We closely follow the notation of Mastrolia:2010nb (); Mastrolia:2012bu (). Objects living in are denoted by a bar, e.g. and .
For later convenience, for each we define a
basis .
If , then , where are four external momenta.
If , then are chosen to fulfill the following relations:
(12) 
In terms of , the loop momentum can be decomposed as,
(13) 
Accordingly, each numerator can be treated as a rank polynomial in ,
(14) 
with .
Step 1. When , the Proposition 2 guarantees that is reducible, and, by iteration, it can be written as a linear combination of point integrands .
Step 2. The numerator of each is a rank5 polynomial in , cfr. Eq. (14). We define the ideal , and compute the Gröbner basis , which is found to have a remarkably simple form:
(15) 
We observe that each depends linearly on the th component of .
The division of modulo , see Eq.(5), gives a constant remainder,
(16) 
The term in Eq. (6) is,
where are the numerators of the 4point integrands, , obtained by removing the th denominator.
Step 3. For each , the numerator is a rank polynomial in . The Gröbner basis of the ideal contains four elements. Dividing modulo , we obtain the remainder. The latter depends on and on the fourth component of the loop momentum in the basis ,
(17)  
The term ,
contains the numerators of 3point integrands .
Step 4. The Gröbner basis is formed by three elements, and is used to divide . The remainder is polynomial in and in the third and fourth components of in the basis ,
(18)  
The term generates the rank numerators of the point integrands , , and .
Step 5. The remainder of the division of by the two elements of is:
(19)  
It is polynomial in and in the last three components of in the basis . The reducible term of the division, , generates the rank integrands, , and .
Step 6. The numerator of the 1point integrands is linear in the components of the loop momentum in the basis ,
The only element of the Gröbner basis is , which is quadratic in . Therefore the division modulo , leads to a vanishing quotient, hence
(20) 
Step 7. Collecting all the remainders computed in the previous steps, we obtain the complete decomposition of in terms of its multipole structure
(21) 
Eq. (21) reproduces the wellknown oneloop dimensional integrand decomposition formula Ossola:2006us (); Ellis:2007br (); Giele:2008ve (); Ellis:2008ir (); Mastrolia:2010nb (); Ellis:2011cr ().
We remark that the basis , defined in Eq.(13) and used for decomposing the integration momentum , depends only on the external momenta of diagram associate to the cut, eventually complemented by orthogonal elements. Therefore, can be used as well to decompose the integration momenta of multiloop diagrams Mastrolia:2011pr ().
4 The Maximumcut Theorem
At loops, in four dimensions, we define a maximumcut as a ple cut
(22) 
which constrains completely the components of the loop momenta. In four dimensions this implies the presence of four constraints for each loop momenta. We assume that, in nonexceptional phasespace points, a maximumcut has a finite number of solutions, each with multiplicity one. Under this assumption we have the following
Theorem 4.1 (Maximum cut).
The residue at the maximumcut is a polynomial paramatrized by coefficients, which admits a univariate representation of degree .
Proof.
Let us parametrize the propagators using variables . In this parametrization, the solutions of the maximumcut read,
(23) 
Let be the ideal generated by the onshell denominators,
According to the assumptions, the number of the solutions
of (22) is finite,
and each of them has multiplicity one, therefore
is zerodimensional moller ()
and radical^{1}^{1}1
Given an ideal , the radical of is
.
is radical iff .
, see Cor. 2.6, Ch. 4 of Cox2 ().
In this case, the Finiteness Theorem
(Prop. 8, Ch. 5 of Cox1 ())
ensures that
the remainder of the division of any polynomial modulo
can be parametrized exactly by coefficients.
Moreover, up to a linear coordinate change, we can assume that all the solutions of the system have distinct first coordinate , i.e. . We observe that and are in the Shape Lemma position (Prop. 2.3 of sturmfels ()) therefore a Gröbner basis for the lexicographic order is , in the form
(24) 
The functions are univariate polynomials in . In particular is a rank squarefree polynomial rouillier (),
(25) 
i.e. it does not exhibits repeated roots. The multivariate division of modulo leaves a remainder which is a univariate polynomial in of degree verschelde (), in accordance with the Finiteness Theorem. ∎
The maximumcut theorem ensures that the maximumcut residue, at any loop, is completely determined by the distinct solutions of the cutconditions. In particular it can be reconstructed by sampling the integrand on the solutions of the maximum cut itself.
At one loop and in dimensions, the ple cuts are maximumcuts. The remarkably simple structure of the Gröbner basis in Eq. (15) is dictated by the maximumcut theorem. Moreover in this case , thus the residue in Eq. (16) is a constant.
The structures of the residues of the maximum cut, together with the corresponding values of , for a set of one, two, and threeloop diagrams are collected in Figure 1.
The calculations of Sections 3 and 4 have been carried out using the package S@M Maitre:2007jq () and the functions GroebnerBasis and PolynomialReduce of Mathematica, respectively needed for the generation of the Gröbner basis and the polynomial division.
5 Conclusions
We presented a new algebraic approach, where the evaluation of scattering amplitudes is addressed by using multivariate polynomial division, with the components of the loopmomenta as indeterminates. We found a recurrence relation to construct the integrand decomposition of arbitrary scattering amplitudes, independently of the number of loops. The recursive algorithm is based on the Weak Nullstellensatz Theorem and on the division modulo the Gröbner basis associated to all possible multiparticle cuts. Using this technique, we rederived the wellknown oneloop integrand decomposition formula. Finally, by means of the Finiteness Theorem and of the Shape Lemma, we proved that the residue at the maximumcuts is parametrised exactly by a number of coefficients equal to the number of solutions of the cut itself.
Acknowledgments
We are indebted to Simon Badger and Yang Zhang for fruitful discussions, in particular on the properties of the Gröbner basis, and for comments of the manuscript.
E.M. thanks the Center for Theoretical Physics of New York City College of Technology for hospitality during the final stages of this project.
The work of P.M. and T.P. is supported by the Alexander von Humboldt Foundation, in the framework of the Sofja Kovaleskaja Award, endowed by the German Federal Ministry of Education and Research. The work of G.O. is supported in part by the National Science Foundation under Grant PHY1068550.
References
 (1) Z. Bern, L. J. Dixon, D. C. Dunbar, and D. A. Kosower, “OneLoop nPoint Gauge Theory Amplitudes, Unitarity and Collinear Limits,” Nucl. Phys. B425 (1994) 217–260, hepph/9403226.
 (2) R. Britto, F. Cachazo, and B. Feng, “Generalized unitarity and oneloop amplitudes in N = 4 superYangMills,” Nucl. Phys. B725 (2005) 275–305, hepth/0412103.
 (3) F. Cachazo, P. Svrcek, and E. Witten, “MHV vertices and tree amplitudes in gauge theory,” JHEP 09 (2004) 006, hepth/0403047.
 (4) R. Britto, F. Cachazo, and B. Feng, “New Recursion Relations for Tree Amplitudes of Gluons,” Nucl. Phys. B715 (2005) 499–522, hepth/0412308.
 (5) G. Ossola, C. G. Papadopoulos, and R. Pittau, “Reducing full oneloop amplitudes to scalar integrals at the integrand level,” Nucl.Phys. B763 (2007) 147–169, hepph/0609007.
 (6) C. Berger, Z. Bern, L. Dixon, F. Febres Cordero, D. Forde, et al., “An Automated Implementation of OnShell Methods for OneLoop Amplitudes,” Phys.Rev. D78 (2008) 036003, 0803.4180.
 (7) W. Giele and G. Zanderighi, “On the Numerical Evaluation of OneLoop Amplitudes: The Gluonic Case,” JHEP 0806 (2008) 038, 0805.2152.
 (8) S. Badger, B. Biedermann, and P. Uwer, “NGluon: A Package to Calculate Oneloop Multigluon Amplitudes,” Comput.Phys.Commun. 182 (2011) 1674–1692, 1011.2900.
 (9) G. Bevilacqua, M. Czakon, M. Garzelli, A. van Hameren, A. Kardos, et al., “HELACNLO,” 1110.1499.
 (10) V. Hirschi, R. Frederix, S. Frixione, M. V. Garzelli, F. Maltoni, et al., “Automation of oneloop QCD corrections,” JHEP 1105 (2011) 044, 1103.0621.
 (11) G. Cullen, N. Greiner, G. Heinrich, G. Luisoni, P. Mastrolia, et al., “Automated OneLoop Calculations with GoSam,” Eur.Phys.J. C72 (2012) 1889, 1111.2034.
 (12) S. Agrawal, T. Hahn, and E. Mirabella, “FormCalc 7,” 1112.0124.
 (13) F. Cascioli, P. Maierhofer, and S. Pozzorini, “Scattering Amplitudes with Open Loops,” Phys.Rev.Lett. 108 (2012) 111601, 1111.5206.
 (14) P. Mastrolia and G. Ossola, “On the IntegrandReduction Method for TwoLoop Scattering Amplitudes,” JHEP 1111 (2011) 014, 1107.6041.
 (15) Z. Bern, M. Czakon, L. J. Dixon, D. A. Kosower, and V. A. Smirnov, “The FourLoop Planar Amplitude and Cusp Anomalous Dimension in Maximally Supersymmetric YangMills Theory,” Phys.Rev. D75 (2007) 085010, hepth/0610248.
 (16) J. J. Carrasco and H. Johansson, “FivePoint Amplitudes in N=4 SuperYangMills Theory and N=8 Supergravity,” Phys.Rev. D85 (2012) 025006, 1106.4711.
 (17) S. Badger, H. Frellesvig, and Y. Zhang, “HeptaCuts of TwoLoop Scattering Amplitudes,” 1202.2019.
 (18) J. Gluza, K. Kajda, and D. A. Kosower, “Towards a Basis for Planar TwoLoop Integrals,” Phys.Rev. D83 (2011) 045012, 1009.0472.
 (19) B. Buchberger, “An Algorithmical Criterion for the Solvability of Algebraic Systems of Equations,” Aequationes Mathematicae 4 (1970) 374.
 (20) D. A. Cox, J. B. Little, and D. O’Shea, Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra. Springer, 2th ed., 1997.
 (21) D. A. Cox, J. B. Little, and D. O’Shea, Using Algebraic Geometry. Springer, 2th ed., 2005.
 (22) H. Möller, “On decomposing systems of polynomial equations with finitely many solutions,” Applicable Algebra in Engineering, Communication and Computing 4 (1993) 217–230. 10.1007/BF01200146.
 (23) F. Rouillier, “Solving zerodimensional systems through the rational univariate representation,” Applicable Algebra in Engineering, Communication and Computing 9 (1999) 433–461. 10.1007/s002000050114.
 (24) B. Sturmfels, Solving Systems of Polynomial Equations. AMS, 2002.
 (25) J. Verschelde, Lecture notes for the graduate course MCS 563 Analytic Symbolic Computation. University of Illinois at Chicago, 2011.
 (26) P. Mastrolia, E. Mirabella, and T. Peraro, “Integrand reduction of oneloop scattering amplitudes through Laurent series expansion,” 1203.0291.
 (27) R. K. Ellis, W. T. Giele, and Z. Kunszt, “A Numerical Unitarity Formalism for Evaluating OneLoop Amplitudes,” JHEP 03 (2008) 003, 0708.2398.
 (28) W. T. Giele, Z. Kunszt, and K. Melnikov, “Full oneloop amplitudes from tree amplitudes,” JHEP 0804 (2008) 049, 0801.2237.
 (29) R. Ellis, W. T. Giele, Z. Kunszt, and K. Melnikov, “Masses, fermions and generalized dimensional unitarity,” Nucl.Phys. B822 (2009) 270–282, 0806.3467.
 (30) Y. Zhang, “IntegrandLevel Reduction of Loop Amplitudes by Computational Algebraic Geometry Methods,” 1205.5707.
 (31) G. Ossola, C. G. Papadopoulos, and R. Pittau, “Numerical evaluation of sixphoton amplitudes,” JHEP 0707 (2007) 085, 0704.1271.
 (32) G. Ossola, C. G. Papadopoulos, and R. Pittau, “CutTools: a program implementing the OPP reduction method to compute oneloop amplitudes,” JHEP 03 (2008) 042, 0711.3596.
 (33) G. Ossola, C. G. Papadopoulos, and R. Pittau, “On the Rational Terms of the oneloop amplitudes,” JHEP 0805 (2008) 004, 0802.1876.
 (34) P. Mastrolia, G. Ossola, C. Papadopoulos, and R. Pittau, “Optimizing the Reduction of OneLoop Amplitudes,” JHEP 0806 (2008) 030, 0803.3964.
 (35) P. Mastrolia, G. Ossola, T. Reiter, and F. Tramontano, “Scattering AMplitudes from Unitaritybased Reduction Algorithm at the Integrandlevel,” JHEP 1008 (2010) 080, 1006.0710.
 (36) R. Ellis, Z. Kunszt, K. Melnikov, and G. Zanderighi, “Oneloop calculations in quantum field theory: from Feynman diagrams to unitarity cuts,” 1105.4319.
 (37) D. Maitre and P. Mastrolia, “S@M, a Mathematica Implementation of the SpinorHelicity Formalism,” Comput. Phys. Commun. 179 (2008) 501–574, 0710.5559.