The growth of SO(9) super-representations in Type II string theory

summary

The gist

The growth of massive SO(9) super-representations in type II and type I string theories is studied by finding an empirical formula for representation appearance…

In short

The study investigates how SO(9) super-representations grow in Type II and Type I string theories. By using a refined partition function, the research finds empirical formulas for representation appearance and derives improved asymptotic approximations. This allows for accurate counting of representations up to high levels, confirming that higher-order Rademacher corrections are necessary for precise results.

Key concepts

Refined Partition Function
This is a mathematical function used to count the number of different SO(9) super-representations. It is defined using Jacobi theta-functions and fugacities related to the U(1)4 subgroup. Evaluating this function over finite fields helps determine the exact multiplicities.
Rademacher Sum
This is a powerful mathematical tool used to find very accurate approximations for representation multiplicities. The paper uses it to construct asymptotic formulae by integrating about peaks of the refined partition function, providing better estimates than simpler methods.
Asymptotic Formulae
These are simplified mathematical expressions that describe how the number of representations grows as the level increases. The study derives leading terms and subsequent corrections (Rademacher terms) to these formulas, showing how closely they match the true counts.

Terminology used across episodes

This episode discusses

The paper

The growth of SO(9) super-representations in Type II string theory · Read on arXiv

Alessandro Georgoudisa, Joseph A. Minahan, Gustav Strömb, Athanasios Zoumisb

Centre for Theoretical Physics and Astronomy, Queen Mary University of London · Department of Physics and Astronomy, Uppsala University · Centre for Geometry and Physics, Uppsala University · Center for Theoretical Physics – a Leinweber Institute, Massachusetts Institute of Technology

We study the growth of massive SO(9) super-representations in type II and type I string theories. We do this first directly by finding an empirical formula that specifies which representations appear at any level, and then compute the multiplicities from a refined partition function evaluated over finite fields up to level 501 for individual representations, and level 226 for all representations. We then derive asymptotic formulae for the growth of any representation, which are constructed by integrating about the peaks of the refined partition function. Using a Rademacher sum we can find very accurate approximations for the multiplicities of the representations. Unlike the superstring partition function, which only receives contributions from the odd Rademacher terms, the multiplicities for any representation have contributions from both even and odd terms. Finally, we apply the same techniques to the ordinary representations, where a simplified refined partition function allows for better computational speed and simpler expressions for the asymptotic approximations.

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: "The growth of SO(9) super-representations in Type II string theory".

Mira: Here's the gist of the paper. The growth of massive SO(9) super-representations in type II and type I string theories is studied by finding an empirical formula for representation appearance, computing multiplicities from a refined partition function, and deriving asymptotic formulae Study Goals and Methodology The paper has two main goals: to go to much higher levels to find the multiplicities, reaching level 501 for individual representations and level 226 for all representations, and to derive improved asymptotic approximations The computation of multiplicities involves evaluating the refined partition function over finite fields up to level 501 for individual representations and level 226 for all representations Asymptotic formulae are constructed by integrating about the peaks of the refined partition function The Rademacher sum is a main tool used to find very accurate approximations for the multiplicities of the representations Refined Partition Function and Representation Counting The refined partition function is defined as

