Framework for a novel mixed analytical/numerical approach for the computation of two-loop $N$-point Feynman diagrams

A framework to represent and compute two-loop $N$-point Feynman diagrams as double-integrals is discussed. The integrands are 'generalised one-loop type"multi-point functions multiplied by simple weighting factors. The final integrations over these two variables are to be performed numerically, whereas the ingredients involved in the integrands, in particular the"generalised one-loop type"functions, are computed analytically. The idea is illustrated on a few examples of scalar three- and four-point functions.


Introduction
A key ingredient in an automated evaluation of two-loop multileg processes is a fast and numerically stable evaluation of scalar Feynman integrals. The derivation of a fully analytic result remains beyond reach so far in the general mass case. On the opposite side, in particular for the calculation of two-loop three-and four-point functions in the general complex mass case relying on multidimensional numerical integration by means of sector decomposition [1][2][3][4][5] a reliable result has a high computing cost. Approaches based on Mellin-Barnes techniques [6][7][8][9][10] allow to perform part of the integrals analytically, yet, as far as we know, the number of integrals left over for numerical quadratures depends on the topologies considered and can remain rather costly. It would therefore be useful to perform part of the Feynman parameter integrations analytically in a systematic way to reduce the number of numerical quadratures.
This article aims at initiating such a working program, advocating the implementation of two-loop N -point functions in n dimensions (2) I n N as (weighted sums of) double integrals in the form: (2) where W (ρ, ξ) are weighting functions given analytically. The factors (1) I n N (ρ, ξ) are N -point functions of some "generalised one-loop type" in a sense explained below. Once the (1) I n N (ρ, ξ) computed analytically, the (2) I n N are obtained by numerical quadrature over the sole two remaining variables ρ and ξ, which represents a substantial gain w.r.t. a fully numerical integration over the many Feynman parameter of the primary two-loop integral.
In this article, we first provide a general argument in sec. 2. In sec. 3, we show that the polytopes spanned by the Feynman parameters related to the "generalised one-loop functions" can always be partitioned into simplices. We then illustrate the general argument given in sec. 2 considering an example of three-point scalar diagram (2) I 4 3 with a non planar topology in sec. 4, and an example of four-point scalar diagram (2) I 4 4 with a non planar topology in sec. 5 1 . Sec. 6 concludes this article with an overview of extensions of the present program to be presented in subsequent publications. Finally, Appendix A provides a proof that, for any general N -point two-loop diagram in a scalar theory with three-leg vertices with different topologies, a shrewd choice of parametrisation can always be found which leads to simplified building blocks in the "generalised one-loop" amplitude.

General argument
Let us consider an arbitrary two-loop Feynman diagram with topology T involving N external legs with external momenta {p i , i = 1, · · · , N } and I internal lines with internal masses {m 2 k , k = 1, · · · , I}. To simplify we stick here to a scalar function i.e. we ignore sophistications that may arise from spin-carrying internal lines and/or derivative couplings. We need not specify the type 1 of scalar vertices considered either. The integral representation of the diagram is given by: (2) where the internal momenta {q k } are graded sums of the two loop momenta k l , l = 1, 2 and the external momenta {p i }. In order to introduce our notations we recast eq. (2) into the following mixed parametric representation of this diagram: (2) The integration over the two loop momenta k i is made easier rewriting the denominator in the integrand as follows: In eq. (4) the elements of the 2 × 2 symmetric matrix A are sums of Feynman parameters τ k 's, whereas the n-vectors r l are linear combinations of external momenta {p i } weighted by Feynman parameters {τ k }. The compact notations mean: The term C is of the form where the matrix Q is linear in the Feynman parameters {τ k }. The integrations over the two loop momenta k l , then over the parameter α yield 2 : where the term D is given by: 2 up to a constant factor (−1) I+1 (4π) −n Γ(I − n) irrelevant here, which will be dropped in the following.

