Closed string trajectories from a new "tiling"
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: High Energy Physics: Theory. The day in high-energy theory: gravity, strings, fields and the questions left open.
Kai: We're looking at the paper: "Closed string trajectories from a new "tiling"".
Mira: Here's the gist of the paper. Based on an efficient technology for the excavation of entire open string trajectories of physical states, we propose an algorithmic method of constructing the largely unknown closed string trajectories.
Kai: The Core Proposal The paper proposes a new and efficient (covariant) technology for the construction of entire subleading Regge trajectories and their amplitudes for the closed bosonic critical string.
Mira: This method bypasses the technical difficulty of using the "double copy" of open strings by employing one open string as a fundamental seed and dressing it with generators of a symplectic algebra to find closed string trajectory candidates via Howe duality.
Kai: The Algorithmic Mechanism The construction proceeds by mapping the irreducible representations of the so(D − 1, 1) algebra to those of the sp(2K) via Howe duality.
Title and authors: Kai: Moving on, the title itself, "Closed string trajectories from a new tiling," suggests they are introducing some kind of new organizational structure for these paths in the spectrum. It hints that what we're seeing isn't just random states, but something more structured.
Mira: Yeah, it sounds like they’re proposing a way to tile the space of possible closed string trajectories in a finite or manageable way. It’s less about finding one random path and more about understanding the whole landscape.
Lev: From an engineering view, tiling implies periodicity or some kind of repeating unit that we can build from, which is good because it suggests structure rather than infinite randomness.
Kai: So when they say they are bypassing the difficulty of using the "double copy" of open strings, what's the actual simple explanation for why that specific tool is hard to use here?
Mira: The double copy approach is technically difficult because it gets messy when you try to build closed string trajectories directly from it. It introduces combinatorial complexity when you look at decomposing a product of generic diagrams, which makes finding a general formula in terms of row lengths very hard.
Lev: So the bottleneck isn't just the math, but the sheer number of combinations you have to manage when trying to combine open strings into closed ones.
Kai: And their proposed solution is using one seed open string and dressing it with symplectic algebra generators via Howe duality. They claim this bypasses that difficulty by finding a path that is more efficient.
Mira: Exactly, they are using the sp(2K) structure to guide the construction of these candidates, which seems to be a much more controlled process than direct tensor products of open string diagrams <ref:2606.04088#pg1>.
Lev: It sounds like they're trading one kind of complexity for another—the complexity of solving recursion relations for the dressing procedure versus the complexity of enumerating massive tensor products.
Kai: And they show how this works by constructing specific examples, like the one-row trajectory, using operators tau11 and T21 to build that closed string trajectory Ansatz <ref:2606.04088#pg1>.
Mira: That construction is key because it shows that you can actually get a physical state at an integer level N by letting the level-matching condition dictate exactly how those parameters must relate.
Lev: It’s good to see them use concrete operators and constraints like that, because I need to know if these relations are stable enough to be used in any kind of calculation.
Kai: They also mention that for w equals zero, they map all the Weinberg states—the first appearances of all possible Young diagrams—to lowest weight states of the sp(2K) algebra <ref:2606.04088#pg1>.
Mira: That’s a big statement; it means they're organizing an infinite set of potential trajectories into a finite number of organized families, defined by those sp(2K) representations <ref:2606.04088#pg1>.
Lev: So, the underlying algebraic structure is what organizes the spectrum, not just the geometry or momentum labels.
Kai: And for w greater than zero, they say those trajectories are clones of the w equals zero ones in terms of diagrams, but their vertex operators are more complex and hard to construct beyond a level-by-level basis.
Mira: It means you get these organized families from the simpler w equals zero ones, but moving deeper into the spectrum requires more work to write down the vertex operators explicitly.
Lev: That implies that for high energy states, the complexity of describing them in terms of vertex operators will increase significantly, which is something we need to account for when designing error correction codes.
The paper's summary: Kai: So summarizing this whole idea again, "Closed string trajectories from a new tiling," they are proposing an algorithmic path to finding closed string trajectories by using one open string as a fundamental seed.
Mira: That seed is then dressed with generators of a symplectic algebra, and by applying Howe duality, this gives them closed string trajectory candidates that they can then filter down using Diophantine-like recursion relations.
Lev: So the summary is: use an open string to start, use a symplectic algebra to dress it up via duality, and then solve constraints to get the actual physical trajectories.
Kai: It’s an efficient technology because it avoids the massive combinatorial explosion that comes from trying to use the double copy directly for closed strings.
Mira: The implication is that this method offers a systematic way to find entire clones of states by controlling their energy contribution based on their depth in the spectrum using those raising operators.
Lev: If this works, it means we move away from guessing or brute-forcing diagrams and towards a structured generation process defined by algebraic rules.
Kai: And they show that they can construct specific examples, like the one-row trajectory, by dressing the seed with specific combinations of operators to enforce the level-matching condition for a physical state at integer level N <ref:2606.04088#pg1>.
Mira: It's showing that even though the starting points might not satisfy all conditions on their own, you can use these dressing operators to fix them into a valid closed string trajectory.
Lev: So, it’s about using algebraic tools to impose physical reality onto states that are otherwise just algebraic candidates.
Kai: And they conclude that this whole process results in a family of trajectories described by just one vertex operator, which is quite compact.
Mira: It suggests a very elegant mathematical description for these previously obscure closed string trajectories.
Lev: For real hardware, if we can translate this algebra into constraints on the physical state vectors, it might give us a much cleaner way to think about the overhead of error correction.
The paper's improvements: Kai: One of the main improvements they point out is how they handle the construction of specific trajectories, like the one-row and two-row families <ref:2606.04088#pg1>. They achieve this by solving systems of equations derived from constraints to find specific physical states at determined levels.
Mira: They also improved on how we look at the tensor products of open string physical states. Instead of relying on a general formula for Littlewood–Richardson coefficients based on row lengths, they use a method that bypasses that combinatorial complexity entirely.
Lev: Bypassing those coefficients is huge because those coefficients are notoriously complicated; if you can avoid calculating them directly, you save an enormous amount of computation time.
Kai: So, instead of relying on complex diagram decomposition formulas, they use the dressing mechanism to derive the closed string decompositions directly. That’s a real win for efficiency.
Mira: And they also showed that the structure is organized by mapping states to lowest weight states of the sp(2K) algebra, which gives us a clear organizational principle for these trajectories <ref:2606.04088#pg1>.
Lev: A clear organizational principle is what we need when designing error correction schemes; you need predictable patterns in your state space.
Kai: They also noted that their method is covariant, meaning it works regardless of the reference momentum you choose, which adds another layer of robustness to the result.
Mira: The covariance is important because it means the underlying physics isn't tied to an arbitrary reference momentum choice; it’s a property of the whole system.
Lev: That makes it much more robust for applying these concepts in any physical context, whether we are talking about string theory or something else.
Conclusion: Kai: To wrap this up, the paper "Closed string trajectories from a new tiling" proposes an algorithmic and covariant method for constructing closed string trajectories from open string seeds.
Mira: It leverages dressing open strings with symplectic algebra generators via Howe duality to find candidates, then uses recursion relations to solve constraints into a single vertex operator description.
Lev: So the main implication is that we have a structured way to generate entire families of states, which moves us away from brute force diagram counting.
Kai: It’s a systematic generation process defined by algebraic rules that works even for the lowest weight states when dressed correctly with those specific operators.
Mira: It offers a clear organizational principle—the mapping to sp(2K) Lowest Weight States—for understanding how these trajectories are organized in the spectrum <ref:2606.04088#pg1>.
Lev: For us, it means if this method is sound, we can use algebraic rules to predict which states will actually pass the physical constraints on real hardware setups.
Kai: It’s a structured way to excavate the largely unknown part of the closed bosonic string spectrum with efficiency and covariance.
Mira: We're looking forward to seeing how this new tiling concept influences other areas of string theory and holography, especially in relation to those AdS2 times S squared solutions.
Lev: I’m just hoping that translating these algebraic rules into something computationally tractable for error correction will actually happen soon.
Thomas Basile, Chrysoula Markou
Service de Physique de l’Univers, Champs et Gravitation, Université de Mons · Scuola Normale Superiore and INFN
hep-th, hep-ph
Submitted: 2026-06-02
Updated: 2026-10-28
Comments: minor clarifications added, matches published version
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Importance score: 78/100
The gist: Based on an efficient technology for the excavation of entire open string trajectories of physical states…
Key concepts
- Open String Seeds
- Instead of trying to combine open string trajectories into closed ones, the method uses a single open string (left or right) as a fundamental starting point. These seeds are then modified using specific algebra generators to embed them directly into the spectrum of closed strings.
- Howe Duality
- This mathematical tool is used to map irreducible representations between different algebras, specifically from the so(D-1, 1) algebra to sp(2K). This mapping is crucial for systematically constructing entire families (clones) of trajectories by dressing the basic w=0 states.
- Symplectic Algebra Dressing
- This involves taking a simple trajectory (w=0) and adding combinations of raising operators from the sp(2K) algebra. These additions are carefully chosen so that they contribute exactly the amount of energy needed to match the depth of the desired closed string trajectory.
- Virasoro Constraints and Level-Matching
- These are mathematical conditions that must be satisfied for a state to be a valid physical state in string theory. Solving these constraints on the dressed Ansatz allows researchers to find specific parameters that yield actual physical states at integer energy levels.
Terminology
Summary
Based on an efficient technology for the excavation of entire open string trajectories of physical states, we propose an algorithmic method of constructing the largely unknown closed string trajectories. p. 0
The Core Proposal
The paper proposes a new and efficient (covariant) technology for the construction of entire subleading Regge trajectories and their amplitudes for the closed bosonic critical string. This method bypasses the technical difficulty of using the double copy
of open strings by employing one open string as a fundamental seed and dressing it with generators of a symplectic algebra to find closed string trajectory candidates via Howe duality.
The Algorithmic Mechanism
The construction proceeds by mapping the irreducible representations of the so(D − 1, 1) algebra to those of the sp(2K) via Howe duality. This allows for a systematic construction of entire clones by dressing an w = 0 trajectories with combinations of raising operators of the sp(2K) algebra that contribute units of energy equal to the depth at which the clone lies. p. 2 Solving the Virasoro constraints and level-matching condition on this Ansatz yields the entire clone, with coefficients depending only on spin labels. p. 2
The Role of Open String Seeds
The paper argues against tensoring open string trajectories to construct closed string ones because combinatorial complexity prevents a general formula in terms of row lengths for the decomposition of a product of generic diagrams. Instead, it suggests using one open string (left or right) as the fundamental ingredient, dressing its w = 0 trajectories with generators of the spLR algebra to embed them in the closed string spectrum. p. 3
Specific Trajectory Construction
The mechanism is illustrated by constructing specific trajectories, such as the 1-row trajectory, by dressing the open string seed with a function constructed out of operators like τ11 and T21. This leads to a solution where the level-matching condition dictates specific relationships between parameters, yielding a physical state at an integer level N. p. 3
Conclusion and Future Directions
The work concludes that while the lowest weight states of the larger sp(2N + 2N¯, R) algebra are not generically physical due to failing the level-matching condition, they can be dressed with spLR operators to obtain closed string trajectories. Future directions include solving the Virasoro constraints for arbitrary depth and investigating the relationship between the spLR algebra and the symmetry algebra of closed string amplitudes. p. 3
B Commutation Relations
The commutation relations of the generators τ with themselves are given by [τkl, τmn] = δml Tkm, [τkl, τmn] = −δln Tkm, and [τkl, τmn] = δm k T¯l n, [τkl, τmn] = −δ l n T k m. The commutators of the generators with the spL and spR generators are detailed in equations (B. p. 53) through (B.18).
Building Closed String Trajectories
The construction of closed string trajectories involves solving a system of Diophantine-like recursion relations when constructing W = 0 trajectories. For the 2-row trajectory, the level-matching condition leads to an iterative system (5. p. 319) whose solution depends on parameters determined by solving recursion relations (5. p. 030) and (5.32).
Conclusions
The paper proposes an algorithmic and covariant method of constructing the largely unknown trajectories of the closed bosonic (critical) string spectrum. This method leverages the fact that open string states already pass most physicality constraints, allowing them to be dressed with spLR operators to excavate entire closed string physical trajectories in an algorithmic, efficient and covariant way. p. 0 The resulting solution is a family of trajectories described by a single vertex operator. p. 3
A First few levels of the closed bosonic string
The construction of the Young diagrams of the physical states of the first few levels is done by applying the Littlewood–Richardson algorithm to the tensor product of open string physical states. The W = 0 and W = 1 one-row trajectories are denoted by diagrams with a deep purple and green filling respectively. p. 7 p. 7 The W = 0 and W = 1 two-row (families of) trajectories are denoted by diagrams with a pink and orange filling respectively. p. 7 p. 7
The commutation relations of the generators τ with themselves are derived from the oscillator algebras (2.1) and read [τkl, τmn] = δnl Tkm, [τkl, τm n] = −δln Tkm, and [τkl, τmn] = δm k T¯l n, [τkl, τmn] = −δ ‖n T km,. The commutation relations of the generators with the spL and spR generators are listed in equations (B. p. 91) through (B.18).
The closed string polarizations can be written as products of open string polarizations suitably symmetrized and/or antisymmetrized if needed. The states are grouped together within parentheses when the respective Young diagrams have the same total number of boxes. p. 7 The W = 0 and W = 1 one-row trajectories are denoted by diagrams with a deep purple and green filling respectively. The W = 0 and W = 1 two-row (families of) trajectories are denoted by diagrams with a pink and orange filling respectively.
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
Automated construction of closed string trajectories based on an efficient technology for open string trajectories can be performed by employing one open string as a fundamental seed and dressing it with suitable generators of a symplectic algebra to find closed string trajectory candidates.
-
AI systems can use Howe duality to systematically construct entire clones of w = 0 trajectories by dressing them with all combinations of raising operators of the sp(2K) algebra that contribute units of energy equal to the depth at which the clone lies.
-
The system can solve Diophantine-like recursion relations derived from Virasoro constraints and level-matching conditions to find single vertex operators that describe entire families of infinitely many trajectories, referred to as a trajectory itself.
-
AI can construct specific closed string trajectories, such as the 1-row trajectory or 2-row trajectory, by solving systems of equations derived from the constraints to obtain specific physical states at determined levels.
-
The system can analyze the structure of tensor products of open string physical states to derive closed string decompositions by applying a method that bypasses combinatorial complexity in obtaining general formulas for Littlewood-Richardson coefficients in terms of row lengths.
-
AI can dress open string w = 0 trajectories with a function constructed out of the operators tau i j and T k > l l only to obtain a closed string trajectory Ansatz, which is then solved by imposing all Virasoro constraints and the level-matching condition.
Sources
- The covariant perturbative string spectrum
- Refined Partition Functions for Open Superstrings with 4, 8 and 16 Supercharges
- An excursion into the string spectrum
- On the deep superstring spectrum
- On the deep string spectrum
- An introduction to string states and their interactions
- Unraveling the Spectrum of the Open String
- String Lessons for Higher-Spin Interactions
- Dual pairing of symmetry groups and dynamical groups in physics
- Dual Pair Correspondence in Physics: Oscillator Realizations and Representations
- Kac-Moody algebras in perturbative string theory
- Hidden Superconformal Symmetry in M Theory
- E_11 and M Theory
- A class of Lorentzian Kac-Moody algebras
- Nonlinear higher spin theories in various dimensions
- Elements of Vasiliev theory
- The unitary representations of the Poincare group in any spacetime dimension
- On the complexity of computing Kronecker coefficients
- New Relations for Gauge-Theory Amplitudes
- Perturbative Quantum Gravity as a Double Copy of Gauge Theory
Related papers
- The facts on quantum self-dual Einstein gravity and self-dual Yang-Mills theory
- Quantum Langlands correspondence for Painlev'e II
- Fortuitous BMN Operators from Multiple Cores
- Building far-from-equilibrium effective field theories using shift symmetries
- Inflation, Cosmic Perturbations and Non-Gaussianities
- Wavefunctions of AdS 3 Universes and T-deformed Torus Partition Functions