1-loop Color structures and sunny diagrams

Recently the space of tree level color structures for gluon scattering was determined in arXiv:1403.6837 together with its transformation properties under permutations. Here we generalize the discussion to loops, demonstrating a reduction of an arbitrary color diagram to its vacuum skeleton plus rays. For 1-loop there are no residual relations and we determine the space of color structures both diagrammatically and algebraically in terms of certain sunny diagrams. We present the generating function for the characteristic polynomials and a list of irreducible representations for $3 \le n \le 9$ external legs. Finally we present a new proof for the 1-loop shuffle relations based on the cyclic shuffle and split operations.

. An example of the pruning through repeated trimming of external legs, or leaves, to arrive at the vacuum skeleton sub-diagram. expressed in terms of single trace sub-amplitudes, through certain relations which generalize the Kleiss-Kuijf relations [17] from tree level to 1-loop, see [18] for a review. We shall refer to all such relations as shuffle relations, independent of the number of loops (the shuffle is also known as an ordered permutation). [19] generalized these relations to all loop orders, and [20] obtained explicit results for n ≤ 6. A more comprehensive background on scattering amplitudes can be found in [7] and the above-mentioned reviews.
In section 2 we determine the space LCS n , in section 3 we present a new proof for the 1-loop shuffle relations, and we summarize our results and conclude in section 4.

