Bubbling AdS3

In the light of the recent Lin, Lunin, Maldacena (LLM) results we investigate 1/2-BPS geometries in minimal (and next-to minimal) supergravity in D=6 dimensions. In the case of minimal supergravity, solutions are given by fibrations of a two-torus T^2 specified by two harmonic functions. For a rectangular torus the two functions are related by a non-linear equation with rare solutions: AdS_3x S^3, the pp-wave and the multi-center string. ``Bubbling'', i.e. superpositions of droplets, is accommodated by allowing the complex structure of the T^2 to vary over the base. The analysis is repeated in the presence of a tensor multiplet and similar conclusions are reached with generic solutions describing D1D5 (or their dual fundamental string-momentum) systems. In this framework, the profile of the dual fundamental string-momentum system is identified with the boundaries of the droplets in a two-dimensional plane.Comment: 20 pages, 4 figures. v3: Minor corrections in section 2.

RG-flows and Open/Closed String Duality

We discuss the interpaly between IR and UV divergences in theories with open and unoriented strings in view of the AdS/CFT correspondence. We start by deriving general formulas for the computation of threshold corrections to gauge couplings in generic configurations with open and unoriented strings. These allow us to discuss the IR/UV correspondence between beta-function coefficients and ``dilaton'' tadpoles for several brane configurations probed by D3-branes. Finally we comment on the AdS supergravity descriptions of gauge theories that are (super)conformal in the large N limit.Comment: Minor corrections. References added. Version to be published in JHEP08(2000)035. 22 pages, Late

Anomalies & Tadpoles

We show that massless RR tadpoles in vacuum configurations with open and unoriented strings are always related to anomalies. RR tadpoles arising from sectors of the internal SCFT with non-vanishing Witten index are in one-to-one correspondence with conventional irreducible anomalies. The anomalous content of the remaining RR tadpoles can be disclosed by considering anomalous amplitudes with higher numbers of external legs. We then provide an explicit parametrization of the anomaly polynomial in terms of the boundary reflection coefficients, i.e. one-point functions of massless RR fields on the disk. After factorization of the reducible anomaly, we extract the relevant WZ couplings in the effective lagrangians.Comment: 20 pages, Late

On stringy AdS_5 x S^5 and higher spin holography

We derive the spectrum of Kaluza-Klein descendants of string excitations on AdS_5 x S^5. String states are organized in long multiplets of the AdS supergroup SU(2,2|4,R) with a rich pattern of shortenings at the higher spin enhancement point \lambda=0. The string states holographically dual to the higher spin currents of SYM theory in the strict zero coupling limit are identified together with the corresponding Goldstone particles responsible for the Higgsing of the higher spin symmetry at \lambda\neq 0. Exploiting higher spin symmetry we propose a very simple yet effective mass formula and establish a one-to-one correspondence between the complete spectrum of \Delta_0 <= 4 string states and relevant/marginal single-trace deformations in N=4 SYM theory at large N. To this end, we describe how to efficiently enumerate scaling operators in `free' YM theory, with the inclusion of fermionic `letters', by resorting to Polya theory. Comparison between the spectra of 1/4-BPS states is also presented. Finally, we discuss how to organize the spectrum of N=4 SYM theory in SU(2,2|4,R) supermultiplets by means of some kind of `Eratostenes's sieve'.Comment: 38 pages, LateX2e, references adde

Description and Optimization of Abstract Machines in a Dialect of Prolog

In order to achieve competitive performance, abstract machines for Prolog and related languages end up being large and intricate, and incorporate sophisticated optimizations, both at the design and at the implementation levels. At the same time, efficiency considerations make it necessary to use low-level languages in their implementation. This makes them laborious to code, optimize, and, especially, maintain and extend. Writing the abstract machine (and ancillary code) in a higher-level language can help tame this inherent complexity. We show how the semantics of most basic components of an efficient virtual machine for Prolog can be described using (a variant of) Prolog. These descriptions are then compiled to C and assembled to build a complete bytecode emulator. Thanks to the high level of the language used and its closeness to Prolog, the abstract machine description can be manipulated using standard Prolog compilation and optimization techniques with relative ease. We also show how, by applying program transformations selectively, we obtain abstract machine implementations whose performance can match and even exceed that of state-of-the-art, highly-tuned, hand-crafted emulators.Comment: 56 pages, 46 figures, 5 tables, To appear in Theory and Practice of Logic Programming (TPLP

Exotic prepotentials from D(-1)D7 dynamics

We compute the partition functions of D(-1)D7 systems describing the multi-instanton dynamics of SO(N) gauge theories in eight dimensions. This is the simplest instance of the so called exotic instantons. In analogy with the Seiberg-Witten theory in four space-time dimensions, the prepotential and correlators in the chiral ring are derived via localization formulas and found to satisfy relations of the Matone type. Exotic prepotentials of SO(N) gauge theories with N=2 supersymmetries in four-dimensions are also discussed.Comment: 19 page

Incremental and Modular Context-sensitive Analysis

Context-sensitive global analysis of large code bases can be expensive, which can make its use impractical during software development. However, there are many situations in which modifications are small and isolated within a few components, and it is desirable to reuse as much as possible previous analysis results. This has been achieved to date through incremental global analysis fixpoint algorithms that achieve cost reductions at fine levels of granularity, such as changes in program lines. However, these fine-grained techniques are not directly applicable to modular programs, nor are they designed to take advantage of modular structures. This paper describes, implements, and evaluates an algorithm that performs efficient context-sensitive analysis incrementally on modular partitions of programs. The experimental results show that the proposed modular algorithm shows significant improvements, in both time and memory consumption, when compared to existing non-modular, fine-grain incremental analysis techniques. Furthermore, thanks to the proposed inter-modular propagation of analysis information, our algorithm also outperforms traditional modular analysis even when analyzing from scratch.Comment: 56 pages, 27 figures. To be published in Theory and Practice of Logic Programming. v3 corresponds to the extended version of the ICLP2018 Technical Communication. v4 is the revised version submitted to Theory and Practice of Logic Programming. v5 (this one) is the final author version to be published in TPL