- #1
- 3,766
- 297
I have a few questions on these graphs. For example if there is a way to tell directly from a complicated graph if it is "physical" in the sense that it describes an actual process. I have also questions on the building of graphs using BCFW bridges, on determining the value of the parameter "k" directly from the permutation associated to a graph, etc.
I won't type all my questions yet, I will wait to see if someone is familiar with these questions first.
But one question is this: I think that the value of "k" (=number of negative helicities) can be obtained directly from the permutation by counting how many of the values are mapped by the permutation to a value above n. Is that correct? I have not seen this stated explicitly like this or proved anywhere.
Thanks!
I won't type all my questions yet, I will wait to see if someone is familiar with these questions first.
But one question is this: I think that the value of "k" (=number of negative helicities) can be obtained directly from the permutation by counting how many of the values are mapped by the permutation to a value above n. Is that correct? I have not seen this stated explicitly like this or proved anywhere.
Thanks!