Sunny diagrams
Reduction to hairy vacuum skeletons. The space of color structures can be identified with the space of color diagrams up to Jacobi relations [4], where we use the same definitions and conventions as in [7]. These diagrams apply to any theory where all the fields are in the adjoint representation of the gauge group including pure Yang-Mills (YM), pure supersymmetric YM (SYM) and N = 4 SYM.
To each color diagram we can associate a sub-diagram with no external legs, namely its vacuum skeleton. This can be done by an iterative pruning process where at each step all external legs, or leaves, are trimmed until none are left, at which point the pruning is complete. An example of this process is illustrated in fig. 1. This pruning does not change the topology of the diagram, and the skeleton is non-empty if and only if the diagram has loops.
Diagrammatically the Jacobi relations can be represented by the following move We proceed to reduce a general color diagram through a process of "Jacobi planting" as follows. Once the vacuum skeleton is found one identifies edges which end on it, but are not part of it, namely edges which are directly attached to the vacuum skeleton, and one operates on them with the Jacobi moves. Repeating this process the diagram can be converted to a linear combination of diagrams where all trivalent vertices are within the vacuum skeleton. We shall refer to such diagrams as ray diagrams and they have the property that the pruning process described above would end after a single step. See fig.  2 for an example illustrating the outcome of this process. In summary, Jacobi planting is a process that converts any color diagram to a linear combination of ray diagrams all with the same vacuum skeleton as the original diagram. Hence L CS n can be realized diagrammatically by the space of -loop ray diagrams up to residual Jacobi identities -ones which preserve the ray nature of the diagram.
Sunny diagrams. For 1-loop diagrams the vacuum skeleton is unique -it is the circle, and we call the ray diagrams over it "sunny diagrams", for example the RHS of fig. 2 depicts sunny diagrams with n = 5. For n > 3 any Jacobi move would spoil the ray nature and hence there are no residual Jacobi relations and we find that LCS n = {space of sunny diagrams} . (2. 2) The cases n = 2, 3 are special. For n = 2 we have where C 2 is the second Casimir of the adjoint representation, and the proportionality constant depends on the normalization chosen for the structure constants which we take as in [21], where (2.3) is equivalent to their eq. (15.93) which reads f acd f bcd = C 2 δ ab . For n = 3 application of the Jacobi relation to any one of the edges, together with (2.3) gives We note that (2.3,2.4) hold for any group, not necessarily SU (N c ).
Algebraic determination of LCS n . Each sunny diagram encodes an f -expression. Clearly the expression is unchanged by a cyclic permutation of the external legs. In addition a reflection of the whole diagrams inverts all orientations and changes the sign by (−) n . The rotations and reflections together consist of the dihedral group, and the above described sign defines a representation of the dihedral group which we shall call the sign representation. By definition the symmetries imply that LCS n can be described algebraically by an induced representation LCS n = Ind Sn Dn sgn , where D n denotes the dihedral group, and sgn is its above-mentioned sign representation.
We note that single traces have precisely the same symmetries as the sunny diagrams. As T CS n can be identified with a subspace of the single traces we see that This is consistent with the expectation that sub-amplitudes generated at tree level could receive loop corrections.
The characteristic polynomial. Using the algebraic identification of LCS n as an S n representation (2.5) we can proceed to find its character, or more conveniently its characteristic polynomial. The derivation is described in appendix A and the end result is that generating function of characteristic polynomials is given by where ϕ(n) is Euler's totient function whose value is the number of k's within the range 1 ≤ k ≤ n which are relatively prime to n, see for example [22], and p k = i x k i are symmetric power sums in some x variables as in [7] subsection 3.2. From the generating function one can read the characteristic polynomials for each n. For n odd n = 2m + 1 while for n even n = 2m we have (2.10) Given the characteristic polynomial we can decompose the representation into its irreducible components (irreps). First the associated character is computed through (2.11) Table 1. Multiplicities of the irreducible representation of S n for tree level color structures T CS n [7], repeated here for reference, and δLCS n := LCS n − T CS n where LCS n are 1-loop color structures. The notation λ = a i b j ... describes a Young diagram with a boxes in each of the first i rows and b boxes in each of the next j rows, etc. or equivalently a partition of n, i · a + j · b + · · · = n. where λ = (1 λ 1 2 λ 2 . . . ) is any cycle structure type in S n , namely a partition which labels any S n conjugacy class. Next the representation is decomposed using the character tables and computerized calculation [23]. The results for 3 ≤ n ≤ 9 are presented in table 1, where due to (2.7) it suffices to list the representation added δLCS n := LCS n − T CS n (2.12) rather than all of LCS n . These results were tested by confirming that the dimensions add up to (2.6), by confirming that the components of T CS n are included as implied by (2.7), and by comparison with existing results for 4 ≤ n ≤ 6 [20]. A comment on self duality under Young conjugation. By Young conjugation we mean the interchange of rows and columns in the Young diagrams, or equivalently tensoring the representation with the sign representation of S n . We observe that for n = 5, 9 not only is T CS n self-dual [7] but so is δLCS n (and hence also LCS n ).
3 Shuffle relations [16] discovered and proved that for SU (N c ) theories at 1-loop the double trace sub-amplitudes can be expressed in terms of the single trace sub-amplitudes. This is consistent with our realization that the space LCS n is equivalent to the space of single traces (2.5,2.7). In this section we present a new proof for this relation based on the cyclic shuffle (also known as cyclic ordered permutation or COP) and split operations, to be defined below, in analogy with the use of the ordinary shuffle and split operations to prove the tree level Kleiss-Kuijf relations in [7], subsection 2.3.
As in [7] we proceed by relating the f and trace decompositions. The total amplitude at any loop level given schematically in 1.1 is a linear combination of the sub-amplitudes A J with color structure coefficients c J . There are two known ways to expand the total amplitude in terms of the color structure coefficients: one is using the f -basis where each color coefficient c f is constructed out of the group structure constants f abc , and the other is using the trace basis where the color coefficients c t are constructed from traces of T a T b ... where the T 's are the generators of the gauge group at a given representation. For each of the sets of color coefficients there is a corresponding set of sub-amplitudes which we denote A f and A t respectively. We will see that relations between the two forms of color coefficients give us relations between the sub-amplitudes.
Once we know the form of the color coefficient in the f -basis we can transform to the trace basis using the relation for each f abc in c f . It is useful to represent this relation graphically by .

