Cluster Alphabets from Generalized Worldsheets: A Geometric Approach to Finite Types
Abstract
We provide a systematic derivation of cluster alphabets of finite types. The construction is based on a geometric realization of the generalized worldsheets by gluing and folding a pair of polygons. The cross ratios of the worldsheet variables are evolved using the -system equations. By a new gauge choice, we obtain a simpler set of cluster alphabets than the known ones.
[a] organization=Joint School of the National University of Singapore and Tianjin University, International Campus of Tianjin University, city=Fuzhou, postcode=350207, country=China \affiliation[b] organization= Laboratoire d’Annecy-le-Vieux de Physique Theorique (LAPTh), CNRS and Universite Savoie Mont-Blanc, city=Annecy, postcode=74940, country=France
1 Introduction and Summary
The search for a geometric description and a simple set of variables has guided the study of scattering amplitudes in quantum field theory and string theory. Historically, the Veneziano amplitude consistent with the Regge poles and crossing symmetry was written down first, then extended to -point amplitudes, and the notion of a worldsheet swept out by the motion of strings emerged only later.
The generalization of the Veneziano amplitude to mesons is expressed as [1, 2, 3]
(1) |
Here the integral is over the compatible resonances, is the Regge slope, and are functions of the Mandelstam variables . It was soon realized that the variables may be written as cross ratios of the Koba-Nielsen variables [4].
(2) |
This leads to the expression of the integration measure in the Parke-Taylor form and the Koba-Nielsen factor familiar in modern textbooks, with the residual gauge symmetry used to fix the positions of three points, e.g., . It is now recognized that this integral describes the tree-level amplitude of open strings, whose worldsheet is a disc with marked points at the boundary. The string amplitude enjoys properties such as crossing symmetry, factorization, and Regge behavior.
More recently, the factorization property of the string integral was put on the center stage to define a class of generalized string integrals associated with Dynkin diagrams [5]. The so-called cluster string integrals factorize at the poles that correspond to the boundaries of the configuration space of variables [6, 7]. For example, the integral (1) factorizes into an integral and an integral at its poles. The factorization property is reflected in the geometry of the generalized associahedra [8] and the integrals are interpreted as volume forms. However, like the multimeson amplitudes, the integrals are written in terms of the variables as a generalization of (1). It was not clear what the underlying worldsheet picture is.
A second motivation for this work comes from the structure of field-theory amplitudes. The amplitudes are expressed in terms of generalized polylogarithms. The cluster bootstrap program attempts to constrain the form of the amplitude using a set of symbol alphabets [9, 10, 11]. In a related development [12], a class of alphabets based on cluster algebras of finite type was proposed using birational maps from the kinematic variables:
(3) |
It was shown that the Feynman integral for the one-loop Bhabha scattering correspond to the cluster alphabet, a certain six-dimensional hexagon integral to the cluster alphabet, etc. However, the cluster alphabets were found by a clever choice of birational maps, and it was not clear how to derive them for other finite-type cluster algebras. The -type alphabet is the set of gauge-fixed factors in the variables (2), as string amplitudes reduce to field-theory amplitudes in the limit. It was also not clear whether the other alphabets have any geometric origin or if there is an underlying worldsheet at all.
In [13], a systematic derivation of such variables was proposed based on systems, and the results for types were presented in detail. The strategy is to construct the generalized worldsheets through a “gluing” construction. We solve the variables in terms of the worldsheet coordinates. Like in the type, the elements of an alphabet, called letters, are the factors that appear in the variables. As it stands, there are more ungauged letters than the number of cluster variables. Upon a choice of gauge, the alphabets are then read off from the factors. The number of letters in a cluster alphabet is shown in Table 1.
/ | |||||||
---|---|---|---|---|---|---|---|
42 | 70 | 128 | 28 | 8 |
This paper aims to derive the cluster alphabets for all the finite types. Our main results are as follows:
-
1.
Systematic construction of the generalized worldsheet for all finite types.
We provide a systematic derivation of the gluing construction of the exceptional types. We begin by reviewing the gluing construction of the worldsheet. We show how the construction extends to the exceptional types, and derive an explicit cross-ratio representation of all the coordinates. For the nonsimply laced types, we present the folding map that identifies the worldsheet coordinates. Our results may also be seen as an explicit verification of Zamolodchikov’s periodicity conjecture for systems [14].
-
2.
New cluster alphabets.
In the standard gauge choice, one may obtain the cluster alphabet for types as polynomials of degrees at most 2, 4, 5, 4, respectively. By choosing a different gauge, we produce a new, simpler set of alphabets. We obtain a linear alphabet for type, quadratic alphabets for types, and for types, polynomials of degrees at most 4, 5, 7, 4, 2, respectively.
2 The gluing construction
2.1 Review on the gluing construction of the worldsheet