2
The determinant det(A) is real and non negative as will be seen below, which allows to rewrite for later convenience: with where Cof[A] is the matrix of cofactors of A. The matrix A, the momenta r i and the scalar function C depend linearly on the τ k 's, thus F is homogeneous of degree 3 in the τ k 's. Besides its dependence on the {τ k }, the factor F also depends on the external momenta {p j }, the internal masses {m 2 k } and the topology T of the diagram; these extra dependences will not be made explicit in what follows to lighten the notations. The parametric representation for (2) I n N which we thereby obtained identifies with the one introduced e.g. in [11]. It is synthesised in: The parametric representation (9) is the actual starting point of this article.
At this stage, we may note that spin-carrying internal lines and/or derivative couplings would amount to some Feynman parameter-dependent numerator together with modifications of the powers which the factors det(A) and F in eq. (5) are raised to. Yet these sophistications, together with the combinatoric relations relating the number of external and internal lines and of vertices of the various kinds, which would come from the specification of the types of particles and vertices involved, are beside the point which we wish to make here.
Let us partition the set of Feynman parameter labels {1, · · · , I} into three subsets S j and define three auxiliary parameters ρ j , j = 1, 2, 3 accordingly as follows: i) S 1 contains the labels of the internal lines involving only k 1 not k 2 , to S 1 is associated ρ 1 ≡ i∈S 1 τ i ; ii) S 2 contains the labels of internal lines involving only k 2 not k 1 , to S 2 is associated ρ 2 ≡ i∈S 2 τ i ; iii) S 3 contains the labels of internal lines common to the two overlapping loops. Each of these lines involves the same combination 3 k 1 + k 2 , so that the matrix element A 12 weighting the scalar product (k 1 · k 2 ) in the first term of eq. (4) is equal to the combination ρ 3 ≡ i∈S 3 τ i . The ρ j 's thus fulfil the constraint The elements of the matrix A read: Hence: The determinant det(A) is clearly non negative. Let |S j | be the number of elements of S j , with |S 1 | + |S 2 | + |S 3 | = I. Let us introduce |S j | parameters u k j with k j ∈ S j so as to reparametrise the τ k j summing up into ρ j as follows: Accordingly the reparametrised integration measure takes the following factorised form: With this reparametrisation, the elements of the A matrix depend only on the parameters ρ j and on none of the u i 's, so do Cof[A] and det(A). In F, the dependence in the u i 's enters through the factors (r i · r j ), quadratically, and through the term C, linearly. The term F may thus be seen as a polynomial of second degree in the u i 's and can thus be interpreted as building up the integrand of a "generalised" one-loop function represented as a Feynman integral over the u i 's. The integral representation of the two-loop diagram (2) I n N ({p j }; T ) can thus be recast in the following form: where we have introduced (1) and we have set N = I − 2 and n = 2 (n − 2). The reparametrisation of (2) I n N ({p j }; T ) according to eqs. (15), (16) has already been used in the literature [12][13][14][15] in order to perform the integration over all Feynman parameters fully numerically. We alternatively wish to advocate here the separate identification of (1) I n N in eq. (16) with n − I = −N +n /2 as a N -point function of "generalised one-loop type" in n dimensions, and the possibility to compute (1) I n N analytically.
The above qualificative "generalised one-loop type" refers to two kinds of generalisations. The matrix G somehow plays the role of an "effective Gram matrix", with which it shares a few features, namely it is real and symmetric and it does not depend on the (possibly complex) internal masses. Although not made explicit, V and C depend on the internal masses. Let us note that this effective kinematics of the "generalised" one-loop function depends on the ρ j seen as "external" parameters beside the external momenta p k 's, and that it may span a larger parameter space than the one involved in standard one-loop N -point functions involved in collider processes at one loop.
2) Unlike for the standard one-loop function, the integration domain of the parameters u k 's is not the usual ( The quantity F formally reads: where U is the column (I−3)-vector gathering the yet unintegrated ( . The two-dimensional integral representation and the corresponding weighting function W advocated in eq. (1) are readily obtained from eq. (15) using a reparametrisation of the form A few illustrative examples are provided in the sections 4 and 5. More details will be provided in subsequent papers.

Decomposition of polytopes into simplices
Since the integration domain spanned by the u i 's is not the simplex anymore, one might fear that the above functions of "generalised one-loop type" be not computable analytically because the standard one-loop methods could not be used. This fear is groundless, as general theorems on triangulation [16] ensure that any (I − 3)-polytope can be partitioned into (I − 3)-simplices; furthermore the polytope V = Σ |S 1 |−1 × Σ |S 2 |−1 × Σ |S 3 |−1 spanned by the u i 's being convex, the imaginary part Im(F −iλ) keeps a constant (minus) sign over V even with internal general complex masses, hence it does also over each of the simplices involved in such a partition.

