Labelled tree graphs, Feynman diagrams and disk integrals

In this note, we introduce and study a new class of"half integrands"in Cachazo-He-Yuan (CHY) formula, which naturally generalize the so-called Parke-Taylor factors; these are dubbed Cayley functions as each of them corresponds to a labelled tree graph. The CHY formula with a Cayley function squared gives a sum of Feynman diagrams, and we represent it by a combinatoric polytope whose vertices correspond to Feynman diagrams. We provide a simple graphic rule to derive the polytope from a labelled tree graph, and classify such polytopes ranging from the associahedron to the permutohedron. Furthermore, we study the linear space of such half integrands and find (1) a nice formula reducing any Cayley function to a sum of Parke-Taylor factors in the Kleiss-Kuijf basis (2) a set of Cayley functions as a new basis of the space; each element has the remarkable property that its CHY formula with a given Parke-Taylor factor gives either a single Feynman diagram or zero. We also briefly discuss applications of Cayley functions and the new basis in certain disk integrals of superstring theory.


Contents
In 2013, F. Cachazo, E. Y. Yuan and one of the authors found a new formulation for treelevel S-matrices for a large variety of massless theories in arbitrary dimensions [1][2][3][4] (for extension to more theories, see i.e. [5][6][7][8][9]). The key ingredient of the formulation is the so-called scattering equations, which link kinematics of n massless particles to points in the moduli space of n-punctured Riemann spheres, M 0,n [1,2]: where σ a denotes the position of the a th puncture on the Riemann sphere. The tree-level S-matrix can be compactly formulated as an integral over M 0,n localized on solutions of the scattering equations (1.1) [3]: where σ a,b := σ a − σ b and we have included delta functions imposing (1.1) in the measure dµ. Note that both the moduli space M 0,n and the scattering equations have an SL(2, C) redundancy; our definition of dµ means that we fix the SL(2, C) redundancy by deleting three dσ's and three delta-functions (e.g. both chosen to be i, j, k) with a compensation factor (σ i,j σ j,k σ k,i ) 2 . We will refer to (1.2) as CHY formula for amplitudes in a given theory, where I n is the "CHY integrand" of the theory that can generally also depends on momenta and polarizations. Note that for (1.2) to be well defined, the CHY integrand must transform covariantly, with opposite weight as dµ, under a SL(2, C) transformation (here αδ−βγ = 1): σ a → ασ a + β γσ a + δ : dµ n → n a=1 (γσ a + δ) −4 dµ n =⇒ I n → n a=1 (γσ a + δ) 4 I n ({σ a }) , (1. 3) and we will refer to this as the fact that I n has weight 4. For most theories that admit CHY representations, the CHY integrand factorizes into two parts I n = I The simplest function with this transformation property is probably the so-called Parke-Taylor (PT) factor. Given an ordering of n labels, α := (α(1), α(2), · · · , α(n)) we define PT(α) := 1 σ α(1),α(2) σ α(2),α(3) · · · σ α(n),α (1) . (1.4) It turns out that such Parke-Taylor factors play an important role in CHY formula for various theories (with ordering), and the simplest example is the so-called bi-adjoint φ 3 theory [4]. This is a theory with scalars in the adjoint of two flavor groups, e.g. U(N) × U(N'), with a cubic vertex ∼ f abc f a b c φ a,a φ b,b φ c,c . By doing trace-decomposition in both groups, the so-called double-partial amplitude, m(α|β) for orderings α and β, is given by the sum of scalar Feynman diagrams (cubic tree graphs with n external legs) that are compatible with both α and β: m(α|β) = (−1) flip(α|β) g∈T (α)∩T (β) I∈P (g) 1 s I , (1.5) where T (α) denotes the set of cubic tree graphs compatible with ordering α (similarly for T (β)), and for each graph g we have the product of n−3 propagators labelled by I (the collection of all poles/propagators of a Feynman diagram g is denoted as P (g)) 1 .Although this φ 3 theory is simple, it is remarkable that m(α|β) is given by the simplest CHY formula, with two PT factors: m(α|β) = dµ n PT(α) PT(β) , (1.6) which is a rather non-trivial mathematical identity first proposed and shown in [4]. In particular, if we choose α = β the CHY formula can be viewed as a map from a half integrand, PT(α), to the collection of Feynman diagrams that are compatible with ordering α, T (α) (all planar cubic tree graphs with external legs in the ordering α): PT → planar cubic tree graphs : dµ n PT(α) 2 = Cat n−2 g compatible with α I 1 s I , (1.7) where Cat n−2 denotes the Catalan number 1, 2, 5, 14, 42, 132, . . . for n = 3, 4, 5, 6, 7, 8, . . . [12]. In this paper, we will study a new class of half integrands, which largely generalize Parke-Taylor factors and maps to collections of Feynman diagrams. In addition, they naturally appear in superstring disk integrals and we will discuss their applications in that direction as well.