We review the construction of the -type worldsheet based on gluing a pair of -type worldsheets. The basic observation is that the Dynkin diagram can be written as a union of a pair of Dynkin diagrams, as shown in Fig. 1. We prepare two -gons. We will call the first polygon the first sheet and the second polygon the second sheet. The vertices of the polygons can be given any labels but for convenience, we will choose them to be and , respectively. We glue of the common vertices together, leaving the last vertex on each polygon alone. The positions of the vertices will be our worldsheet variables. We may choose a snake triangulation. Assigning a node to each diagonal and an arrow between two consecutive diagonals ordered counterclockwise around a common vertex, we see that the underlying graph precisely corresponds to a Dynkin diagram of type [15].
Recall that in an worldsheet, the variables are cross ratios of their respective variables (2). By a reparametrization , it is found that the cross ratios on the worldsheet satisfy a celebrated set of equations, known as systems:
(4) |
This can be seen as a time-evolution equation that maps in each time step.
The -system equations admit a generalization to all finite types [14]:
(5) |
Here is the Cartan matrix of the root system. One may assign an orientation to the edges in the Dynkin diagram such that each node is either a source or a sink. The Zamolodchikov periodicity conjecture states that the solutions to (5) are periodic. A solution of systems in terms of cross ratios was used to prove the periodicity conjecture for the type [16].
Returning to the worldsheet picture, the diagonals in the triangulation are identified with the initial variables for each common node in the Dynkin diagram for . The diagonals connecting with in the and quadrilaterals provide and for the two branched nodes in the Dynkin diagram, respectively. Now we may assign cross ratios to the diagonals in the initial triangulation. The variables at later times are generated according to the -system equations. This process terminates when the variables return to their initial values as guaranteed by periodicity.
Because the -system equations are always birational transformations on the variables, the new variables will always be a rational function of the variables. Let . Remarkably, once we introduce the cubic polynomials
(6) |
the corresponding variables can be written as generalized cross ratios of the factors:
(7) |
for . Here and correspond to the two branched nodes in the Dynkin diagram. Because the worldsheet is constructed from gluing a pair of worldsheets, one may think of with as the cross-ratio coordinates of ’s of the first sheet, and with as the cross-ratio coordinates of ’s of the second sheet.
We shall denote the collection of polynomial factors that appear in the variables as an “ungauged alphabet.” The ungauged alphabet is
(8) |
There are independent variables. Upon gauge fixing , variables corresponding to and for all are removed, and we obtain the letters (3).
While the variables are written nicely as generalized cross ratios, the interpretation of the variables remains mysterious. Here we provide a new, determinant representation:
(9) |
It is symmetric on the pairs of indices , , , but is antisymmetric when the pairs are exchanged, much like the symmetries of a Riemann tensor.
2.2 The construction of worldsheets

Consider an -type Dynkin diagram, where . It may be written as a union of and diagrams. We prepare a -gon and a -gon and glue of the common vertices, leaving one vertex on the first polygon and two vertices on the second polygon free. We work out the example explicitly, as shown in Fig. 2. The initial set of variables are
(10) |
The variables are written in terms of the variables as
(11) |
Note that on the first sheet, the vertex that comes before is ; on the second sheet, the vertex that comes before is .
We evolve the -system equations (5) as before, generating all the at later times. Among the nonlinear factors appearing in this parametrization of the -system, there are cubic polynomials of the form
(12) |
Note that for is slightly different from for due to a difference in the labels. There are also four quartic polynomials of the form
(13) |
and a sextic polynomial
(14) |
The indices are taken to lie in so the last polynomial is simply . When some of the indices are allowed to coincide, the sextic polynomial factorizes into a product of the lower-order polynomials, e.g.,
(15) |
This allows us to write the variables, or equivalently the variables, of compactly as generalized cross ratios111The variables for can alternatively be realized by the Grassmannian cluster algebra G(4,7) [17].:
(16) |
Unlike the case, the cross ratios involving are not unique and can be transformed using the identities
(17) |
In the standard gauge choice , the alphabet consists of 42 letters that are polynomials with a degree of at most 4:
(18) |
In Sec. 5, we shall derive a simpler alphabet by a different gauge choice.
3 The boundary structure of cluster configuration spaces

Recall that one of the main features of the worldsheet is that each diagonal divides an -gon into an -gon and a -gon. The string amplitude factorizes at each pole (boundary of the space) as
(19) |
We can make similar statements for the other types with the picture of glued polygons. Each diagonal in the initial triangulation corresponds to a node on the Dynkin diagram and slices the polygon into two parts. The example is shown in Fig. 3.
(20) |
The multiplicity is determined by the periodicity of the -system.