Two-loop three-point functions with three-leg vertices
In this section, we explicitly build such partitions in the cases of two-loop three-point functions involving three-leg vertices. In these cases, V being three-dimensional, such a decomposition can thus be readily performed and visualised. Anticipating on the next section, the domains spanned by the u i 's for, respectively, the planar and non planar two-loop three-point functions are the wedge Π (0) fig. 1, can be partitioned into the two wedges: Π

Let us focus on Π
and the leftover volume denoted by Ξ (3) . The latter can be partitioned into the following two tetrahedra: These two tetrahedra are not isometric to Σ (3) because, for example: where l[AB] is the distance between the points A and B. Nevertheless these two tetrahedra can be mapped onto Σ (3) by affine transformations. Indeed, for any point M in the tetrahedron Θ ABH D , the vector − − → OM can be written as: Let us define the following basis of unit vectors : In terms of the u i 's eq. (19) translates into: with: Using eq. (20), the constraints on the u i 's of a point spanning the tetrahedron Θ ABH D , which read the column vector Y is readily seen to span Σ (3) too. Under an affine transformation of the type (20): U = U 0 + N T · Y , the second order polynomial F(U ) can be rewritten as: The new variables span Σ (3) in all contributions of the partition, and the second order polynomials take similar forms yet with Gram matrices G ( ) , vectors V ( ) and constants C ( ) depending on the parameters of the reparametrisations {U 0 , N } and proper to each contribution.

