Closed string trajectories from a new “tiling”
- 1Université de Mons
- 2Scuola Normale Superiore
- 3INFN, Sezione di Pisa
Abstract
A bstract : 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. Due to combinatorial complexity, the “double copy” of open strings is limited in efficiency as a means of building closed string trajectories. We bypass this technical difficulty by employing one open string as the fundamental seed and then dressing it by a suitable selection of generators of a symplectic algebra that acts on both the left and the right sector. By applying Howe duality, the dressed seeds amount to closed string trajectory candidates, finding the physical subset of which is possible by solving systems of equations involving Diophantine-like recursion relations, which we also illustrate with examples.
Versions
Related
- Instanton-induced closed-string amplitudes in minimal superstring theory at subleading order
- Altermagnetic Ground States on the Ammann--Beenker Tiling
- TETRIS-Q: Tiling-based Effective Transient-fault Reduction on Interleaved Superconducting Qubits
- High-energy uniqueness of open-string disk integrals
- What is Classical Null String Theory?
BibTeX
@article{basile2026closed,
title = {{Closed string trajectories from a new “tiling”}},
author = {Thomas Basile and Chrysoula Markou},
journal = {Journal of High Energy Physics},
year = {2026},
month = oct,
doi = {10.1007/jhep10(2026)132},
url = {https://link.springer.com/10.1007/JHEP10(2026)132},
note = {CC BY 4.0},
}
RIS
TY - JOUR
TI - Closed string trajectories from a new “tiling”
AU - Thomas Basile
AU - Chrysoula Markou
PY - 2026
DA - 2026/10/12
JO - Journal of High Energy Physics
DO - 10.1007/jhep10(2026)132
UR - https://link.springer.com/10.1007/JHEP10(2026)132
AB - A bstract : 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. Due to combinatorial complexity, the “double copy” of open strings is limited in efficiency as a means of building closed string trajectories. We bypass this technical difficulty by employing one open string as the fundamental seed and then dressing it by a suitable selection of generators of a symplectic algebra that acts on both the left and the right sector. By applying Howe duality, the dressed seeds amount to closed string trajectory candidates, finding the physical subset of which is possible by solving systems of equations involving Diophantine-like recursion relations, which we also illustrate with examples.
SN - 1029-8479
ER -