Cayley functions and the map to cubic Feynman graphs
The main character of our story is a new class of half-integrands that we call Cayley functions. Before proceeding, let us discuss a convenient way of fixing SL(2, C) in CHY formulas. Recall that we need to fix three punctures: we can always choose σ n → ∞, and fix any two more punctures at finite positions, e.g. σ 1 = 0, σ n−1 = 1 which won't be necessary to explicitly write down. With σ n → ∞, SL(2, C)-fixed CHY formula reads M n = dµ n I n , dµ n := where the four infinite factors containing σ n in dµ n cancel against those in I n thus we can remove all σ n -dependence in SL(2, C)-fixed dµ n and I n . For example, we define the SL(2, C)-fixed PT factor as (since there are (n−1)! α's we can always choose n in the end) PT(α(1), · · · , α(n−1), n) = 1 σ α(1),α(2) σ α(2),α(3) · · · σ α(n−2),α(n− 1) . (1.9) From now on, we will mostly be using this SL(2, C)-fixed form of CHY formulas and integrands, and only switch back to the covariant (boldface) form when necessary. Now we can define our new half integrands in this σ n → ∞ form. Given any labelled tree graph with with points 1, 2, . . . , n−1 (also called (n−1)-pt Cayley tree graph), we define Calyley function as the product of n−2 1 σ i −σ j , one for each edge (i, j) of the tree where equivalently we can say that no cycle is formed with these n−2 pairs {i, j}. For example, for n = 4 we can have the following three labelled trees , see figure 1 ,where e.g. Cayley function for the first one is  Since Cayley functions in this σ n → ∞ frame are in one-to-one correspondence with (n−1)-pt labelled trees, there are exactly (n−1) n−3 of them. A basic question we are interested in is how many different classes of Cayley functions there are; two Cayley functions are said to be topologically equivalent if and only if their tree graphs can be brought to the same shape, which are just relabelling of each other, for example the there are two classes of Cayley functions for n = 5. Generally for any n, there are always these two extreme classes, given by the so-called Hamiltonian graph (a line) and star graph (a star-shaped tree, and we can choose the center to be e.g. 1) respectively (see figure 3) (1.12) The former is nothing but the Parke-Taylor factor PT(α(1), α(2), · · · , α(n−1), n) in the SL(2, C)-fixed form, (1.9), while the latter is totally symmetric in labels 2, 3, . . . , n−1.  For n ≥ 6, we have new classes that are in between these two extremes, see examples in sec.2. The number of distinct classes is nothing but the number of unlabelled trees, which equals 1, 2, 3, 6, 11, 23, 47, · · · for n=4, 5, 6, 7, 8, 9, 10, · · · respectively (see A000055 [13] ) . We will see that these classes play an important role in our following discussions.
Although we have defined Cayley functions in σ n → ∞ frame, it is straightforward to recover the SL(2, C) redundancy which results in the unique covariant form for each C: where v a denotes the valency of vertex a = 1, 2, · · · , n−1 in the labelled tree, and by definition, 1 ≤ v a ≤ n−3. It is easy to check that in C every σ a appears exactly twice in the denominator, including σ n ; this is because n−1 a=1 (v a − 2) = 2(n − 2) − 2(n − 1) = −2, thus C n given above is indeed SL(2, C) covariant with weight 2. The covariant form of C H n = PT n is of course PT n in (1.4), and that for C S n is given by 1,n σ 1,2 · · · σ 1,n−1 σ 2,n · · · σ n−1,n . (1.14) The Cayley functions generalize Parke-Taylor factors in an interesting way; it is well known that via partial-fraction identities, they can be redued to PT's (see sec 3.1), but we find it intriguing and useful to study these functions directly, in the context of CHY formula and string integrals. As we will see shortly, Cayley functions have the property that, similar to the case of PT factors (1.7), via CHY formula it maps to a sum of certain cubic tree graphs with coefficient +1 only : As we will explain in sec 2, we say a Feynman diagram,g, is "compatible with" {i, j} if and only if the n − 3 poles of g correspond to n − 3 mutually compatible connected subgraphs of the labelled tree {i, j}. We summarize this result as a theorem to be shown in sec 2: dµ n C 2 n ({i, j}) = I 1 ,I 2 ,··· ,I n−3 are compatible connected subgraphs 1 s I 1 s I 2 · · · s I n−3 . (1.16) Our study of Cayley functions has been motivated by [14], where the "pushforward" of differential forms on M 0,n to Mandelstam space (i.e. space spanned by some independent Mandelstam variables) has been considered. As explained in [14], the pushforward of a halfintegrand, which is a differential form in Mandelstam space , contains all the information of CHY formula of its square; in some sense, the discussions here are like the combinatoric version of the geometric story in [14] (the idea of studying the combinatorics of "polytopes of Feynman diagrams" has been considered in [15] and also see [16][17][18][19] for some previous discussion about graph associahedra , generalized permutohedra and so on).

A map from Cayley functions to polytopes of Feynman diagrams
An important property of Cayley functions is that we can directly read off the pole structures and consequently the sum of Feynman diagrams of their CHY formulas. We will see that the result provides an interesting map from any labelled tree to a polytope whose vertices correspond to Feynman diagrams. Note that these polytopes are only combinatoric, while in [14] one can actually construct polytopes, e.g. the associahedron in Mandelstam space, whose canonical form (also see [20] for definition) turns out to be the pushforward of the canonical form of M 0,n (also an associahedron).

CHY formulas for Cayley functions squared
Here we explain Theorem 1 in two steps. First we show what poles are allowed on the RHS of Theorem 1, and then provide a way to obtain all Feynman diagrams recursively . Then we give a classification of Cayley functions and also present detailed examples, for the two extreme cases, C H n and C S n , as well as some other cases.

