The Virasoro-Shapiro amplitude in AdS5 × S5 and level splitting of 10d conformal symmetry

The genus zero contribution to the four-point correlator $$ \left\langle {\mathcal{O}}_{p_1}{\mathcal{O}}_{p_2}{\mathcal{O}}_{p_3}{\mathcal{O}}_{p_4}\right\rangle $$ O p 1 O p 2 O p 3 O p 4 of half-BPS single-particle operators $$ {\mathcal{O}}_p $$ O p in $$ \mathcal{N} $$ N = 4 super Yang-Mills, at strong coupling, computes the Virasoro-Shapiro amplitude of closed superstrings in AdS5× S5. Combining Mellin space techniques, the large p limit, and data about the spectrum of two-particle operators at tree level in supergravity, we design a bootstrap algorithm which heavily constrains its α′ expansion. We use crossing symmetry, polynomiality in the Mellin variables and the large p limit to stratify the Virasoro-Shapiro amplitude away from the ten-dimensional flat space limit. Then we analyse the spectrum of exchanged two-particle operators at fixed order in the α′ expansion. We impose that the ten-dimensional spin of the spectrum visible at that order is bounded above in the same way as in the flat space amplitude. This constraint determines the Virasoro-Shapiro amplitude in AdS5× S5 up to a small number of ambiguities at each order. We compute it explicitly for (α′)5,6,7,8,9. As the order of α′ grows, the ten dimensional spin grows, and the set of visible two-particle operators opens up. Operators illuminated for the first time receive a string correction to their anomalous dimensions which is uniquely determined and lifts the residual degeneracy of tree level supergravity, due to ten-dimensional conformal symmetry. We encode the lifting of the residual degeneracy in a characteristic polynomial. This object carries information about all orders in α′. It is analytic in the quantum numbers, symmetric under an AdS5 ↔ S5 exchange, and it enjoys intriguing properties, which we explain and detail in various cases.

Linear space string correction algorithm using the Damerau-Levenshtein distance

Background The Damerau-Levenshtein (DL) distance metric has been widely used in the biological science. It tries to identify the similar region of DNA,RNA and protein sequences by transforming one sequence to the another using the substitution, insertion, deletion and transposition operations. Lowrance and Wagner have developed an O(mn) time O(mn) space algorithm to find the minimum cost edit sequence between strings of length m and n, respectively. In our previous research, we have developed algorithms that run in O(mn) time using only O(s∗min{m,n}+m+n) space, where s is the size of the alphabet comprising the strings, to compute the DL distance as well as the corresponding edit sequence. These are so far the fastest and most space efficient algorithms. In this paper, we focus on the development of algorithms whose asymptotic space complexity is linear. Results We develop linear space algorithms to compute the Damerau-Levenshtein (DL) distance between two strings and determine the optimal trace (corresponding edit operations.)Extensive experiments conducted on three computational platforms–Xeon E5 2603, I7-x980 and Xeon E5 2695–show that, our algorithms, in addition to using less space, are much faster than earlier algorithms. Conclusion Besides using less space than the previously known algorithms,significant run-time improvement was seen for our new algorithms on all three of our experimental platforms. On all platforms, our linear-space cache-efficient algorithms reduced run time by as much as 56.4% and 57.4% in respect to compute the DL distance and an optimal edit sequences compared to previous algorithms. Our multi-core algorithms reduced the run time by up to 59.3% compared to the best previously known multi-core algorithms.

Infinity in string cosmology: A review through open problems

We review recent developments in the field of string cosmology with particular emphasis on open problems having to do mainly with geometric asymptotics and singularities. We discuss outstanding issues in a variety of currently popular themes, such as tree-level string cosmology asymptotics, higher-order string correction effects, M-theory cosmology, braneworlds and finally ambient cosmology.

FINDING MANY OPTIMAL PATHS WITHOUT GROWING ANY OPTIMAL PATH TREES

Many algorithms for applications such as pattern recognition, computer vision, and computer graphics seek to compute actual optimal paths in weighted directed graphs. The standard approach for reporting an actual optimal path is based on building a single-source optimal path tree. A technique by Chen et al.2 was given for a class of problems such that a single actual optimal path can be reported without maintaining any single-source optimal path tree, thus significantly reducing the space bound of those problems with no or little increase in their running time. In this paper, we extend the technique by Chen et al.2 to the generalized problem of reporting many actual optimal paths with different starting and ending vertices in certain directed graphs, and show how this new technique yields improved results on several application problems, such as reconstructing a 3-D surface band bounded by two simple closed curves, finding various constrained segmentation of 2-D medical images, and circular string-to-string correction. We also correct an error in the time/space complexity for the well-cited circular string-to-string correction algorithm12 and give an improved result for this problem. Although the generalized many-path problem seems more difficult than the single-path cases, our algorithms have nearly the same space and time bounds as those of the single-path cases. Our technique is likely to help improve many other optimal paths or dynamic programming algorithms.

COSMOLOGICAL PERTURBATIONS IN GENERALIZED GRAVITY THEORIES

We present cosmological perturbation theory based on generalized gravity theories including string correction terms as well as a tachyonic complication. The classical evolution as well as the quantum generation processes in these variety of gravity theories are presented in unified forms. These apply both to the scalar- and tensor-type perturbations.