5: ZL(q, x1, x2, x3, x4) = X∞ n=1 Xk ak,nχk(x1, x2, x3, x4)q n The characters are associated with the U(1)4 subgroup of SO(9), and the refined partition function is written in terms of Jacobi theta-functions The basis of fugacities chosen is the U(1)4 basis since it gives more symmetric expressions Asymptotic Growth and Corrections The leading asymptotic growth for a general SO(9) superrepresentation is found to be ρk(n) ≈ 2(6/3/9/5/4/7 2π / (√2n)) 83/2 e(2π / √2n) The second Rademacher correction to the multiplicities for k, ρ(2)k(n), is found to be ρ(2)k(n) = i Zϵ+i∞ϵ-i∞ dt 2 X∞ j=0 c(2,1)k,j t(19+2j − X∞ j=0 c(2,2)k,j t(25+2j)!

Kai: (−1) n e nπt+π/2t The third Rademacher correction involves a sum over terms with specific powers of t Ordinary Representations and Final Asymptotics The techniques are also applied to ordinary representations, where the refined partition function is simpler, allowing for even higher levels The asymptotic growth for ordinary representations is given by ρk(n) ≈ 2(6/3/9/5/4/7 2π / (√2n)) 83/2 e(2π / √2n) The results show that the asymptotic results converge to the true multiplicities, but the rate of convergence is noticeably slower than for the total degeneracy of the string partition function Worked Example and Conclusion An worked example at level n = 6 illustrates how a single multiplicity is obtained and why the calculation is triangular The final result for the multiplicities up to level 226 shows that there are 1,518,464 distinct representations with nonzero multiplicities The paper concludes by showing that including the fourth Rademacher term is enough to predict the correct multiplicity for more than 30 levels The discussion suggests future work on applying these results to counting superrepresentations in N = 4 super Yang-Mills The paper also suggests it would be useful to derive the rule in table 1 or equation (3.6) from first principles The acknowledgements thank several individuals and institutions for support during the course of this work The research is supported by a Royal Society funding, URF R221015.

Mira: A Tables for the leading Rademacher coefficients Table 3 provides the coefficients c k,j for the irreps

0, 0, 0, 0: (second column) and

1, 0, 0, 0: (third column) Table 4 provides the coefficients c k,j for the irreps

1, 261−1: (second column) and

261−1: (third column) Table 5 provides the coefficients c k,j for the irreps

2, 0, 0, 0: (second column) and

384: (third column) Tables B through D provide the second and third Rademacher coefficients for different representations Tables A through C provide the leading Rademacher coefficients for different representations Table 5 shows the third Rademacher coefficients for

2, 0, 0, 0: and

384: Table 15 provides the fourth Rademacher coefficients for

0, 0, 0, 0: up to j = 1 Table 16 provides the fourth Rademacher coefficients for

1, 261−1: up to j = 1 Table 38 provides the tables for the leading Rademacher coefficients Table 44 provides the fourth Rademacher coefficients for

2, 2: up to j = 1 Table 53 provides the third Rademacher coefficients for

5, 8: up to j = 3 The tables are found in appendices A-D.

Kai: B Tables for the second Rademacher coefficients Table 6 shows the second Rademacher coefficients for the

0, 0, 0, 0: representation up to j = 5 Table 7 shows the second Rademacher coefficients for

1, 261−1: up to j = 5 Table 8 shows the second Rademacher coefficients for

2, 2: up to j = 5 C Tables for the third Rademacher coefficients Table 10 shows the third Rademacher coefficients for

0, 0, 0, 0: up to j = 3 Table 11 shows the third Rademacher coefficients for

1, 261−1: up to j = 3 Table 12 shows the third Rademacher coefficients for

2, 2: up to j = 3 D Tables for the fourth Rademacher coefficients Table 15 shows the fourth Rademacher coefficients for

0, 0, 0, 0: up to j = 1 Table 16 shows the fourth Rademacher coefficients for

1, 261−1: up to j = 1 Table 17 shows the fourth Rademacher coefficients for

2, 2: up to j = 1 E A worked example at level n = 6 This appendix illustrates the extraction procedure at the first level for which several different types of representations occur The final result is Z(6)L = χ

6,0,0,0: + χ

4,0,0,1: + χ

3,1,0,0: + χ

4,0,0,: + χ

3, 225: The evaluation at the identity gives Xk∈A6 ak 6 dim(k) = 26136 Figure 13 Figure 13 shows plots of the log of the multiplicities up to level n = 1000 for the symmetric representations

50l, 0, 0, 0: , where l is an integer between 0 and 10 Figure 14 Figure 14 shows plots for the logs of the multiplicities for the singlet and spinor representations Figure 5 Figure 5 shows the log of multiplicities for the six lowest dimensional representations, with dimensions 1, 9, 16, 36, 44 and 84 up to level n = 501 Figure 7 Figure 7 shows plots for the six lowest dimensional representations with various orders of the expansion in (4.13), up to j = 50 Figure 8 Figure 8 shows plots showing the difference between the asymptotic formula in (4.13) with the actual multiplicities for five different representations Figure 12 Figure 12 shows a plot of the difference between the multiplicity and the asymptotic formula up to the fourth Rademacher term for various representations Figure 15 Figure 15 shows plots showing the difference between the actual multiplicities and the asymptotic expressions, up to the fifth Rademacher term, for the singlet and spinor representations The results are approximately 6.20 × 1027 and 6.99 × 1028 at level n = 200, respectively Figure 15a-b Sub-figures (a) and (b) show the difference between the actual multiplicities and the asymptotic result up to the second Rademacher term for the

0, 0, 0, 0: representation Figure 15c-d Sub-figures (c) and (d) show the result of taking the first fifty terms of the Taylor expansion, zooming in to the low levels to show how well this tracks with the actual values Figure 14a-d Sub-figures (a) and (b) show plots for the logs of the multiplicities for the singlet and spinor representations Figure 15a-b Sub-figures (a) and (b) show the difference between the actual multiplicities and the asymptotic result up to the fifth Rademacher terms for the singlet and spinor Figure 15c-d Sub-figures (c) and (d) show those differences for

0, 0, 0, 1: The difference is in the hundreds for the singlet and the tens for the spinor Figure 13 Figure 13 shows plots of the log of multiplicities versus √2n up to level n = 1000 for representations

50l, 0, 0, 0: Figure 6 Figure 6 shows the log of multiplicities for the six lowest dimensional representations (red dots), compared with the asymptotic formula in (4.11) (orange) up to level n = 501 The orange curve is approaching the true multiplicity at level n = 501 Figure 8 Figure 8 shows the difference between the asymptotic values found in (4.13) with the actual multiplicities for five different representations The fractional difference for

0, 0, 0, 1: is significantly smaller at this level Figure 9a-b Figure 9a and Figure 9b show the difference between the multiplicity and the asymptotic formula up to the second Rademacher term for the

0, 0, 0, 1: representation Figure 10a-b Figure 10a and Figure 10b show the results for

0, 0, 0, 1: without and with the second Rademacher term The latter clearly shows the three branches expected to be corrected from the third Rademacher term Figure 15a-b Sub-figures (a) and (b) show the difference between the actual multiplicities and the asymptotic result up to the fifth Rademacher terms for the singlet and spinor The actual multiplicities are approximately 6.20 × 1027 and 6.99 × 1028 at level n = 200, respectively Figure 5 Figure 5 shows the log of multiplicities for the six lowest dimensional representations up to level n = 501 Figure 15a-b Sub-figures (a) and (b) show the difference between the actual multiplicities and the asymptotic result up to the fifth Rademacher terms for the singlet and spinor The actual multiplicities are approximately 6.20 × 1027 and 6.

Title and authors: Kai: So we're looking at this paper now, "The growth of SO(nine) super-representations in Type II string theory <ref:2609.04107#pg1,The growth of SO(9) super-representations in Type II string theory>." It’s by Georgoudisa and Minahan. They’re trying to figure out how these massive SO nine super-representations grow.

Mira: Right, and the title itself hints that they're focusing on how these specific types of states appear in both type two and type one string theories. It sounds like they are doing some deep counting work here, not just looking at some simple particle counts.

Lev: So what is the actual goal here? Is it just to count how many of these states exist at a given mass level, or are they trying to find a general formula that tells you which representations appear altogether?

Kai: The abstract says they do both. They aim to find an empirical formula that specifies which representations appear at any level, and then they compute the actual multiplicities by using this refined partition function over finite fields up to level five hundred one for individual states and up to level two hundred twenty-six for all of them <ref:2609.04107#pg1,an empirical formula that specifies which representations appear at any level, and>.

Mira: Level five hundred one for individual states sounds like a big computational hurdle <ref:2609.04107#pg1>. That’s where we usually have to go to really check if the leading order stuff holds up at low levels, right?

Lev: Exactly. And they are using these refined partition functions written in terms of Jacobi theta functions, which is a pretty advanced way to set up the counting problem. It makes sense from a theoretical standpoint because those functions are intrinsically linked to the underlying symmetry groups, like the U one four subgroup of SO nine that they mention.

Kai: Yeah, and they chose a specific basis for these fugacities called the U one four basis because it gives them more symmetric expressions in their setup. It sounds like they’re trying to keep things organized as much as possible while doing this heavy counting.

Mira: They are also using Rademacher sums to get very accurate approximations for the multiplicities, which is a standard trick when you need those high precision numbers. That lets them push the asymptotic formulas further than just finding the first term.

Title and authors: Lev: And they're not stopping there with just one term. They’re going all the way up to the fourth Rademacher term, and they even have tables for those coefficients, which shows how detailed their calculation is supposed to be.

Kai: It's interesting because they found that including that fourth Rademacher term is enough to predict the correct multiplicity for more than thirty levels, which means it gives a lot of predictive power even when you aren't calculating at the absolute highest level.

Mira: That’s a solid result, but I wonder if those coefficients are stable across different representations. They have tables showing coefficients for different specific representations, like zero zero zero zero and one two hundred sixty-one minus one, so we can see how the correction terms change depending on what you are counting.

Lev: The paper also looks at ordinary representations separately because their refined partition function is simpler than the general ones. This lets them push those computations to even higher levels with less complexity in terms of the math needed.

Kai: So, if we look at ordinary representations, they get a leading asymptotic growth formula that looks very similar to the one for general SO nine superrepresentations, just without that extra factor related to the dimension of the representation.

Mira: That leads us to their conclusion about convergence: even though they have these detailed formulas involving multiple Rademacher terms, the actual results still show that they converge to the true multiplicities, but it takes a bit longer than for just counting all possible states in the string partition function.

Lev: So, what’s the practical result on the ground? They found there are one million five hundred thousand distinct representations with non-zero multiplicities up to level two hundred twenty-six <ref:2609.04107#pg1>. That’s a lot of states to track.

Kai: Yeah, and they even have some plots showing the log of multiplicities for things like the six lowest dimensional representations up to level five hundred one <ref:2609.04107#pg1>. It looks like the asymptotic curves are getting pretty close to those actual counts by that point.

Title and authors: Mira: I think what’s really telling is how well the different correction terms track the real numbers. There are plots showing the difference between their actual multiplicities and their asymptotic formulas up to the fifth Rademacher term for things like the singlet and spinor representations, where they get down to differences in billions at level two hundred <ref:2609.04107#pg1>.

Lev: For my perspective, that means if you were trying to build hardware based on these counts, you’d need those higher terms if you wanted high fidelity. The method itself is complex because of all those sums and integrals they have to evaluate.

Kai: It sounds like the real win here is the empirical formula they found for which representations appear at any level, which is something you can use as a starting point before diving into the full partition function math.

Mira: So, to wrap up this paper on "The growth of SO(nine) super-representations in Type II string theory," it’s about getting a robust counting method that goes way past the initial asymptotic guesses <ref:2609.04107#pg1,The growth of SO(9) super-representations in Type II string theory>. They show that using multiple Rademacher terms gives you good control over the error when you're doing these massive computations.

Lev: And they've clearly shown how to handle the ordinary representations with higher precision, which is important because those are often easier to model than the full super-representations.

Kai: So, for someone listening who only cares about what this means practically, it’s that they have a way to get very accurate numbers for these string theory states at high levels by systematically adding more correction terms.

Mira: It suggests that for counting massive states in string theory, you don't just rely on the leading growth term; you need to account for those sub-leading corrections, and this paper gives you a framework for doing that systematically.

Lev: We’ll see if those techniques translate well when we try to run them on actual error correction hardware later. It shows the theoretical machinery exists, even if it's heavy on computation right now.

Kai: Right, so that’s the picture with this paper—a lot of detailed work to get a solid count and a good asymptotic prediction for these SO nine super-representations in Type II string theory.

The paper's summary: Kai: So, this paper is basically about counting how many different SO nine super-representations exist in Type II and Type I string theories, especially at high energy levels.

Mira: Right, and they’re not just guessing; they’re using a refined partition function to get actual numbers for the multiplicities.

Lev: The method involves looking at this partition function over finite fields up to level five hundred one for individual states, and level two hundred twenty-six for all of them.

Kai: Level five hundred one sounds like a lot of computation; what’s the practical payoff there?

Mira: The payoff is getting very precise counts for the representations themselves, which helps test the leading order theories at lower levels.

Lev: From an error correction standpoint, those high-level counts are crucial because they tell you if your hardware can actually track that many distinct states without losing fidelity.

Kai: And then they derive these asymptotic formulas by integrating around peaks of that partition function; it’s how they predict the general growth pattern for a representation.

Mira: They found a leading growth term, and then they have these second and third Rademacher corrections, which are like fine-tuning adjustments to those initial predictions.

Lev: The correction terms get more complex as you go; they introduce sums over terms with specific powers of a variable that helps refine the approximation.

Kai: They even have tables showing the coefficients for these different representations, so you can see exactly how big each correction term is for something specific like zero zero zero zero.

Mira: The paper shows that including the fourth Rademacher term is actually enough to get pretty close to the true multiplicity for more than thirty levels.

Lev: That’s a big win because it means you don't have to calculate every single correction term if you just need a good estimate at intermediate levels.

Kai: So, what they’re really showing is that this systematic approach—using the refined partition function and these multiple Rademacher terms—gives us a way to get accurate counts where before we only had rough ideas.

Mira: It moves beyond just the big asymptotic growth and gives you tools to track how fast those actual multiplicities are actually growing as you go higher.

Lev: If this method works, it shows us how much control we can exert over these string theory counts when moving from simple approximations to something that’s more physically accurate.

Kai: So, the implication is that for counting superrepresentations in string theory, we have a more robust way to get numbers that aren't just based on the first term of the formula.

Mira: It opens up a new way to predict where these representations are likely to be found in these theories before you even do all the intensive computation.

Lev: We should probably look at how this applies when we try to build error correction systems for N four super Yang-Mills, because that’s the next big step.

The paper's improvements: Tom: So, we’re looking at how these authors suggest they should improve their counting method for SO nine super-representations.

Kai: They’re essentially saying that just having the leading terms isn't enough; you need to include those higher order corrections to get a solid picture.

Mira: Right, and they are suggesting that using the fourth Rademacher term is enough to predict the true multiplicity for more than thirty levels, which is a big step in reliability.

Lev: That means if you’re building hardware to measure these states, you can rely on those predictions for a wide range of energy scales without needing to calculate every single correction term.

Kai: They also pointed out that ordinary representations have a simpler partition function, which allows them to push their counting methods even higher than they did for the general superrepresentations.

Mira: So, they’re giving us two different tools here: one for the full theory and one for the simpler cases, and both are getting more precise with these refinements.

Lev: For running this on real hardware, that means less overhead because you can stop calculating corrections once you hit a certain level of precision.

Kai: It’s about making sure the math we use reflects what actually happens in the string theory without having to do an impossible amount of work.

Mira: The paper also suggests that if we want to get this counting method from scratch, we need a clearer rule or equation, like in table one or equation three point six.

Lev: That would be useful for me because it gives us a concrete roadmap for how to structure the calculation when I start designing the actual error correction routines.

Kai: So these improvements are about making the method more practical and scalable, moving from a very complex calculation to something that’s more usable.

Mira: It shows that even in these massive theoretical counting problems, there are systematic ways to improve the approximation rather than just hoping for a good guess.

Lev: We need those clearer rules so we can actually translate this theory into something we can measure with our current computational limits, which is where the real engineering challenge lies.

Conclusion: Kai: So, to wrap up this paper on "The growth of SO nine super-representations in Type II string theory," they’ve shown how to get very accurate counts using these refined methods and multiple Rademacher terms.

Mira: Exactly, it gives us a systematic way to track the true multiplicity beyond just the initial big growth term.

Lev: And for me, that means we can stop worrying about whether our hardware is sampling enough states if we use these corrections to guide our error correction design.

Kai: It’s about taking this complex counting and making it a tool that helps us understand the actual structure of string theory states more deeply.

Mira: It confirms that even in these high-level theories, the approximations we get from the leading term aren't good enough for serious work without these finer adjustments.

Lev: I just hope this kind of systematic counting translates into something we can actually implement on real error correcting machines later when we move to N four super Yang-Mills.

Kai: That’s the next logical step, trying to see if this counting framework holds up in more complex theories like N four super Yang-Mills.

Mira: It points toward a broader method for handling these massive representations that could apply across different string theories and symmetries.

Lev: I think the main thing here is establishing a clear roadmap for how we should structure the calculation when we start designing those error correction routines.

Kai: So, this paper gives us a lot of heavy lifting in terms of theoretical accuracy and provides a good blueprint for future calculations.

More episodes

← Home