The boundaries of the space can be obtained similarly, as shown in Fig. 4 for .
(21) |
There is an overall factor because the system has period 7. Note that for types, there are more boundaries than diagonals available. We will only identify the possible types of boundaries using the initial cluster, and the remaining boundaries will be obtained by evolving the -system equations. All the at the same th node correspond to the same type of boundary. For example, the 128 boundaries of the worldsheet are
(22) |
4 Nonsimply laced types from folding
The worldsheet parametrization for the nonsimply laced types can be achieved by a process known as folding. The folding map on the parameters is derived from the standard folding of the root systems combined with the birational map in the types. See Figs. 5 and 6.

folding
To obtain the worldsheet, we fold the worldsheet by identifying the diagonals according to the roots as
(23) |
Solving the cross-ratio relations, we obtain a fractional map of the worldsheet variables in terms of the worldsheet variables:
(24) |
for . In the standard gauge choice (), the folding map (24) reduces to a simple gauge-fixed map
(25) |
We recover the quadratic alphabet from the linear alphabet by examining all the polynomial factors that appear in the cross ratio (2) under the folding map. Equivalently, one may perform the folding map directly on the alphabet (3) and read off all the factors.
folding
We identify
(26) |
This is equivalent to .

folding
To obtain the worldsheet, we fold the worldsheet by identifying the diagonals according to the roots as
(27) |
Solving the cross-ratio relations, we obtain
(28) |
Upon gauge fixing as , this reduces to a simple map
(29) |
folding
To obtain , we fold the worldsheet by identifying the diagonals according to the roots as
(30) |
Solving the cross-ratio relations, we obtain
(31) |
Upon gauge fixing as , this reduces to a simple map
(32) |
The alphabets of nonsimply laced types may be obtained by applying the gauge-fixed maps directly to the alphabets of simply laced types. The results were already quoted in [13] without derivation. In the next section, we shall derive a simpler set of alphabets by first applying the general folding maps and then fixing the gauge.
5 New cluster alphabets
In the standard gauge choice, which is usually taken to be , we recover the known cluster alphabets of types and obtain new ones for type and the nonsimply laced ones. However, it is reasonable to suspect that we have not found the simplest possible choice. Unlike the case, not all worldsheet variables are on an equal footing. Different gauge choices will lead to different alphabets. While there is no canonical choice of the alphabet, choosing a gauge that yields letters that are polynomials of the lowest order is preferable. We say two alphabets are equivalent if seen as a collection of hypersurfaces, they have the same topological property. That is,
-
1.
The number of letters equals the dimension of the cluster algebra.
-
2.
They give the same point count in the hypersurface complement.
A simpler alphabet is obtained by the gauge choice . Let
(33) |
be the gauge-fixed version of . The alphabet is
(34) |
A similar gauge choice () removes the terms containing in the alphabet (18). Let
(35) |
be the gauge-fixed versions of respectively. A new alphabet may be written succinctly as
(36) |
Gauge fix then fold vs fold then gauge fix
To obtain the alphabet for nonsimply laced types, we may apply the gauge-fixed folding maps [(25, 26, 29, 32)] to the alphabets of simply laced types. However, the gauge choice may not be optimal for the nonsimply laced types. Alternatively, we can also first fold the ungauged alphabets using the general maps [(24, 26, 28, 31)], and then choose the gauge that produces the nicest alphabets for nonsimply laced types.
If we fold the alphabet to obtain the alphabet, then some of the letters are still quadratic. If instead the ungauged alphabet are first folded as and then gauge fixed as , then we obtain a linear alphabet
(37) |
We chose this particular gauge because it produces the simplest possible set of linear letters. Here we see the advantage of having an ungauged description of the worldsheet. It is not possible to obtain the linear alphabet from folding the quadratic alphabet because we have gauge fixed to obtain the alphabet, whereas the alphabet corresponds to gauge fixing . This shows that the -type alphabet may be realized by a set of hyperplanes.
For , we were not able to find a gauge choice that leads to a linear alphabet. The ungauged letters obtained from the general folding map are quadratic in of the variables. An interesting question would be to find a map that realizes the alphabet as a hyperplane arrangement.
To obtain the alphabet, we now need to solve the folding equation (30) for , apply the map on the ungauged alphabet, and then gauge fix as . We then arrive at a new alphabet that is at most quadratic, as opposed to quartic as found previously from the standard gauge fixing [13]:
(38) |
Note that as in the folding, we cannot obtain a simplified form of the alphabet if we directly folded the alphabet as (29), where is already fixed at infinity. Instead, we fold the ungauged alphabet and then gauge fix as . A new alphabet consists of 28 letters of polynomial degree of at most :
(39) |
where
(40) |
Acknowledgments
We thank Song He and Yong Zhang for their collaboration on a related project. Y. W. is supported by China National Natural Science Funds for Distinguished Young Scholar (Grant No. 12105062) and Agence Nationale de la Recherche (ANR), Project No. ANR-22-CE31-0017. P. Z. would like to thank Xiaobin Li and Yuqi Li for the discussions.
Appendix A Alphabets for and
The alphabets of and may be constructed similarly. The gauge choice is . The alphabet consists of letters with a degree of at most . Introduce two new highest-order letters
(41) |
The 70 letters of the alphabet are
(42) |
The alphabet consists of letters with a degree of at most . We introduce six degree-7 letters
(43) |
and three degree-6 letters
(44) |
The 128 letters of the alphabet are
(45) |
References
- [1] H.-M. Chan, A generalised Veneziano model for the -point function, Phys. Lett. B 28 (1969) 425–428. doi:10.1016/0370-2693(69)90342-6.
- [2] H.-M. Chan, S. T. Tsou, Explicit construction of the -point function in the generalized Veneziano model, Phys. Lett. B 28 (1969) 485–488. doi:10.1016/0370-2693(69)90523-1.
- [3] Z. Koba, H. B. Nielsen, Reaction amplitude for mesons: A Generalization of the Veneziano-Bardakci-Ruegg-Virasoro model, Nucl. Phys. B 10 (1969) 633–655. doi:10.1016/0550-3213(69)90331-9.
- [4] Z. Koba, H. B. Nielsen, Manifestly crossing invariant parametrization of meson amplitude, Nucl. Phys. B 12 (1969) 517–536. doi:10.1016/0550-3213(69)90071-6.
- [5] N. Arkani-Hamed, S. He, T. Lam, Stringy canonical forms, JHEP 02 (2021) 069. arXiv:1912.08707, doi:10.1007/JHEP02(2021)069.
- [6] N. Arkani-Hamed, S. He, T. Lam, H. Thomas, Binary geometries, generalized particles and strings, and cluster algebras, Phys. Rev. D 107 (6) (2023) 066015. arXiv:1912.11764, doi:10.1103/PhysRevD.107.066015.
- [7] N. Arkani-Hamed, S. He, T. Lam, Cluster configuration spaces of finite type, SIGMA, Symmetry Integrability Geom. Methods Appl. 17 (2021) paper 092, 41. doi:10.3842/SIGMA.2021.092.
- [8] S. Fomin, A. Zelevinsky, -systems and generalized associahedra, Ann. Math. (2) 158 (3) (2003) 977–1018. doi:10.4007/annals.2003.158.977.
- [9] L. J. Dixon, J. M. Drummond, J. M. Henn, Bootstrapping the three-loop hexagon, JHEP 11 (2011) 023. arXiv:1108.4461, doi:10.1007/JHEP11(2011)023.
- [10] J. Golden, A. B. Goncharov, M. Spradlin, C. Vergu, A. Volovich, Motivic Amplitudes and Cluster Coordinates, JHEP 01 (2014) 091. arXiv:1305.1617, doi:10.1007/JHEP01(2014)091.
- [11] J. M. Drummond, G. Papathanasiou, M. Spradlin, A Symbol of Uniqueness: The Cluster Bootstrap for the 3-Loop MHV Heptagon, JHEP 03 (2015) 072. arXiv:1412.3763, doi:10.1007/JHEP03(2015)072.
- [12] D. Chicherin, J. M. Henn, G. Papathanasiou, Cluster algebras for Feynman integrals, Phys. Rev. Lett. 126 (9) (2021) 091603. arXiv:2012.12285, doi:10.1103/PhysRevLett.126.091603.
- [13] S. He, Y. Wang, Y. Zhang, P. Zhao, Notes on Worldsheet-Like Variables for Cluster Configuration Spaces, SIGMA 19 (2023) 045. arXiv:2109.13900, doi:10.3842/SIGMA.2023.045.
- [14] A. B. Zamolodchikov, On the thermodynamic Bethe ansatz equations for reflectionless ADE scattering theories, Phys. Lett. B 253 (1991) 391–394. doi:10.1016/0370-2693(91)91737-G.
-
[15]
M. Gekhtman, M. Shapiro, A. Vainshtein,
Cluster algebras and
Weil-Petersson forms, Duke Mathematical Journal 127 (2) (apr 2005).
doi:10.1215/s0012-7094-04-12723-x.
URL https://doi.org/10.1215%2Fs0012-7094-04-12723-x -
[16]
A. Y. Volkov, On the
Periodicity Conjecture for -systems, Communications in Mathematical
Physics 276 (2) (2007) 509–517.
doi:10.1007/s00220-007-0343-y.
URL https://doi.org/10.1007%2Fs00220-007-0343-y - [17] J. Drummond, J. Foster, O. Gürdoğan, Cluster adjacency beyond MHV, JHEP 03 (2019) 086. arXiv:1810.08149, doi:10.1007/JHEP03(2019)086.