arXiv · hep-th/9301107
An Algorithm for Computing Four-Ramond Vertices at Arbitrary Level
Abstract
We perform the sewing of two (dual) Ramond reggeon vertices and derive an algorithm by means of which the so obtained four-Ramond reggeon vertex may be explicitly computed at arbitrary oscillator (mass) level. A closed form of the four-vertex is then deduced on the basis of a comparison to all terms obtained by sewing that contain only level zero and one oscillators. Results are presented for both complex fermions and for the previously studied case of real fermions.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Niclas Engberg, Bengt E. W Nilsson, Per Sundell. 1993-01-26. An Algorithm for Computing Four-Ramond Vertices at Arbitrary Level. https://doi.org/10.1016/0550-3213(93)90478-8
Cite the original work for its findings. Save a collection to share your selection of sources.