{'fraction_non_alphanumeric': 0.04159677960415968, 'fraction_numerical': 0.01371650080137165, 'mean_word_length': 4.214771622934888, 'pattern_counts': {'":': 0, '<': 5, '<?xml version=': 0, '>': 2, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 23, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Nonplanar on-shell diagrams and leading singularities of scattering amplitudes

Bipartite on-shell diagrams are the latest tool in constructing scattering amplitudes. In this paper we prove that a Britto–Cachazo–Feng–Witten (BCFW) decomposable on-shell diagram process a rational top form if and only if the algebraic ideal comprised the geometrical constraints are shifted linearly during successive BCFW integrations. With a proper geometric interpretation of the constraints in the Grassmannian manifold, the rational top form integration contours can thus be obtained, and understood, in a straightforward way. All rational top form integrands of arbitrary higher loops leading singularities can therefore be derived recursively, as long as the corresponding on-shell diagram is BCFW decomposable.

A leading singularity can be viewed as a contour integral over a Grassmannian manifold [37][38][39][40][41][42]. This expression of the leading singularity keeps many symmetries, in particular, the Yangian symmetry, cyclic and parity symmetries, manifest. On the one hand this new form makes the expression of amplitudes simple and hence easy to calculate. On the other hand it is related to the central ideas in algebraic geometry: Grassmmannian, stratification, algebraic varieties, toric geometry, and intersection theory etc. For leading singularities of the planar amplitudes in N = 4 super Yang-Mills (SYM), Arkani-Hamed et al. [43] proposed using positive Grassmannian to study them along with the constructions of the bipartite on-shell -all internal legs are put on shelldiagrams [44].
Top forms and the d"log" forms of the Grassmannian integrals are systematically studied for planar diagrams. Each on-shell diagram corresponds to a Yangian invariant, as shown in [31] at tree level and [32,33,47] at loop level. (See also [48,49] for earlier work and [50][51][52][53][54][55][56][57][58][59][60][61][62][63][64] for a sample of interesting developments thereafter, and [65][66][67][68][69][70][71][72][73][74][75][76][77] for a sample of reviews; also a new book has appeared [78]. ) We report, in this paper, our detailed and systematic studies of the nonplanar on-shell diagrams which can be decomposed by removing BCFW bridges and applying a U(1) decoupling relation of the four-and three-point amplitudes (or just decomposable diagrams for convenience). For wide classes of leading singularities, the corresponding on-shell diagrams are decomposable diagrams. We first construct the chain of BCFW decompositions for the on-shell diagrams. During this process we obtain the unglued diagram by cutting an internal line. We prove any unglued diagrams can be categorized into three distinct classes which can be subsequently turned into identity utilizing crucially the permutation relation of generalized Yangian invariants [79]. This construction is presented in Sect. 2.
We then proceed to the study of the geometry of the leading singularities. We are interested in the constraints encoded in the Grassmannian manifolds and how these constraints determine the integration contours in the top forms. As the cyclic order is destroyed by nonplanarity the integrand of Grassmannian integral also needs to be constructed from scratch. To achieve the above goals we attach nonadjacent BCFW bridges to the planar diagrams and observe how the integrands and the C-matrices transform. Further we can construct the (rational) top form including both integrand and integration contour of any nonplanar leading singularity by attaching (linear) BCFW bridges to the identity diagram in the reverse order of the BCFW decomposition chain from the previous section. This construction is presented in Sect. 3

Scattering amplitudes: BCFW decomposition
In an on-shell diagram representing an L-loop leading singularity, we are free to pull out a planar sub-diagram (unglued diagram) between two internal loop lines -both are also onshell as shown in Fig. 1. 1 Locally the sub-diagram is planar except that we cannot perform BCFW integrations on these two loop lines. We proved that every such sub-diagram, upon the removal of all BCFW bridges in the permutations, can be cast into one of the three distinct types of skeleton graphs. A U (1)-decoupling relation can be further performed on the latter two types. And the Lth loop is unfolded. Unfolding the loops recursively, we obtain the BCFW decomposition chain for the leading singularities of any L-loop nonplanar amplitudes. In other words the BCFW chain captures all the information of the leading singularities of the L-loop nonplanar graphs. We are thus able to reconstruct the onshell diagrams by attaching BCFW bridges from the identity.
In this section, we will introduce a systematic way of finding the BCFW bridge decomposition chain from the marked permutations 2 of the unglued diagrams.

From permutations to BCFW decompositions
In this subsection, we derive the BCFW bridge decomposition chain from the permutation of the unglued diagram. First we perform BCFW bridge decompositions on the unglued diagram according to a marked permutation, leaving the cut lines untouched. Upon the removal of all adjacent bridges, we will arrive at three categories of skeleton diagrams, noticing that the category type is invariant under the BCFW bridge decomposition. Next for each category of skeleton diagram we construct a specific recipe to decompose it to identity.
From unglued diagram to skeleton diagram All unglued diagrams can be categorized into three groups depending on the permutations of the two cut lines, denoted A andĀ, To decompose an unglued diagram, the first step is the full removal of two types of adjacent bridges on the target diagram: the white-black bridge and the black-white bridge as shown in Fig. 2. The changes to the permutation after removing either of them are, respectively, σ → σ = Z 2 (k, k+1)·σ and σ → σ = Z 2 (σ −1 (k), σ −1 (k + 1)) · σ , where Z 2 (k, k+1) is a Z 2 permutation between line k and k+1 [43]. For an unglued diagram arisen from a nonplanar leading singularity, the cut line should not be involved in BCFW bridge decompositions as the pair of marked lines are to be glued back eventually. Thus we should restrict the set of allowed BCFW bridge decompositions to those preserving the two marked legs. By this restriction, the group our target unglued diagram originally belongs to will not alter during bridge decompositions.  Due to the existence of nonadjacent bridges, an unglued diagram cannot be fully decomposed and will pause at a certain diagram. It is easy to see that after removing all BW and WB bridges the three groups of unglued diagrams will fall into External line pair, Black-White Chain and Box Chain respectively. The three categories are named after their general patterns as shown in Fig. 3. We refer to any diagram belonging to the above three categories as the "skeleton diagram", naming after its skinny looks. As long as we can fully decompose all three skeleton diagrams, it is then direct to obtain the complete decomposition chain of any unglued diagram.
From skeleton diagram to identity -External line pair: Most external lines are paired. The external lines next to the internal cut line may also attach to the black/white vertices or be paired with the internal cut line as shown in Fig. 3a. For this type of on-shell diagrams, gluing back the internal lines and removing all pairs will lead to the identity. -Black-white chain: In this case, white and black vertices are connected together recursively, as shown in Fig. 3b.
To further decompose, we use the amplitudes relation A(a 1 , a 2 , a 3 ) = −A(a 1 , a 3 , a 2 ) (see Fig. 4) to twist one down-leg to up-leg. Then an adjacent bridge will appear. By removing the new appeared BCFW bridge, the diagram is unfolded into a planar diagram. The diagram can then be decomposed to identity according to its permutation [43]. -Box chain: In this case, the diagram is composed of boxes linked to a chain, as shown in Fig. 3c. Using the U (1) decoupling relation [80] of the four point amplitudes (see Fig. 5), this diagram turns into the sum of two diagrams with adjacent BCFW bridges. The nonadjacent legs of the box will become adjacent under this operation. Performing adjacent BCFW decompositions on both diagrams will unfold the loop and arrive at two planar diagrams, which can be decomposed to identity.

Scattering amplitudes: the top form
Through the BCFW bridge decompositions we obtain the dlog form characterized by the bridge parameters. The dlog form can be viewed as an explicit parameterization of a more general integration over the Grassmannian manifold, which is invariant under the G L(k) transformations. The invariant form, known as the "top form," for planar diagrams has been constructed in [43]. In this section, we construct the top form for the nonplanar leading singularities. Recent progress on nonplanar on-shell diagrams can be found in [45,46]. For planar diagrams, the top form manifests the Yangian symmetry: the leading singularities can be written as multidimensional residues in the Grassmannian manifold G(k, n), where is a sub-manifold of G(k, n). is constrained by a set of linear relations among the columns of C -certain minors of C are to be zero. As any function of the minors of C, f (C), has the scaling property f (tC) = t k×n f (C). To construct the top form for nonplanar leading singularities, we need to determine the integration contour and the integrand f (C). Since the integration contour is constrained by a set of geometrical relations linear in the α, we make use of the BCFW chain we obtained in Sect. 2 to look for all geometric constraints, fixing in the process. Next we will see, with the BCFW approach extended to loop level, the integrand of the top form can be calculated by attaching BCFW bridges.

Geometry and the BCFW bridge decomposition
In this subsection we shall introduce the method of searching for geometric constraints in the Grassmannian matrix. Geometric constraints are linear relations among columns of C matrix. In fact, the total space is taken as (k −1)-dimensional projective space. Each column denoted by the index of the external line can be map to a point in the projective space. Each time we attach a bridge a constraint will be fixed and the geometry constraints change accordingly. In the Grassmannian matrix, adding a white-black bridge on external lines a, b yields a linear transformations of the two columns, a and b, a −→ a = αa + b; whereas adding a black-white bridge For convenience, we divide the geometric constraint into two types: simple coplanar constraint and tangled coplanar constraint. Simple coplanarity is just the coplanarity among the points corresponding to the external line. For the tangled coplanar constraint, at least one point is formed by the intersection of super-planes characterized by the point of the external line. We first present an example for each case.
Example for tangled coplanarity We consider a nonplanar two-loop diagram, A 3 6 , as shown in Fig. 7. The BCFW decomposition chain is Then the top form of the diagram can be reconstructed by attaching these bridges one by one. There are eight bridges and each one diminish a coplanar constraint as shown in Table 2.
The first seven bridges attached yield simple coplanar constraints. Then the geometry constraints are (2, 3, 4) 2 , (3, 5, 6) 2 , which indicates that points 2, 3, 4 and 3, 5, 6 are Table 1 The evolution of the geometry constraints under adding BCFW bridges. The first row is the linear relation in the identity diagram and the column on the left represents the bridge decomposition chain

Bridge
Coplanar constraints collinear, respectively, as shown in Fig. 8. Then we attach the last bridge. As discussed above, point 3 is shifted to3 along the line- (31). It seems the 2,3, 4 and3, 5, 6 are not collinear anymore and the two constraints are removed together. In fact, according to Fig. 8, there is another coplanar constraint that is the intersect point (1 3) ∩ (2 4) lie in the line of (5 6). For convenience, we denote this tangled coplanar relation as ((1 3) ∩ (2 4) 5 6). The geometry evolution under the last bridge (1, 3) is shown in Fig. 8. General simple coplanar constraints We first discuss the cases without tangled coplanar constraints. We can classify 1. (a, b, 1, 2 where k 1 to k 4 are the ranks of the minors. Without loss of generality, we shall make k 1 < m 1 + 2, k 2 < m 2 + 1, k 3 < m 3 + 1 and k 4 < m 4 . We call the minor complete if only if adding any other column to the matrix will make the rank increase by one. From now on we shall assume that all the minors in the above sets are complete in the following discussion. In fact, incomplete minors can always be transformed into the complete ones by adding to the bracket all the necessary elements while keeping the rank unaltered. Attaching a white-black bridge does not change the rank of minors in set 1 since a and b are both in this set. The minors in set 2 and set 4 remain unaltered since b is excluded from these two sets. (αa + b) / ∈ span{b, 1, 2 . . . m 3 }, thus after adding a white-black bridge the only set with its rank altered is set 3. The minors in set 3 can generate two new linear relations: (a, b, 1, 2 . . . m 3 ) k 3 +1 and (1, 2 . . . m 3 ) k 3 . Similarly, upon attaching a black-white bridge, the minors in set 2 will become (a, b, 1, 2 . . . m 2 ) k 2 +1 and (1, 2 . . . m 2 ) k 2 . We have completed the discussion of how constraints alter during each step of bridge decompositions.
Next we turn to attaching bridges starting from the identity with the identity diagram being a matrix with n − k columns of zero vectors. Each time we attach a BCFW bridge, the number of independent geometric constraints will decrease by one. This can be proved through the following procedure. Attaching the bridge (a, b) affects the linear relation involving b. The only exceptions are the relations containing both a and b, which will not be affected by the bridge (a, b),  General tangled coplanar constraints Now we discuss the tangled coplanar constraints. When we attach a BCFW bridge, X → X = X + αY . 3 There are two constraints (X A 1 A 2 . . . A i 1 ) i 1 and (X B 1 B 2 . . . B i 2 ) i 2 both containing the shifting leg. Without losing generality, we assume that there is no constraints among A 1 , A 2 . . . A i 1 and B 1 , B 2 . . . B i 2 . Upon attaching a BCFW bridge a tangled constraint could be obtained: where V stands for the volume of the hyperpolyhedron.
It is indeed a geometric constraint on the Grassmannian manifold -the point of intersection of one line and one hyperplane lying on another hyperplane: We denote the intersection point of ( Thus the initial constraint (Q A 1 A 2 . . . A i 1 ) i 1 directly yields Eq. 3. One may have noticed that the point Q is precisely the point X before shifting. If we go on attaching another bridge that involves this tangled constraint, the set of constraints can again be written as minors of the Grassmannian matrix ( Fig. 9). Therefore we conclude that general constraints can always be labeled using nested spans and intersections. Consider attaching a linear BCFW bridge (Y, X ) in an arbitrary amplitude, a constraint to be shifted is with X being the external line to be shifted, A (·) and B (·) denoting two sets of external lines. If column X ∈ Set[A (·) ] or X ∈ Set[B (·) ], they can be freely replaced byX after attaching the bridge involving X . Otherwise the constraint will be a nonlinear function of α, resulting in an irrational top form. We present a counter example in the appendix to illustrate this point. We can then simplify M(X ) as follows: whereĀ (·) are some points or hyperplanes composed by A (·) and B (·) and are easily obtained through a simple relation, After the shift the constraint M(X ) is removed. In order to obtain the other constraints, we look for the C representation of X . This is achieved by unfolding the nested intersections level by level.
To write a constraint in a compact form and make the geometric relations encoded manifest, We define a line L(X ),

All levels of R (i) (X ) can be recursively obtained according to
The geometrical relations is shown in Fig. 10. Finally we are able to denote the column X using the columns in the shifted Grassmannian, X = (R (1) After removing the constraint M(X ) = 0, the remaining constraints are invariant under the C representation of X , making them independent of the shift (Y, X ).
For now we have obtained geometry constraints according to BCFW bridge decomposition chain. We would like to stress that our approach can be applied to seeking all loop leading singularity's geometry constraints. During the process, we introduced a method that the constraints are independently and completely represented. The constraints of the graph constructed by any "top form bridge" are immediately obtained using our method. Thus the top form integrations' contour is determined.

Rational top forms and linear BCFW bridges
Attaching BCFW bridges and using the 3-or 4-point amplitude relations reductively, all nonplanar diagrams can be constructed and their dlog forms be found. We should stress, however, that not all nonplanar on-shell diagrams have rational top forms; and it is worth to remark on which kind of nonplanar on-shell diagrams can have rational top forms. We address this question by building up an equivalent relation between rational top form and linear BCFW bridges. If a BCFW bridge results in the shifted constraint function to be a linear function of α, we call this BCFW bridge a linear BCFW bridge.
A constraint function F i is a rational function of the minors of the Grassmannian matrix, C. Altogether they span an algebraic ideal I[{F i }]. Under a BCFW shift X → X = X +αY , a constraint is eliminated, with C being transformed to C. The transformed f ( C) is also rational iff α is also a rational function of C.
Next we need to show that rationality of α is guaranteed by the linear BCFW shifts. To prove their equivalence, assuming α = P( C)/Q( C), where P, Q are polynomials of minors of C. Expanding P, Q as polynomials of α as well as the minors of C, α = P 0 + P 1 α + P 2 α 2 + · · · + P N α N Q 1 + Q 2 α + · · · + Q N α N −1 .
The coefficient in each power of α, such as P 0 , P 1 − Q 1 , P 2 − Q 2 , · · · , P N − Q N , is supposed to vanish. If any of them appears to be nonzero, it must fall into the ideal This means that all the coefficients are constraints of C. Under the shift, P i and Q i become The constraint P N − Q N remains the same after the shift P N − Q N = P N − Q N . The constraint P N −1 − Q N −1 = 0 appears linearly dependent on α upon does not vanish then the constraint P N −1 − Q N −1 = 0 is the removed. Otherwise P N = Q N = 0 and the constraint P N −2 − Q N −2 = 0 is shifted linearly, Since P( C) cannot be totally independent of α, we can trace the constraints from N to 0 until we find one constraint (P i − Q i ), which is a linear function of α after a shift. This constraint is then the constraint being removed. The proof of the reverse is also straightforward: if one constraint becomes a linear function of α under a shift, for instance Note that the remaining s − 1 constraints can be written in the form F i (· · · X − αY · · · ) = 0, for i ∈ [2, s], which are invariant under the shift.
Finally we conclude that upon adding a BCFW bridge the on-shell diagram resulted has a rational top form if and only if the shift on the algebra ideal I is linear. For a generic on-shell diagram, BCFW bridges can be added in an arbitrary manner and the transformations on the constraints are complicated. Top forms can be obtained if and only if when the BCFW parameters shift the constraints linearly. This type of bridges is thus called linear BCFW bridges. In the construction of top forms one should avoid using BCFW bridges that shift the constraints in a nonlinear manner.

From BCFW decompositions to top forms
To obtain the top form of scattering amplitudes, besides the geometric constraints, we also need to get the integrand, f (C). It must then contain those poles equivalent to the constraints in to keep the non-vanishing of the circleintegration in Eq. 1. Each BCFW bridge removes one pole in f (C) by shifting a zero minor to be nonzero: in tangled cases the poles in the integrand must change their forms accordingly.
To see this we parameterize the constraint matrix, C, using the BCFW parameter, α. In the last BCFW shift X → X = X +αY, several minors in f (C) become functions of α. There exists at least one minor M 0 ( X ) = M 0 (X ) + α R(Y ) having a pole at α = 0. After this shift, M 0 (X ) → M 0 ( X ), the constraint M 0 (X ) = 0 is removed. And α = M 0 ( X )/R(Y ) is then a rational function of C and can be subtracted from the other shifted minors to obtain the shift-invariant minors of . This is demonstrated in Sect. 3. 2 We can further attach a BCFW bridge to the integrand, In this way top forms of leading singularities of scattering amplitudes can thus be obtained -be it planar or nonplanar -and from tree level to all loops. We illustrate our method below with several examples: searching for the constraints and calculating the top form integrand.

Several examples
A one-loop example of attaching a nonadjacent bridge As an application, we take the nonplanar diagram in Fig. 11 as an example.
According to the permutation of the planar diagrams before attaching the bridge (1, 6), linear relations of the diagram are (4, 5, 6, 7) 2 and (8, 1, 2, 3) 3 . And the top form is where we have omitted the delta functions for clarity. Attaching bridge (1, 6), the coplanar constraint ( Therefore, we can always construct the top form of nonplanar diagrams by attaching adjacent and nonadjacent bridges on the identity diagram step by step.
A tangled two-loop example At multi-loop level the geometric constraints for a nonplanar leading singularity can be highly tangled, as the diagrams cannot, in general, be reduced to the planar ones by KK relation [80].
The diagram is a planar one before attaching the bridge (3,5) in the seventh step and the top form is where we have omitted the delta functions for clarity. After attaching BCFW bridge (3,5), the on-shell diagram become planar. The top form can be obtained directly as in the previous paragraph, here the constraints are determined by the linear relation (2, 3, 4) 2 and (3, 5, 6) 2 as shown in Table 2. We do not distinguish the labels for each step in adding the BCFW bridges. We work according to the discussion above, upon attaching the last BCFW bridge

MHV top form and its simplification
The MHV top form can be further simplified. We can always transform any nonplanar MHV top form into a summation of several top forms. These generated top forms share features that their numerators of the integrands equal 1 and the minors in f (C) are of cyclic orders, which are exactly those of planar MHV top forms. This yields a strong proof that any nonplanar MHV amplitude is a summation of several planar amplitudes.
To see this, let us consider the top form of A 2 n . Attaching a nonadjacent bridge (a, b) to a planar diagram yields Without losing generality, we assume the pole at (b −1, b) = 0. Following the same procedure illustrated in Eq. 1, we obtain Since a < b − 1, we define a + m = b − 1 (m ∈ Z + ).
-If m = 1, the numerator is then (b − 2, b − 1) and the integrand can be simplified to a term with its numerator equaling one and f (C) of cyclic orders, i.e. a planar one. -If m > 1, we can multiply the numerator and denominator by (a + 1, b): The first term is already planar, while the second is not obvious.
-If m = 2, the second term is planar.
-If m > 2, we multiply the integrand by (a + 2, b), (a +  3, b), . . . , (a + m − 1, b) one by one. For each step of multiplication, we utilize the Pluck relation to transform the nonplanar term into a summation of planar terms and a remaining term. The final term left after series of multiplication is Since a + m = b − 1, this term is also planar. Following these steps, we can finally simplify the top forms of all nonplanar MHV amplitudes into the sum of planar ones. One can easily verify that the simplification process from nonplanar one to planar term's summation is equivalent to applying the KK relation to the MHV amplitudes.
In this section, we construct the top forms of the nonplanar on-shell graphs. The key step is attaching a nonadjacent BCFW bridge to a planar diagram. The cyclic order of f (C) is then broken and we obtain a different integrand from the planar ones. Keep attaching bridges on the identity and we can arrive at the top form of our target -the nonplanar leading singularity. We then break down the top forms of the nonplanar MHV amplitudes into a summation of the planar top forms. For the leading singularities of the one-loop amplitudes, this simplification is similar to the KK relation. For leading singularities of the general amplitudes, the relation between the top form's simplification and the KK relation will be discussed in our future work (Table 3).

Conclusion
We have classified nonplanar on-shell diagrams according to whether they possess rational top forms, and we proved its equivalence to linear BCFW bridges. We conclude that when attaching linear bridges, geometric constraints of the nonplanar diagrams -tangled or untangled -can all be constructed systematically. With this chain of BCFW bridges rational top forms of the nonplanar on-shell diagrams can then be derived in a straightforward way. This method applies to leading singularities of nonplanar multi-loop amplitudes beyond MHV.
sive α-shift transforms the constraints linearly and can thus be represented by a rational function of minors of the underlying constraint C-matrix. However, not all on-shell diagrams are made up completely of such bridges: the constraints can be nonlinear in alpha and cannot be written as rational functions under some shift. Such an on-shell diagram will not have a rational top form.
We present a counter example, A 4 10 . Upon attaching the bridge (3,4), two constraints (2,3,4,8) 3 and (1, 3, 4, 6) 3 emerge (the superscripts denote the number of independent column vectors), with two columns, 3 and 4, being the same. Attaching the bridge (5, 3), one of the constraints is removed and the other one becomes ((5, 3) ∩ (2, 4, 8), 1, 4, 6) 3 . If we go on attaching the bridge (7,4), the tangled constraint is removed. However, due to the column 4 appearing twice in that constraint, such a bridge results in a nonlinear shift of the algebraic ideal. Therefore such a α-shift cannot be represented linearly by some minor being zero, violating our linearity requirements in the construction of rational top forms.