Other types of two-loop functions
For two-loop four point functions with three-leg vertices, and other cases for which V is fourdimensional or more, things are harder to visualise. Nevertheless, as already mentioned general theorems [16] on triangulation ensure that V can be partitioned into simplicies -this is the higher dimensional generalisation of the property whereby any polygon can be partitioned into triangles -and each of these (I − 3)-simplices can be further mapped onto the normalised (I − 3)simplex Σ (I−3) by an affine transformation of the u i coordinates. This proves that standard methods used to analytically compute ordinary one-loop N -point functions can also be used to analytically compute N -point functions of "generalised one-loop type" 5 . So long for the principles.
From a practical point of view, several triangulation methods are available, and the number of simplices as well as their sizes and shapes depend on the method used. The integration over each simplex will generate dilogarithms, some of which will cancel against other dilogarithms coming from other simplicies. Accordingly a question arises and practically matters regarding computational efficiency: what is the method which optimises the number of simplices so as to minimise the number of dilogarithms?
We will not elaborate more on this point in this article because we tackled the analytic computation and the issue of taming the proliferation of dilogarithms in an alternative way. In ref. [17] we have developed an alternative method to integrate over the u i 's which makes the integration over each Feynman parameter u i trivial, by representing the integrand as a derivative with respect to this Feynman parameter. For this purpose we use a "Stokes-type" identity and an integral representation requiring the introduction of an extra variable ranging from 0 to +∞ for each u i . This handling is iterated until no more Feynman parameter remains to be integrated over. These extra integral representations are then easily undone later on -this trick plays a role similar to a "catalyst" in chemistry.
The domain [0, +∞[ I−3 on which the auxiliary variables are integrated over is independent of the initial volume spanned by the u i 's. For example, for a four-point"generalised one-loop function" it is the principal octant. Thus, for a given number of external legs, whatever the volume spanned by the u i 's is, the domain of the leftover integrations over the new variables are always the same as in the case of the genuine one-loop, only the number of terms to integrate differs, and for all these terms the integration is of the same type. In other words, the method developed in ref. [17] and applied to the usual one-loop case where the volume of integration is a simplex merely for sake of illustration, can be used for more general integration domains, the only change will be the number of terms in the integrand. This alternative method thus provides another practical way to analytically compute the "generalised one-loop functions". The explicit application of this method to the computation of the "generalised one-loop functions" and its optimisation to tame the number of dilogarithms generated will be further elaborated in subsequent publications.

An example of scalar two-loop three-point topology
For illustrative purpose let us consider the non-planar diagram drawn on fig. 3. With N = 3, I = 6 and n = 4 this diagram has the following parametric integral representation: The factor F, whose cumbersome expression is not made explicit here, involves the matrix 6 A given by Let us reparametrise the Feynmam parameters τ k 's as follows: further with Let us note k 1 and k 2 the four-momenta running into the loops, the internal four-momenta of fig.  3 are given by: In addition, a mass m i is associated to each internal line with four-momentum q i . Each variable u 1 , u 2 and u 3 spans the interval Σ (1) = [0, 1]. The matrix G reads: whereas the vector V reads: and C is given by: The explicit expression for F then follows from eq. (17). We thereby get the advocated integral representation involving the four-point function of "generalised one-loop type" given by: The change of variables ρ 1 = ρ ξ, ρ 2 = ρ (1 − ξ), ρ 3 = (1 − ρ) amounts in eq. (32) to the replacement where the weighting function W (ρ, ξ) is given by: We chose to illustrate our purpose with the three-point non-planar topology whose corresponding integral is usually considered more touchy to compute than for the planar topology with the same three-leg type vertices. The latter can all be worked out in a very similar way, and the domain of integration over the parameters u 1 , u 2 , u 3 is found to be the cylinder with triangular cross section Σ (2) × [0, 1] where Σ (2) = {0 ≤ u 1 , u 2 , u 1 + u 2 ≤ 1} instead of the unit cube.

An example of scalar two-loop four-point topology
Let us now consider the non-planar diagram drawn on fig. 4. With N = 4, I = 7 and n = 4 this diagram has the following parametric integral representation: where the matrix A is given by The cumbersome expression of F is not made explicit here. Let us reparametrise the Feynmam parameters τ k 's as follows: further with Again, let us note by k 1 and k 2 the loop momenta, the q i 's are given by: To each internal line with four-momentum q i is associated a mass m i . Defining s = (p 1 + p 2 ) 2 , t = (p 1 + p 4 ) 2 , u = (p 1 + p 3 ) 2 , the matrix G reads: whereas the vector V reads: and C is given by: The explicit expression for F then follows from eq. (17). We thereby get the advocated integral representation involving the five-point function of "generalised one-loop type" given by: The change of variables ρ 1 = ρ ξ, ρ 2 = ρ (1 − ξ), ρ 3 = (1 − ρ) amounts in eq. (43) to the replacement where the weighting function W (ρ, ξ) is given by: Here again the four-point function with planar topology with the same three-leg type vertices can be worked out in a quite similar way.
In the two above examples, the term det(A) noticeably factorises in the expressions of the quantities V and C. This turns out to be a general feature at least for the type of three-leg vertices considered. More precisely, it can be shown that a parametrisation can always be found for which this property holds. A general proof is given in Appendix A for any N -point two-loop non planar topology, and a very similar proof holds true also for any planar topology with this type of vertex. This feature makes the discussion of both kinematic and fake singularities simpler and more transparent. In particular the Landau conditions to be fulfilled to encounter kinematic singularities take a simple form, whereas this parametrisation gives handles to circumvent possible numerical instabilities which might be induced by fake singularities. These issues will be more thoroughly discussed in a future publication.

Outlook
We do acknowledge that a long way shall still be scouted out to extend it to full-fledged two-loop tensor integrals appearing in general gauge theories with fermions and/or derivative couplings etc. covering the bestiary of all topologies and cases which appear in the general two-loop class of interest for precision collider physics. This marathon will not be undertaken any further in this account which intends to be a first step toward the completion of such a programme. Taking for granted that the approach advocated in this article already applies to a collection of relevant cases, a further issue consists in the analytical calculation of the above-coined "N -point functions of generalised one-loop type" in closed form. As seen in sec. 2, the latter are generalised in two respects with respect to "ordinary" one-loop functions involved in collider processes at one loop. Firstly, the kinematics involved in the computation depends on the extra integration variables ρ j 's or equivalently ρ and ξ seen here as external parameters and may thus span a wider kinematical phase space than ordinarily met in genuine one-loop cases. Secondly, the N -point functions of "generalised one-looptype" are provided by Feynman-type parametric integrals over domains differing from the ordinary (N − 1)-simplex. Although long-tested standard techniques developed for the genuine one-loop case might be customised to treat the new ones at hand as shown in sec. 3, the above two issues motivate the development of a novel approach which tackles both these issues in a systematic and straightforward way while computing the"generalised one-loop type functions". The presentation of such an approach and the exploration of its features is the subject of the publications [17][18][19]. More precisely, the method tailored for the computation of the "generalised one-loop functions" is implemented for the usual one-loop case with arbitrary kinematics for the real mass case in ref. [17], for the case of general complex masses in ref. [18], and lastly, for the IR/collinear divergent cases in ref. [19].
The extension of the strategy advocated above to more general cases will be elaborated in subsequent articles but let us try to discuss it more precisely. The complexity comes from the growing number of external legs as in the one-loop case but is also related to the number of internal legs, indeed the number of effective external legs for the underlying "generalised one-loop function" is the number of internal legs of the two-loop diagram minus 2. So the strategy will be to apply firstly our method to simple topologies, working with fixed number of external legs (two or three) and considering topologies with an increasing number of internal lines. Then, we will move to more complicated cases such as two-loop four-point functions involving "generalised one-loop functions" with up to five external legs. All what have been discussed so far is for scalar theories, in real life, we have to face gauge theories which lead to a "dressing" of the numerator because of spin 1/2 particles and derivative vertices. The method applied to these cases will involve "generalised one-loop functions" with a non-trivial numerator. Although reduction technics in principle apply to "generalised one-loop functions" because they are related to the invariance of the one-loop integrals under a shift of the internal 4-momentum running into the loop, their implementations in our case will be postponed after the completion of the scalar cases. There are ambiguities in our algorithm related to the parametrisation of the internal 4-momenta and also to the choice of the u parameters. It has been shown in appendix A that for some topologies det(A) factorises from V and C reducing the complexity of these terms. Although this property does not remove the ambiguities, this is clearly a good guideline to follow. Nevertheless, the choice of a fixed algorithm for all the topologies is premature at this point because the experiences gained with the computation of different topologies will mature it. The UV divergent case will not cause problems because our method works also if the space-time dimension is away from 4 as shown in ref. [19]. In addition, by power counting, it is easy to show, for scalar theories having three-and four-leg vertices, that the number of internal lines for the potential UV divergent diagrams is 4 thus the "generalised one-loop functions" to be considered are two-point functions.

In memoriam
This work was initiated by Prof. Shimizu after a visit to LAPTh. He explained to us his ideas about the numerical computation of scalar two-loop three-and four-point functions. He shared his notes partly in English, partly in Japanese with us and he encouraged us to push forward the project presented here combining an analytical approach for the "generalised one-loop functions" with a numerical computation of the left-over double parametric integration. J.-Ph. G. would like to thank Shimizu-sensei for giving him a taste of Japanese culture and for his kindness.

Acknowledgements
We would like to thank K. Kato for fruitful exchanges along this project.
A Factorisation of det(A) in V and C Different topologies for a general N -point two-loop diagram 7 are discussed in the frame of a scalar theory with three-leg vertices. The first topology studied will be treated in details, the main formulae will be set and the reason of this factorisation will be explained. Then, the other topologies will be discussed succinctly.
Let us consider first the following diagram with a non planar topology depicted in fig. 5. The n- momentum carried by each internal line j = 1, · · · , N +3 is labelled by q j , which can be parametrised in a general way as q j =k j +r j wherer j is some shift depending on the external momenta p l 's whereask j is a linear combination of the loop momenta k 1 and k 2 . Let us hereby specify these linear combinations as:k Ther j 's can be conveniently rewritten as: with where we have introduced the shorthand: In eq. (47) p N has been traded for − (t 1 +t N −1 ) using the overall momentum conservation p [1..N ] = 0. Energy-momentum conservation at each vertex implies that all ther j 's but two can be expressed in terms of two unfixed ones. These two arbitraryr's, which we implicitly chose 8 above to ber i+1 andr i+2 , reflect nothing but the invariance of the Feynman diagram under two independent shifts of the loop momenta k 1 and k 2 by arbitrary constants. The latter may be parametrised in a general way as:r This notational preamble being set, let us consider the quantity: Using specification (46) we write This defines the 2 × 2 matrix A whose elements are where we introduced the three parameters ρ k , k = 1, 2, 3 defined by: S 1 = {1, · · · , i + 1}, S 2 = {i + 2, · · · , N + 1}, and S 3 = {N + 2, N + 3} (54) closely following the discussion in sec. 2.
The second term of the r.h.s. of eq. (51) may be recast: where B is a 2 × (N − 1) matrix whose Feynman parameter dependent elements are read using eqs.
(47) and parametrisation (50): For a general parametrisation of the Feynman diagram, α j and β j are not all vanishing, the B matrix thus depends on all the Feynman parameters τ j . We can clarify this Feynman parameter dependence noting that the matrix B can be recast as follows: where B and ∆ are defined by and 16 The important property of B is that it depends neither on τ i+1 nor on τ i+2 nor on τ N +3 . Let us note T the (N − 1) column-vector whose elements are t 1 , · · · , t N −1 , which entered eq. (55). The bracketed term in the r.h.s. of eq. (8) can be re-written as: The term C in eq. (8) can in its turn be written using eqs. (47) and (50) as where Γ is a (N − 1) × (N − 1) matrix read on eq. (47) and given by As B, the matrix Γ depends neither on τ i+1 nor on τ i+2 nor τ N +3 . The ∆-dependent terms in eqs. (60) and (61) cancel each other in F, reflecting the independence of the Feynman diagram considered under the arbitrary shifts on loop momenta parametrised byr i+1 ,r i+2 . The quantity F simplifies into: Here comes the key point. Since none of the three parameters τ i+1 , τ i+2 and τ N +3 enters into the matrices B and Γ, the τ j 's may be conveniently reparametrised in three subsets corresponding respectively to j ∈ S k , k = 1, 2, 3 defined in eq. (54), introducing u l 's parameters such that the B matrix be homogeneous of degree 1 in the u l 's, namely 9 : With this choice, the term B T ·Cof[A]·B is homogeneous of degree 2 in the u i 's and the corresponding term (B · T ) T · Cof[A] · (B · T ) in eq. (63) thus contributes only to the U T · G · U of eq. (17), whereas the other term in eq. (63) only contributes to the terms V and C in eq. (17), which both appear to be ∝ det(A). Furthermore the term T T · Γ · T being homogeneous of degree 1 in the u i 's contributes only to V but not to C: the C term is thus a mere linear combination of m 2 i+1 , m 2 i+2 and m 2 N +3 .
Using these results we can proceed further and compute the matrix G, the vector V and the scalar C defined in eq. (17). The latter are the algebraic ingredients in terms of which the novel approach advocated in the outlook and presented in [17][18][19] naturally proceeds. This will be the purpose of future publications.
Let us move now to the other topologies. For those topologies, once the parametrisation of the internal lines has been chosen, the sequences for the proof of the factorisation are identical to the previous case, so they will not be reproduced here and only the matrices B will be given. The other non planar topology 10 corresponds to the diagram depicted in fig. 6. Using the same ¤ q 2 parametrisation for the q i 's as in the preceding topology studied, thek i 's are given by: and ther i 's by:r with . . .
The three sets of internal line labels become in this case: S 1 = {1, · · · , i}, S 2 = {i + 1, · · · , N } and S 3 = {N + 1, N + 2, N + 3} The 4-momentar i andr i+1 can be, in turn, parametrised with the t i , i = 1 . . . N − 1 as in eq. 50. It is already clear from this point that, since from energy-momentum conservation we achieved to have one internal line for each set S i , i = 1, 2, 3 whoser does not depend on the t i 's. Thus, because of its definition, the matrix B will not depend on the Feynman parameter associated to these three internal lines. Indeed, a simple computation along the the same lines as the first example treated shows that: which confirms that the three Feynman parameters τ i , τ i+1 and τ N +3 do not appear in the B matrix. Since these three Feynman parameters belong to the different sets S i , i = 1, 2, 3, it is always possible to choose the parameters u i ' s in such a way that B T · Cof[A] · B is homogeneous of degree 2 in these variables. Note that, in this case too, the Γ matrix does not depend on τ i , τ i+1 and τ N +3 .
For the third topology depicted in fig. 7, taking the same parametrisation for the q i 's as in the ¥ q 2 first case studied, these linear combinations are specified as: Ther j 's can be conveniently rewritten as: with . . .
The three sets of internal line labels become in this case: S 1 = {1, · · · , i}, S 2 = {i + 1, · · · , N } and S 3 = {N + 1} It is easy to realise that the B matrix will not depend on τ i and τ i+1 but will depend on τ N +1 . For this reason, after the reparametrisation of the Feynman parameters, the B matrix will not be homogeneous of degree 1 in the u i 's and thus the factorisation of det(A) in the V and C terms does not hold.