An integrable deformation of the AdS(5) x S-5 superstring

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Open-closed superstring amplitudes using vertex operators in AdS5xS5

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Twistor origin of the superstring

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Open-closed superstring amplitudes using vertex operators in AdS(5) x S-5

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Infinite tension limit of the pure spinor superstring

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Spectrum generating algebra for the pure spinor superstring

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Superstring theory on AdS2 × S2 as a coset supermanifold

We quantize the superstring on the AdS2 × S2 background with Ramond-Ramond flux using a PSU(1,1\2)/U(1) × U(1) sigma model with a WZ term. One-loop conformal invariance of the model is guaranteed by a general mechanism which holds for coset spaces G/H where G is Ricci-flat and H is the invariant locus of a ℤ4 automorphism of G. This mechanism gives conformal theories for the PSU(1,1\2) × PSU(2\2)/SU(2) × SU(2) and PSU(2,2\4)/SO(4,1) × SO(5) coset spaces, suggesting our results might be useful for quantizing the superstring on AdS3 × S3 and AdS5 × S5 backgrounds. © 2000 Elsevier Science B.V. All rights reserved.

Problem with the superstring action of Deriglazov and Galajinsky

Deriglazov and Galajinsky have recently proposed a new covariant action for the Green-Schwarz superstring which can be constructed in any spacetime dimension. In this Comment, I show that their action contains extra on-shell degrees of freedom as compared with the standard action and is therefore inequivalent. ©1999 The American Physical Society.

Pure spinor superstring partition function

Pós-graduação em Física - IFT

Twistor-like constraints for the superparticle and the superstring

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Twistor-like constraints for the superparticle and the superstring

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Multibrane solutions in cubic superstring field theory

Using the elements of the so-called KBc gamma subalgebra, we study a class of analytic solutions depending on a single function F(K) in the modified cubic superstring field theory. We compute the energy associated to these solutions and show that the result can be expressed in terms of a contour integral. For a particular choice of the function F(K), we show that the energy is given by integer multiples of a single D-brane tension.

Superstring: A scalable service discovery protocol for the wide-area pervasive environment

Arguably, the world has become one large pervasive computing environment. Our planet is growing a digital skin of a wide array of sensors, hand-held computers, mobile phones, laptops, web services and publicly accessible web-cams. Often, these devices and services are deployed in groups, forming small communities of interacting devices. Service discovery protocols allow processes executing on each device to discover services offered by other devices within the community. These communities can be linked together to form a wide-area pervasive environment, allowing processes in one p u p tu interact with services in another. However, the costs of communication and the protocols by which this communication is mediated in the wide-area differ from those of intra-group, or local-area, communication. Communication is an expensive operation for small, battery powered devices, but it is less expensive for servem and workstations, which have a constant power supply and 81'e connected to high bandwidth networks. This paper introduces Superstring, a peer to-peer service discovery protocol optimised fur use in the wide-area. Its goals are to minimise computation and memory overhead in the face of large numbers of resources. It achieves this memory and computation scalability by distributing the storage cost of service descriptions and the computation cost of queries over multiple resolvers.