The pole structure
The first result we present is the construction for the set of allowed poles, for CHY formula of C 2 n , which we will denote as P (C n ). Given the labelled tree, any of its non-trivial connected subgraph corresponds to a pole on the RHS of (1.16): there is a connected subgraph in the labelled tree of C n whose vertices are {i 1 , i 2 , ..., i m } for m = 2, 3, · · · , n − 2 This rule for the poles is very intuitive, and it follows from the general analysis of pole structures of CHY formulas [2,[21][22][23][24] (for C 2 n we only have simple poles, see [25,26] for discussions on higher-order poles). A connected subgraph with vertices i 1 , i 2 , ..., i m means that there are exactly 2(m − 1) σ i,j with i, j ∈ i 1 , ..., i m in C 2 n , thus it will produce a pole s i 1 ,i 2 ,...,im according to the rule described in [21]. Note that we don't have n contained in any subgraph as any pole containing n can be expressed by its complement.
Here we spell out some examples. For two-particle pole, s i,j ∈ P (C n ) iff i j is a edge in the labelled tree. For three particle pole, s i,j,k ∈ P (C n ) iff one of the graphs in figure 4 exists in the labelled tree.  With the help of labelled tree, the relation of poles are also intuitive. Two poles i.e. two connected subgraphs , are compatible iff the particle set of one is a subset of that of the other, see figure 6a (1), or they have no intersection,see figure 6a (2). Two incompatible poles, see figure 6b can't both appear in a Feynman diagram.
We say a set of poles are compatible iff any two of them are compatible.  Feynman diagrams from poles Any n − 3 compatible poles from P (C n ) should correspond to a Feynman diagram on RHS of (1.16). In this subsubsection, we provide a clever way to obtain all Feynman diagrams from those of lowers points recursively, which is much more efficient than to find all n − 3 compatible pole sets by brute force in higher points. The starting point is that any cubic Feynman diagram has two parts whose external particles are I,Ī respectively which join a vertex with n, in the way shown in figure 7b According to (2.1), s I , sĪ corresponding to two connected subgraphs which together make up the whole labelled tree up to a link edge, see figure 7a. Reversely, each edge of the labelled tree can be a linking edge, which corresponds to different Feynman diagram sets. Using factorization, as shown in Appendix A , they together make up all Feynman diagrams on the RHS of Theorem 1 with coefficient +1, While the two parts in figure 7b themselves are also Feynman diagrams , whose corresponding labelled trees are C 1 , C 2 in figure 7a. That means we can obtain Feynman diagrams from those of lower points. Let's give the recursion explicitly Here we use the symbol as disjoint union. A direct consequence is the recursion about the number of Feynman diagrams , Let's spell out some examples. which are two multi-peripheral Feynman diagrams with the permutations of 1, 3. Another example for star graph is given in (2.9) . For star graph, all particles except the center one and n are end points, which are symmetric. Each of them corresponds to a line from center point to it. Any nontrivial subset of these lines must make up a connected subgraph which corresponds to a pole. So there are 2 n−2 − 2 poles in star graph. What's more, in star graph, any two connected subgraphs are compatible if and only if one is contained in the other. So start from two-particle pole, the next subgraph is compatible to the former if and only if it contains the former. So there are (n − 2)! sets of n − 3 compatible poles, any of which corresponds to a multi-peripheral Feynman diagram . The exact pole sets and Feynman diagram sets are given by Starting from n = 6, Cayley functions of new kind comes out, see (2.11). We can also extend it to general n, next-to-Hamiltonian graph seen in figure 8a and next-to-Star graph seen in figure 8b. With more patience, we can also list out their pole sets and Feynman  where we have used |T (C H n )| = Cat n−2 . So we obtain The counting of the number of poles is simple. Using the additional edge, we have (n − 3) × 2 1 − 1 more poles. Then Similarly, More complicated Cayley functions can be analyzed with the help of simpler ones. Different kinds of Cayley functions have different pole structures P (C n ) and Feynman diagram structures T (C n ). For n ≥ 6, there are too many poles or Feynman diagrams for any Cayley  Table 1: |T (C n )| and |P (C n )| for n ≤ 9 function to put them here. We just make a list showing the number of poles and Feynman diagrams below. The lists are always like   A more accurate way is to map a Cayley function to a polytope composed by its Feynman diagrams and poles, making the map in (1.15) more intuitive as now we discuss.

Polytopes from Cayley function
We have seen that CHY formula for C 2 n produces a set of Feynman diagrams, T (C n ), each with n-3 poles; two Feynman diagrams can share n − 4 poles, and such objects with n − 4 poles can start to share n − 5 poles, and so on, until we reach the set of all poles P (C n ). Combinatorically, they can be represented as a polytope in n − 3 dimensions. In this section, we describe the construction of such polytopes, and especially give a direct map from Cayely functions or labelled trees to these polytopes.
Polytope of Feynman diagrams : Each vertex of this polytope corresponds to a Feynman diagram which is a set of (n − 3) compatible poles. Each edge corresponds to a set of (n − 4) compatible poles. Two vertices are connected by an edge iff their Feynman diagrams share n − 4 poles, which correspond to the intersection of the two diagrams ( so there are always n − 3 edges stretching out from each vertex ). Similarly, a dimension-r face corresponds to a set of n − 3 − r compatible poles, which is the intersection of those of its boundaries, for r = 0, 1, · · · , n − 4. In the end, each facet (dimension-(n−4) face) corresponds to a pole.
So far, this map is realized by CHY formula of Cayley functions squared. However, we can abstractly view it as constructing a polytope from subgraph structure of a labelled tree: every dimension-r face of the polytope corresponds a collection of n−3−r compatible connected subgraphs of the tree. For PT, the vertices of the corresponding polytope are all planar Feynman diagrams. The dual graph of each planar tree diagram is the triangulation of a n-gon, see figure 10. Two vertices are connected by an edge iff their triangulations differ by a single flip. It is well known that a polytope with such vertices is the so-called associahedron [27] living in n − 3 dimensions, which we denote as K n−3 (in usual literature, it is called K n−1 ). Therefore, we have mapped PT to an associahedron, and let's give some explicit examples. .
For PT(1, 2, 3, 4, 5, 6), it's mapped to K 3 ,see figure 12. Any two adjacent vertices ,whose triangulations differs by a flip, share two common poles represented as edge. Any adjacent two edges share a common pole represented as a face. Those Feynman diagrams sharing a common pole sit on the same face. Note that a pentagon corresponds to a two-particle pole and a square corresponds to a three-particle pole. , on the right we show its two faces, one pentagon and one square As we have discussed, a star graph corresponds to (n − 2)! multi-peripheral Feynman diagrams, each characterized by a permutation of n − 2 particles. For star graph, the vertices of the corresponding polytope are (n − 2)! multi-peripheral Feynman diagrams, each characterized by a permutation of n − 2 particles. Two vertices are connected by an edge iff their permutations differ by a relabeling of two adjacent particles. It is known that a polytope with such vertices is the so-called permutohedron [28] living in n − 3 dimensions, which we denoted as P n−2 (in usual literature, it is called P n−1 ). Therefore. we have mapped a star graph to a star graph to a permutohedron, and let's give some explicit examples.
For C S 5 (1), see (2.9), it's mapped to P 2 ,see figure 13 . The leg 1 and 5 in each Feynman diagram are particular and all other legs take part in the permutations. Any two adjacent vertices, which differs by a relabeling of two adjacent particles, ,share a common pole represented by an edge.
As for the C S 6 (1), it's mapped to P 3 ,see figure 14, which corresponds to the permutations of 2, 3, 4, 5. Any two adjacent vertices, which differ by a relabeling of two adjoint (1), on the right we show its two faces, one square and one hexagon particles ,share two common poles represented by an edge. Any adjacent two edges share a common pole represented as a face. Note that a three-particle pole corresponds to a square while different from the case of associahedron K 3 , a two-particle pole corresponds to a hexagon.
Similarly, for arbitrary Cayley function, we can always draw its polytope by the map.
One more example about the polytope , see figure 15, from 1 , see eq(12). Any two adjacent vertices share two common poles represented by an edge. Any adjacent two edges share a common pole represented as a face. Note that A three-particle pole corresponds to a square , so there are 4 squares. While the case of two-particle pole are between associahedron K 3 and permutohedron P 3 : 4 two-particle poles correspond to pentagons and 3 correspond to hexagons .  In this section, we study the linear space spanned by all Cayley functions, which is of dimension (n−2)!. We first show that any Cayley function can be written as a linear combination of (n−2)! Parke-Taylor factors, known as the "Kleiss-Kuijf (KK) basis". More importantly, we find a new basis of the space which consists of elements we call C single and C kernel . The remarkable property of the new basis is that, given a PT, the CHY formula of any C single and PT gives a single Feynman diagram, while that of C kernel and PT gives zero.

Reduction to PT factors and KK basis
The main result here is a remarkable formula expressing C as sum of certain PT's: It is not surprising that by partial fraction, a Cayley function can be reduced to those of Hamilton graphs (see [29]), but here we see that the result takes such a simple form, with coefficient only +1! This identity can be easily proved by recursion. We remove any of the n−2 pairs denoted as {i r , j r } and make i r , j r identical, then the remaining n−3 pairs still compose a C. More intuitively, we shrink any line {i r , j r } in the labelled tree of C, and it is still a Cayley graph. If any of the C of n−1 points satisfy (3.1), that is to say any residue of C in LHS of (3.1) equals to that of RHS. Obviously, C function doesn't have pole at infinity, and (3.1) is correct for n = 4, so we finish the proof. Note that we can flip some pairs in C, which at most changes its overall sign, since C(· · · , {j, i}, · · · ) = −C(· · · , {i, j}, · · · ); while the summation on the RHS of (3.1) changes completely. For example we can see that on the first line of (3.4), by flipping two pairs, the RHS differs from that of the second line of (3.4). This is not surprising since the PT's are not linearly independent but satisfy relations known as "Kleiss-Kuijf(KK) relations". However, it is remarkable that we have a canonical way to land on a basis; we give each edge an orientation such that the whole flow are from 1 to end points, see figure 17, which makes sure that 1 is always the left-most particle in each contributing PT 1 Figure 17: Oriented from 1 factor in the summation on the RHS of (3.1). We denote the deformed Cayley function as C ({i 1 , j 1 }, · · · , {i n−2 , j n−2 }) with {i , j } equal to either {i, j} or {j, i} and count the number of flip pairs as r flip . Then these two Cayley functions differ by a overall sign (−1) r flip . Thus we expand any Cayley function into (n − 2)! PT factors with an overall sign, PT(1, ρ(2), · · · , ρ(n − 1), n) .
Here we first briefly show that the set of allowed poles on the RHS, which will be denoted as P (C n C n ) , are the intersection of P (C n ), P (C n ) . Divide P (C n ) into several subsets P m (C n ) with m = 2, 3, · · · , n − 2 according to the number of particles of a pole, then any pole s I ∈ P m (C) ∩ P m (C ) must have m − 1 lines in C and C using the rule in [21], so it has 2m − 2 lines in CC and s I ∈ P m (CC ). Reversely, any s I ∈ P m (CC ), it must have r lines in C and 2m − r lines in C . However, r ≤ m − 1 and 2m − r ≤ m − 1 or subcycle appears in C or C . So r = 2m − r = m − 1, i.e. s I ∈ P m (C) ∩ P m (C ).So thus we have proved the main part of Theorem 2 . Now we turn to the overall sign. Note that if we require the orientation of the linking edge is from C 1 to C 2 in (2.3), we provides a canonical way to stretch all legs of a Feynman diagram, which gives us a ordering denoted as ρ[1, 2, · · · , n−1]. So does that of C n denoted as ρ When one Cayley function in Theorem 2 is a PT factor, it picks out all Feynman diagrams of the other Cayley function compatible with ordering. For example the CHY formula of a Hamiton graph and a star graph is given by here we take the natural orientation of a Hamiton graph and a star graph, see figure 18. α −1 is the reverse list of α. α −1 β are the permutations with the ordering of particles The CHY integral of any two arbitrary star graphs also has a closed formula, see Appendix C.
As all the Feynman diagrams on the RHS of Theorem 2 share the same sign, it has a geometry description which is the intersection of the polytopes mapped from C n , C n , see an example in figure 19.

A new basis of Cayley functions
As shown in (3.3), KK basis provides a basis for the space of all Cayley functions. However, we are also interested in a new basis with elements that have a special property. Given a Parke-Taylor factor, we would like the CHY formula of PT and an element to give either a single Feynamn diagram or zero. In the study of Z integrals [30], the authors have proposed an algorithm for constructing an alternative basis of rational functions of n punctures, which we believe should be the same as our new basis. We have checked explicitly that up to n = 8 they coincide and we leave it to a future work to show this for all multiplicities. Below we first present the basis for all n, and then study its applications in both CHY and disk integrals. Without loss of generality, we choose PT(1, 2, · · · , n) and align the particles in the labelled tree in this ordering.
The new basis are obtained recursively using the map M defined as following: 1. M maps an ordered particle label set to a connected subgraph set.

As starting point, M
3. The map is defined recursively, via the function Λ, Here i 1 < i 2 < · · · < i k and we always pick out the left-most particle i 1 as the starting point to drawing lines and divide the remaining sequence into all possible disjoint sets I 1 , I 2 , · · · , I r with r = 1, · · · , k − 1. ⊗ means direct product and M (I 1 ) ⊗ M (I 2 ) ⊗ · · · ⊗ M (I r ) is a set of disajoint subgraphs with r parts. What Λ i 1 does for each non-connected subgraph is to draw a line from i 1 to the right-most particle label of each connected part respectively. So Λ i 1 actually acts on each elements of M (I 1 ), M (I 2 ), · · · , M (I r ) respectively as shown below, Λ i 1 (M (I 1 ) ⊗ · · · ⊗ M (I r )) = { i 1 m 1 m 2 m r |m 1 ∈ M (I 1 ), · · · , m r ∈ M (I r )} .

(3.17)
Note that m 1 , · · · , m r are connected subgraphs and they are linked to i 1 from their right-most point.
There is always a trivial line {1, n − 1} in each element of M ({1, 2, · · · , n − 1}) as 1 is always the minimum particle in its particle set and n − 1 is always the right-most particle point of its subgraph. Sometimes we draw a dashed line instead for later convenience. For example Here the right-most particle label of M ({2, 3}) is 3, so we draw a line from 1 to 3. There are Stirling number of the second kind of terms in the union in (3.16) . So, using recursion, one can easily prove that |M ({i 1 , · · · , i k })| = (k − 1)! , i.e., there are (k − 1)! connected subgraphs in M ({i 1 , · · · , i k }) . Thus there (n − 2)! Cayley functions in M ({1, 2, · · · , n − 1}) and we believe they compose a new set of basis denoted as C basis , which we have checked up to 10pts and are the same as those in [30] up to 8pts. Using the recursion above and the transition rule (3.3), a proof based on direct inspection should be straightforward.
For example, the basis of 3,4,5pt have been shown in (3.18), (3.19), (3.23). There are 24 basis in 6pt , 10 of which have crossing lines as shown in figure 20. As it turns out, there are Cat n−3 elements without crossing lines denoted as C single and (n − 2)! − Cat n−3 elements with crossing lines C kernel . Now we show, with PT(1, 2, · · · , n), how the CHY integral of any C single gives a single Feynman diagram and why the CHY integral of any C kernel gives zero.

Elements for a single graph
If we restrict the union in (3.16) with a additional rule that I 1 , · · · , I r must be consecutive sequences and denote this new map as M single , then there are no crossing lines coming out ,see (3.22), and M single ({1, 2, · · · , n − 1}) gives all C single . Equivalently, we can obtain all C single in one step: any n − 2 pairs {i a , j a } with i a < j a which are interval mutually corresponds to a C single . Obviously, there is always a line {1, n − 1} and there are Cat n−2 of C single . Ignoring this trivial line, we can read out the single Feynman diagram directly from the left n − 3 lines , dµ n PT(1, · · · , n)C single ({i 1 , j 1 }, · · · , {i n−3 , j n−3 }, {1, n−1}) = 1 s i 1 ,··· ,j 1 · · · s i n−3 ,··· ,j n−3 .
As known that the CHY integral of two PT(1, · · · , n) gives Cat n−2 of planar Feynman diagrams. Now we translate each planar cubic graph to a C single , which is consistent to the following identity, with the gauge fixing σ 1 → 0, σ n−1 → 1, σ n → ∞. Here we sum over all Cat n−2 C single . In [14], we will see that this identity can be interpreted as a triangulation of the associahedron into Cat n−2 simplices. Eq. (3.24) is a very clean identity, using which, reversely, we can translate any cubic Feynman diagram to CHY integral directly. For example, given a cubic Feynman diagram, Last but not least, we briefly comment on a corollary of (3.24), namely it can be used to give a large class of CHY formulas for φ p graphs . The idea is that one can blow up any φ p graph to a cubic graph, which can be translated into a formula via (3.24), and the result is given by further multiplying with those additional inverse propagators. There are many ways of blowing up the φ p graph, and any way of doing it gives such a formula. For example, we can write 2 . To illustrate the method, we consider a 10-pt φ 4 Feynman diagram, In this way, we find a large class of simple CHY integrands for any φ p graph (and [31] corresponds to a symmetrized version ; see also [6,32] for other methods ).

Elements in the kernel
Now we move to the second kind, C kernel and prove they produce zero in its CHY formula with a PT factor briefly. For any C kernel , we pick out two lines {i, k} and {j, l} which are crossing each other, as shown in figure 21.
i j k l Because of the construction way of M , there are no connected line from j to i without passing l or connected line from k to l without passing i. An immediate observation is that any s A∪{k} or s A∪{j} with k, j / ∈ A is a non-planar pole and can't appear in the CHY integral. The only possible way for j, k appearing in a pole is s I∪{j,k} with i, l ∈ I. Before using the lines {i, k} and {j, l}, the other n − 4 lines can only provide n − 5 compatible poles at most, denoted as {· · · , s I 1 , s I 2 , · · · , s Ir } with I 1 ⊂ I 2 · · · ⊂ I r . Now we consider to use the two lines {i, k} and {j, l}. However, there is at most one more compatible pole coming out denoted as s It∪{j,k} and the n − 4 compatible pole set becomes {· · · , s I 1 , · · · , s It , s It∪{j,k} , s I t+1 ∪{j,k} , · · · , s Ir∪{j,k} }. So there are no Feynman diagrams coming out.

More about the new basis
Owing to the clear property of C single and C kernel , we can't wait to expand any Cayley functions or even general CHY half integrand (without subcycle about σ) to these basis. More application will be seen in next section.
Above we have shown a constructive way to get C basis . How to identify whether an arbitrary Cayley function is a C basis ? Motivated by the rule that a line is always drawn from a left-most point to a right-most point of a subgraph, such construction shown in figure  22 can't appear in C basis . Reversely, as long as they don't have these two constructions, i j l Containing 1 σ i,j σ j,l with i < j < l i j k l Containing 1 σ i,k σ j,k σ j,l with i < j < k < l Figure 22 which actually excludes many Cayley functions, see an example for more complicated cases in figure 23, and makes sure that the left-most particle of any connected subgraph , like here i, has to be linked to the right-most particle, like here l, there is always a way to i k 1 k 2 j l Figure 23: an example for more complicated cases construct them by the map M and so they belong to the basis. Though the CHY integral of canonical PT factor and C kernel is zero, it will contribute in string integral, as we discuss now.

Cayley functions and disk integrals
In this section, we study the natural appearance of Cayley functions in certain disk integrals of open superstring theory. The basic objects we are interested in are a class of disk integrals with Cayley functions as (half) integrands, which we collectively call Z integrals [24,30,33,34] Z(12 · · · , n|{i, j}) := (α ) n−3 where we have chosen to fix the PSL(2, R) redundancy by setting e.g. (z 1 , z n−1 , z n ) = (0, 1, ∞) and the domain for integrals over d n−3 z, denoted as (12 · · · n), means 0 < z 2 < · · · < z n−2 < 1. In addition to the Koba-Nielsen factor, we insert the SL(2)-fixed C({i, j}) in the integrand, which can be rewritten in a SL(2) covariant form as before. In the special case that C =PT(β), it reduces to the more familiar Z integrals which depend on another ordering β: These Z integrals have played important roles not only for gluon amplitudes in open superstring theory, but also for higher-order corrections to NLSM and other theories [33,34]. To see this, let's recall the main results of [35]: it has been shown that any n-pt tree amplitude in type I superstring theory is a linear combination of (n−3)! partial amplitudes in super-Yang-Mills theory (SYM), with ordering (1, π(2), · · · , π(n−2), n−1, n) with π(1) = 1 (π(n−1) = n−1 though that is not used here). The RHS is nothing but a sum of (n−3)! Z integrals, dressed by products of n−3 poles: s ia,ja Z(12 · · · , n|{1, n−1}, {i 2 , π(2)}, · · · , {i n−2 , π(n−2)}) , (4.5) where after fixing i 1 = 1, j 1 = n−1, we have Cayley functions with j a = π(a) and each i a precedes j a in the ordering π, for a = 2, · · · , n−2 (there are (n−3)! of them). Thus we have seen that the complete α -dependence of tree amplitudes in type I theory is encoded in these Z integrals, (4.1). The α expansion of generic Z integrals can be computed, but it suffices to do so for those where the C functions form a basis. A convenient choice is to focus on a (n−2)! basis given by Z(12 · · · |β) where PT(β)'s form a KK basis [24], and it is well known that such Z integrals give double-partial amplitudes in the α → 0 limit: where the first correction starts at O(α 2 ) since O(α ) term vanishes identically , which follows from supersymmetry of open string amplitudes. In the following, we will focus on Z integrals with Cayley functions in the (n−2)! new basis, and as we will see shortly, they play a special role in the α expansion of disk integrals. In fact, such Z integrals have been studied in [24,30] , where these integrals are called pole-channel basis. Our discussion here will focus on a graphic way of reading off nice properties of this Z-integral basis from the structures of Cayley functions. Note that the new basis consists of Cat n−2 C single 's and (n−2)!−Cat n−2 C kernel 's, thus at O(1) in the α expansion, we have either a single cubic tree graph or zero: . A natural question is, can we say something about higher order corrections, especially in the case of C kernel ? We propose that one can obtain pole structures of the leading non-vanishing α order directly from corresponding Cayley tree graphs.
Proposal: For any C({i, j}) in the new basis, the pole structure for the first nonvanishing order in the α -expansion of Z(12 · · · n|{i, j}) is determined by its maximal subgraph without crossing, M . Let's assume that M has m edges which, without loss of generality, are denoted as {i 1 , j 1 }, · · · , {i m , j m } (out of all the n−3 edges {i 1 , j 1 }, · · · , {i n−3 , j n−3 }), then the Z integral has the leading non-vanishing order at O(α n−3−m ): where c m is a multiple zeta value of transcendental weight n−3−m. For C single ,(4.9) reduces to the O(1) cubic tree of (4.8), since by definition it has all m = n−3 non-crossing edges. The other extreme is the case that there is no non-crossing subgraph, m = 0, and we predict that the first non-vanishing order is at O((α ) n−3 ), which is given by a multiple zeta value with weight n−3.
Note that (4.9) is also consistent with the absence of O(α ): for C kernel we have m < n−3 but we can at most have m = n−5 which corresponds to only two edges crossed. Thus in the general case 0 < m ≤ n−5, we have at leading order O((α ) n−3−m ), product of m compatible propagators (a subset of a cubic tree). We believe that the proposal can be proved using the Berends-Giele recursion for Z integrals given in [30] (which in turn was based on methods of α expansion in [24,36]).

Discussions and Outlook
In this note, we have introduced Cayley functions as a new class of half integrands in CHY formulas; they naturally generalize the Parke-Taylor factor (PT), which arises from a line or Hamiltonian tree, to general cases of labelled trees. We have discussed important aspects and applications of Cayley functions. First of all, we have presented a diagrammatic way to directly read off the sum of cubic Feynman diagrams, as given by the CHY formula with C 2 . Combinatorically, a collection of such cubic trees correspond to a polytope, thus providing a one-to-one map between Cayley functions and certain polytopes; we classified such polytopes as ranging from the associahedron (Hamiltonian tree graph) to permutohedron (star tree graph).The CHY formula with CC produces Feynman diagrams that correspond to the intersection of the two polytopes. Furthermore, we have studied the linear space of all half integrands without forming subcycles. The dimension of the space is (n−2)! since any such half integrands can be reduced to the KK basis of PT factors, and we have found a nice formula for the reduction. We have introduced a new basis where each element has the property that under CHY formula with a given PT, it gives either a single diagram or zero. Finally, we have briefly discussed how these Cayley functions and especially the new basis can be used in disk integrals of superstring theory. In the following, we will briefly mention more aspects of Cayley functions that have not been covered above, especially open questions along several directions.
Beyond Cayley functions: from G(2, n) to M 0,n One of the most important properties of a Cayley function is that it maps to a sum of cubic Feynman diagrams (with coefficients +1). Of course they are just special cases of half-integrands that have this property, and we suspect that they are the simplest ones. As a first step towards going beyond Cayley functions, we find a larger class of such half-integrands, which are in one-to-one correspondence with MHV non-planar on-shell diagrams in N = 4 SYM [37], and C's are just special cases of these functions.
Any MHV on-shell-diagram gives a rational function, B(λ 1 , · · · , λ n ) defined on G(2, n) with weight -2: Such a function is related to our functions on M 0,n via (λ α=1 The simplest case is again a Parke-Taylor factor (the demominator of original "Parke-Taylor" formula) which is the same as our PT up to an overall prefactor: In this way, any function with weight -2 on G(2, n) can be converted to that on M 0,n . As shown in [37], a generic MHV on-shell-diagram is characterized by n−2 triplets of labels (i a , j a , k a ) for 1 ≤ a ≤ n−2 (we assume that all labels 1, 2, · · · , n are covered), and its rational function is always a positive sum of (5.1) with different orderings B({i, j, k}) = π∈Sn/Zn i<j<k in π 1 π(1), π(2) · · · π(n), π (1) .
Here i < j < k is a cyclic ordering in π. Generally, a B function takes a form more complicated than C's [37], but it is straightforward to see when it can reduce to a C (with the prefactor as in(5.1)): if all the n−2 triplets share a label, e.g. k 1 = · · · = k n−2 = n for all a, B reduces to C with the same {i, j}: and we see that (5.2) reduces to (3.1) if we fix n to be at the end of all orderings. One can show that B functions also have the property that C's have: any CHY formula with B 2 gives a sum of Feynman diagrams, which can be encoded in a polytope as that for a Cayley function. We will leave the generalization of theorem 1 and full classifications of these more general polytopes to a future work.

Open questions for Cayley functions
There are other open questions regarding Cayley functions in CHY formulas. The most obvious question is to understand better the origin of the map from Cayley functions to polytopes, and what is the significance of these polytopes in mathematics, see [16][17][18][19] for some previous work. One possible direction is to consider the class of graph associahedra based on Dynkin diagrams, which are known to tile the compactied moduli space of punctured Riemann spheres [38]. It would be fascinating to explore whether this class of graphs has special properties in the context of CHY formulae or disk integrals. Besides, it would be highly desirable to generalize our study of Cayley functions and polytopes of Feynman diagrams to loop level, along the line of φ 3 loop amplitudes from CHY-like constructions [39][40][41][42][43].
We would also like to understand better the meaning of the new basis. For example, it is well known that one can expand those half integrands appearing in CHY formulas of other theories (such as the reduced Pfaffian etc.) in the KK basis; a natural question is when we expand them in our new basis, what is the interpretation of the coefficients? Moreover, we know that in twistor-string formula for N = 4 SYM [44,45], Parke-Taylor factors are mapped to color-ordered amplitudes. Similarly a Cayley function is mapped to a certain sum of such color-ordered amplitudes, which in turn form a basis different than the usual KK basis. It may be interesting to study their properties as well.
Another direction concerns higher-order α corrections in Z integrals and other integrals in superstring theory. We have only studied leading non-zero order in the α -expansion of Z integrals, and it would be intriguing to extract sub-leading pole structures from the graph. For Z integrals with PT's, such sub-leading terms can be obtained systematically using the method in [24], which can be turned into results for Z integrals in the new basis. What is remained to be done is a more direct (and preferably diagrammatic) way of extracting higher-order terms from Cayley functions. Moreover, it is possible that the combinatorical polytope structures generalize to disk integrals (see [46] for related work which studies certain combinatoric structures in closed-string integrals).
appear on the RHS of Theorem 1. So we assign each of them of a undetermined coefficient and use to determine them. First we see a simple case, According to the analyzing in (2.1) , 1 3 n corresponding to the two terms on the RHS of (A.1), i.e. x 1 = 0, x 2 = 0. The next thing is to determine their relative sign appearing in Theorem 1. While they must be the same as we can't allow the value of one expression after being taken the residue of its pole is 1 while the other is −1, so x 1 = x 2 = 1. Now we move the 5pt cases, According to pole analyzing, it must contains the Feynman diagrams in the first and the last term on the RHS of above equation, i.e. x 1 = 0, x 3 = 0. While if we take the factorization s 3,4 → 0, only the first two terms survives, where I is the internal particle. In factorization limits, it just reduces to the case of 4pt, (A.1), which means x 1 = x 2 . Similarly, x 2 = x 3 = x 1 = 1. The Feynman diagrams in each term of the RHS of (A.2) share the same sign , so all 5 Feynman diagrams of 1 2 3 4 share the same sign in Theorem 1.
Generally, for a arbitrary Cayley function, according to the pole analyzing, some terms on the RHS of (1.16) must appear in Theorem 1 with nonzero coefficient. After we take all kinds of factorization, other terms on the RHS of (1.16) appear to join them with the same sign using the results of lower points recursively. So any n−3 compatible poles corresponds to a Feynman diagram in Theorem 1 with coefficient +1.

B Proof of the sign in Theorem 2
As for the subtle all overall sign in Theorem 2, in principle, we can expand C n , C n into PT's using the identity (3.1), then their CHY formulas becomes a summation of double partial amplitudes , see (1.5) dµ n C n C n = α,β m(α|β) . (B.1) However there is huge cancellation between these double partial amplitudes and a clever way is to find a dominant one to determine the sign in Theorem 2. Our idea is to use the factorization , see figure 26, recursively until we find the dominating PT from the expansion of C n , C n repectively. As we will find all Feynman diagrams on the RHS of Theorem 2 share the same sign, i.e. we can pick out any one denoted as the represetative Feynman diagram, i.e. any n − 3 compatible poles both belonging to P (C n ) and P (C n ) to represent all cases. There are always two "biggest" poles s I , sĪ between these n − 3 compatible poles (here we means all particles of other poles without using the particle n sit on these two "biggest" poles ) whose corresponding subgraphs together make up the labelled tree of C n (so does C n ) up to an oriented edge , see figure 26 . Thus the represetative Feynman diagram corresponds to a particular factorization s I → 0, sĪ → 0 under which only certain Feynman diagrams survive. Among the PT's from the expansion of C n , only those which can be divided into two subgraphs with the particles I andĪ respectively could contribute under this factorization. This decides the contributing PT's are either PT(I,Ī, n) or PT(Ī, I, n), which is further decided by the orientation of the linked edge . This was the time we saw the importance of the orientation of C n in the CHY integral of two distinguished Cayley functions. The subgraphs C 1 , C 2 themselves are labelled trees, so we can do this factorization recursively and the range of surviving PT's becomes more and more narrow until a single one comes out. One can see the procedure to find the dominating PT is just to draw the representative Feynman diagram in the canonical way described in main tex . While we can also define a map ρ based on a representative Feynman diagram and a oriented labelled tree of C n (or C n ) to find the ordering of the dominating PT more abstractly, 1. ρ maps an unordered sequence to an ordered sequence. where I is a particle set of a labelled tree and I 1 I 2 = I are particle sets of subgraphs linked by an edge with the orientation from i 1 to i 2 which correspond to the two biggest poles of those from of the n − 3 compatible poles made up by the particles I.

C CHY formula of two arbitrary star graphs
In main text, we mainly consider such Cayley functions with n sent to infinity and they are characterised by n − 2 pairs. They may not be characterised by n − 2 pairs again if we send another puncture of their covariant form to infinity. For general Cayley functions which have an arbitrary puncture that is special to sent to infinity, the CHY integral of themselves squared is well defined as it is just a relabelling. While those of two different Cayley functions may meet an illness as SL(2, C) redundancy only allow to send one puncture to infinity and might not satisfy both requirement of two different Cayley functions. This time, it seems we couldn't use the technical described in Theorem 2 to do their CHY integral while it is not. Many properties are inherited, such as P (CC ) = P (C) ∩ P (C ) and the Feynman diagrams obtained by the CHY integral of two distinct Cayley functions is still the intersection of those obtained by the CHY integral of of Cayley function squared, except that these Feynman diagrams may not share an overall sign again and we have to determine them one by one. For example, to do the CHY integral of two star graphs with different punctures which is expected to be sent to infinity , we have to use their SL(2, C) covariant (1.14), denoted as C S n (i; n), C S n (j; n ) respectively C S n (i; n) = σ n−3 i,n σ i,1 · · · σ i,i−1 σ i,i+1 · · · σ i,n−1 σ 1,n · · · σ n−1,n , C S n (j; n ) = σ n−2 j,n σ j,1 · · · σ j,j−1 σ j,j+1 · · · σ j,n σ 1,n · · · σ n −1,n · · · σ n +1,n σ n,n . (C.1)