1,163 research outputs found

    Near Flat Space limit of strings on AdS_4 x CP^3

    Full text link
    The non-linear nature of string theory on non-trivial backgrounds related to the AdS/CFT correspondence suggests to look for simplifications. Two such simplifications proved to be useful in studying string theory. These are the pp-wave limit which describes point-like strings and the so called "near flat space" limit which connects two different sectors of string theory -- pp-waves and "giant magnons". Recently another example of AdS/CFT duality emerged - AdS4/CFT3AdS_4/CFT_3, which suggests duality between N=6\mathcal N=6 CS theory and superstring theory on AdS_4\times \cp. In this paper we study the "near flat space" limit of strings on the AdS_4\times \cp background and discuss possible applications of the reduced theory.Comment: 20 pages, typos corrected, references adde

    A note on strings in deformed AdS_4 x CP3: giant magnon and single spike solutions

    Full text link
    In this paper we study the solitonic string solutions of magnon and single spike type in the beta-deformed AdS_4 x CP3 background. We find the dispersion relations which are supposed to give the anomalous dimension of the gauge theory operators.Comment: 11 pages, no figures, writings improved, references adde

    On semiclassical calculation of three-point functions in AdS_5 \times T^(1,1)

    Full text link
    Recently there has been progress on the computation of two- and three-point correlation functions with two "heavy" states via semiclassical methods. We extend this analysis to the case of AdS_5 \times T^(1,1), and examine the suggested procedure for the case of several simple string solutions. By making use of AdS/CFT duality, we derive the relevant correlation functions of operators belonging to the dual gauge theory.Comment: 18 pages, added referenc

    Exploiting Term Hiding to Reduce Run-time Checking Overhead

    Full text link
    One of the most attractive features of untyped languages is the flexibility in term creation and manipulation. However, with such power comes the responsibility of ensuring the correctness of these operations. A solution is adding run-time checks to the program via assertions, but this can introduce overheads that are in many cases impractical. While static analysis can greatly reduce such overheads, the gains depend strongly on the quality of the information inferred. Reusable libraries, i.e., library modules that are pre-compiled independently of the client, pose special challenges in this context. We propose a technique which takes advantage of module systems which can hide a selected set of functor symbols to significantly enrich the shape information that can be inferred for reusable libraries, as well as an improved run-time checking approach that leverages the proposed mechanisms to achieve large reductions in overhead, closer to those of static languages, even in the reusable-library context. While the approach is general and system-independent, we present it for concreteness in the context of the Ciao assertion language and combined static/dynamic checking framework. Our method maintains the full expressiveness of the assertion language in this context. In contrast to other approaches it does not introduce the need to switch the language to a (static) type system, which is known to change the semantics in languages like Prolog. We also study the approach experimentally and evaluate the overhead reduction achieved in the run-time checks.Comment: 26 pages, 10 figures, 2 tables; an extension of the paper version accepted to PADL'18 (includes proofs, extra figures and examples omitted due to space reasons

    On the worldsheet theory of the type IIA AdS(4) x CP(3) superstring

    Full text link
    We perform a detailed study of the type IIA superstring in AdS(4) x CP(3). After introducing suitable bosonic light-cone and fermionic kappa worldsheet gauges we derive the pure boson and fermion SU(2|2) x U(1) covariant light-cone Hamiltonian up to quartic order in fields. As a first application of our derivation we calculate energy shifts for string configurations in a closed fermionic subsector and successfully match these with a set of light-cone Bethe equations. We then turn to investigate the mismatch between the degrees of freedom of scattering states and oscillatory string modes. Since only light string modes appear as fundamental Bethe roots in the scattering theory, the physical role of the remaining 4F+4B4_F+4_B massive oscillators is rather unclear. By continuing a line of research initiated by Zarembo, we shed light on this question by calculating quantum corrections for the propagators of the bosonic massive fields. We show that, once loop corrections are incorporated, the massive coordinates dissolve in a continuum state of two light particles.Comment: 40 pages, 2 figures. v3: Minor clarifications made and reference list updated. Published version

    A Fully Verified Executable LTL Model Checker

    Get PDF
    International audienceWe present an LTL model checker whose code has been completely verified using the Isabelle theorem prover. The checker consists of over 4000 lines of ML code. The code is produced using recent Isabelle technology called the Refinement Framework, which allows us to split its correctness proof into (1) the proof of an abstract version of the checker, consisting of a few hundred lines of “formalized pseudocode”, and (2) a verified refinement step in which mathematical sets and other abstract structures are replaced by implementations of efficient structures like red-black trees and functional arrays. This leads to a checker that, while still slower than unverified checkers, can already be used as a trusted reference implementation against which advanced implementations can be tested. We report on the structure of the checker, the development process, and some experiments on standard benchmarks
    corecore