(3.2)
Then we perform the summation over internal lines using the SU (N c ) identity When all of our fields are in the adjoint representation the 1 Nc term can be omitted such that the relation can be represented graphically as . (3.4) For one loop amplitudes we have seen that the basis of c f color coefficients are the sunny diagrams (2.2), namely (3.5) We will use (3.2) and (3.4) to transform each c f of this form into a sum of trace color coefficients c t . To recognize the permutations which appear in the sum we will need some mathematical concepts which we now turn to define. A cyclic word is a word defined modulo shifts, and we shall mostly write it within parenthesis. Hence for example (abc) ≡ (bca). The cyclic split, δ c , of a cyclic word σ is a sum over all pairs of cyclic words (α, β) such that each letter of σ is either in α or in β and each preserves the original cyclic ordering of the letters in σ. For example: δ c ((abcd)) = ((abcd), ∅) + ((a), (bcd)) + ((b), (acd)) + ((c), (abd)) + ((d), (abc)) + (3.6) + (∅, (abcd)) + ((bcd), (a)) + ((acd), (b)) + ((abd), (c)) + ((abc), (d)) + + ((ab), (cd)) + ((ac), (bd)) + ((ad), (bc)) + ((cd), (ab)) + ((bd), (ac)) + ((bc), (ad)) Just like the ordinary split δ, the number of terms in δ c (σ) is 2 |σ| , where |σ| is the length of σ namely the number of its letters. We continue to call this operator "split" as in [7] since it splits a word into pairs. In the mathematics literature it is also known as the co-shuffle or the unshuffle. The subscript c reminds us that this is the cyclic split operator and it can be omitted if clear from context.
The cyclic shuffle, ¡ c , 2 of two cyclic words α and β is defined as the sum of all cyclic words σ which can be written by putting the word α through the word β while keeping the cyclic ordering within them. For example (abc) ¡ c (de) = (abcde) + (abced) + (abdce) + (abecd) + (abdec) + (abedc)
After these preparations we turn to the proof which is rather short. Using the relations (3.2) and (3.4) we find that color structure c f of a sunny diagram is given by the following sum of 2 n terms . . . . .
where we have split the cyclic word σ into two cyclic words: α on the outside of the circle and β on the inside (each letter in β contributes a minus sign according to (3.2) ).

Now we have
In the third equality we used (3.7) according to which that two cyclic words α and β appear in the split of a cyclic word σ if and only if σ appears in the corresponding shuffle. We recognize that by definition the term which appears in the square brackets is the sub-amplitude in the trace basis with the double trace color coefficient Tr(α) Tr(β T ). Hence we identify In the case β = ∅ we find which we substitute back into (3.12) to obtain (3.14) These are the sought after shuffle relations of [16] thereby completing the proof.
Comparison with existing proofs. The proof in [16] is given in two approaches -one is motivated by open strings and the other is intrinsically field theoretic. In each approach certain classes of excluded terms are identified, as shown in fig. 8 and 9 there, and their total contribution is shown to cancel. In addition a certain U (P ) × U (N c − P ) decoupling is discussed. In the current proof these notions are mostly absent and unnecessary. The method of [24] is based on two categories of operations: double-ring structures in one-loop color-flow diagrams and U(1)-gluons. Again these notion appear to be absent in the current proof. In addition while the cyclic shuffle plays a central role in both approaches, but we could not recognize there the split operation.

Summary
This paper generalizes [7] to loops and applies to any theory where all the fields are in the adjoint representation. For a general number of loops we were able to reduce the space of color structures to the space of "vacuum skeletons" with rays together with some residual relations inherited from the Jacobi relations, see fig. 2.
In the 1-loop case we fully determined LCS n , the space of loop color structures. As there are no residual relations LCS n is given by "sunny diagrams", such as the RHS of fig.  2. Such diagrams are labelled by cyclic orderings of the n external legs, up to reversal, and hence dim(LCS n ) = (n − 1)!/2. Algebraically this is equivalent an S n representation induced by the dihedral group (2.5), meaning that it is in the same representation as single traces. Since T CS n can be identified with a subspace of the single traces we see that T CS n ⊂ LCS n (2.7) as we might expect in order that all the sub-amplitudes which appear at tree level may receive 1-loop corrections. The generating function of the characteristic polynomial is given by (2.8), and the individual polynomials are given by (2.9,2.10). For 3 ≤ n ≤ 9 the representations were decomposed into irreducible components through the use of the character table and the results are listed in table 1.
At 1-loop the the Kleiss-Kuijf relations generalize to the relations found in [16]. We collectively refer to these as "shuffle relations". In section 3 we used the notions of cyclic shuffle and split to present an elegant proof of the 1-loop shuffle relations based on [6,7].
Our main results are the generating function (2.8) and the list of irrep decomposition in table 1. We tested them successfully as described below (2.11) and we believe that they are novel. These are rather basic quantities associated with scattering amplitudes, and therefore are of intrinsic interest. In addition they are interesting through their relation to the literature as reflected by the list of references.
Higher loop color structures are left for future work. Also, seeking physical implications for the irrep decomposition remains an open question. type (2 m ) and those with 2 fixed points and hence of type (1 2 2 m−1 ). For all of them sgn 2m (σ) = +1 and ch becomes (2.10). The odd and even expressions add elegantly to the generating function (2.8).