A new proposal for the picture changing operators in the minimal pure spinor formalism

Using a new proposal for the ""picture lowering"" operators, we compute the tree level scattering amplitude in the minimal pure spinor formalism by performing the integration over the pure spinor space as a multidimensional Cauchy-type integral. The amplitude will be written in terms of the projective pure spinor variables, which turns out to be useful to relate rigorously the minimal and non-minimal versions of the pure spinor formalism. The natural language for relating these formalisms is the. Cech-Dolbeault isomorphism. Moreover, the Dolbeault cocycle corresponding to the tree-level scattering amplitude must be evaluated in SO(10)/SU(5) instead of the whole pure spinor space, which means that the origin is removed from this space. Also, the. Cech-Dolbeault language plays a key role for proving the invariance of the scattering amplitude under BRST, Lorentz and supersymmetry transformations, as well as the decoupling of unphysical states. We also relate the Green`s function for the massless scalar field in ten dimensions to the tree-level scattering amplitude and comment about the scattering amplitude at higher orders. In contrast with the traditional picture lowering operators, with our new proposal the tree level scattering amplitude is independent of the constant spinors introduced to define them and the BRST exact terms decouple without integrating over these constant spinors.

The Schenberg data acquisition and analysis: results from its first commissioning run

The Mario Schenberg gravitational wave detector has started its commissioning phase at the Physics Institute of the University of Sao Paulo. We have collected almost 200 h of data from the instrument in order to check out its behavior and performance. We have also been developing a data acquisition system for it under a VXI System. Such a system is composed of an analog-to-digital converter and a GPS receiver for time synchronization. We have been building the software that controls and sets up the data acquisition. Here we present an overview of the Mario Schenberg detector and its data acquisition system, some results from the first commissioning run and solutions for some problems we have identified.

FAST, PARALLEL AND SECURE CRYPTOGRAPHY ALGORITHM USING LORENZ`S ATTRACTOR

A novel cryptography method based on the Lorenz`s attractor chaotic system is presented. The proposed algorithm is secure and fast, making it practical for general use. We introduce the chaotic operation mode, which provides an interaction among the password, message and a chaotic system. It ensures that the algorithm yields a secure codification, even if the nature of the chaotic system is known. The algorithm has been implemented in two versions: one sequential and slow and the other, parallel and fast. Our algorithm assures the integrity of the ciphertext (we know if it has been altered, which is not assured by traditional algorithms) and consequently its authenticity. Numerical experiments are presented, discussed and show the behavior of the method in terms of security and performance. The fast version of the algorithm has a performance comparable to AES, a popular cryptography program used commercially nowadays, but it is more secure, which makes it immediately suitable for general purpose cryptography applications. An internet page has been set up, which enables the readers to test the algorithm and also to try to break into the cipher.

Seeking for simplicity in complex networks

Complex networks can be understood as graphs whose connectivity properties deviate from those of regular or near-regular graphs, which are understood as being ""simple"". While a great deal of the attention so far dedicated to complex networks has been duly driven by the ""complex"" nature of these structures, in this work we address the identification of their simplicity. The basic idea is to seek for subgraphs whose nodes exhibit similar measurements. This approach paves the way for complementing the characterization of networks, including results suggesting that the protein-protein interaction networks, and to a lesser extent also the Internet, may be getting simpler over time. Copyright (C) EPLA, 2009

Spontaneous recoherence of quantum states after decoherence

In this work, we identify the set of time-dependent pure states building the statistical mixture to which a system, initially in a pure state, is driven by the reservoir. This set of time-dependent pure states, composing what we term a pure basis, are those that diagonalize the reduced density operator of the system. Next, we show that the evolution of the pure-basis states reveals an interesting phenomenon as the system, after decoherence, evolves toward the equilibrium: the spontaneous recoherence of quantum states. Around our defined recoherence time, the statistical mixture associated with a special kind of initial states termed even-symmetric, spontaneously undergoes a recoherence process, by which the initial state of the system emerges from the mixture except for its reduced excitation drained into the reservoir. This phenomenon reveals that the reservoir only shuffle the original information carried out by the initial state of the system instead of erasing it. Moreover, as the spontaneously recohered state occurs only for asymptotic time, we also present a protocol to extract it from the mixture through specific projective measurements. The password to retrieve the original information stems is the knowledge of both the initial state itself and the associated pure basis. A definition of the decoherence time of an N-state superposition is also presented.

Symmetry breaking in the genetic code: Finite groups

We investigate the possibility of interpreting the degeneracy of the genetic code, i.e., the feature that different codons (base triplets) of DNA are transcribed into the same amino acid, as the result of a symmetry breaking process, in the context of finite groups. In the first part of this paper, we give the complete list of all codon representations (64-dimensional irreducible representations) of simple finite groups and their satellites (central extensions and extensions by outer automorphisms). In the second part, we analyze the branching rules for the codon representations found in the first part by computational methods, using a software package for computational group theory. The final result is a complete classification of the possible schemes, based on finite simple groups, that reproduce the multiplet structure of the genetic code. (C) 2010 Elsevier Ltd. All rights reserved.

On moduli spaces for abelian categories

We show that if A is an abelian category satisfying certain mild conditions, then one can introduce the concept of a moduli space of (semi)stable objects which has the structure of a projective algebraic variety. This idea is applied to several important abelian categories in representation theory, like highest weight categories.

REALIZING PROFINITE REDUCED SPECIAL GROUPS

Special groups are an axiomatization of the algebraic theory of quadratic forms over fields. It is known that any finite reduced special group is the special group of some field. We show that any special group that is the projective limit of a projective system of finite reduced special groups is also the special group of some field.

d-Koszul algebras, 2-d-determined algebras and 2-d-Koszul algebras

The relationship between an algebra and its associated monomial algebra is investigated when at least one of the algebras is d-Koszul It is shown that an algebra which has a reduced Grobnerbasis that is composed of homogeneous elements of degree d is d-Koszul if and only if its associated monomial algebra is d-Koszul The class of 2-d-determined algebras and the class 2-d-Koszul algebras are introduced In particular it is shown that 2-d-determined monomial algebras are 2-d-Koszul algebras and the structure of the ideal of relations of such an algebra is completely determined (C) 2010 Elsevier B V All rights reserved

Coincidence Wecken homotopies versus Wecken homotopies relative to a fixed homotopy in one of the maps

We study the 1-parameter Wecken problem versus the restricted Wecken problem, for coincidence free pairs of maps between surfaces. For this we use properties of the function space between two surfaces and of the pure braid group on two strings of a surface. When the target surface is either the 2-sphere or the torus it is known that the two problems are the same. We classify most pairs of homotopy classes of maps according to the answer of the two problems are either the same or different when the target is either projective space or the Klein bottle. Some partial results are given for surfaces of negative Euler characteristic. (C) 2010 Elsevier B.V. All rights reserved.

On the Relative Socle for Stratifying Systems

Let A be a finite dimensional k-algebra, (, ) be a stratifying system in mod(A) and F() be the class of -filtered A-modules. In this article, we give the definition and also study some of the properties of the relative socle in F(). We approach the relative socle in three ways. Namely, we view it as (1) a -semisimple subobject of M having the largest -length, (2) a maximal -semisimple subobject of M, and (3) a minimal -essential subobject of M.

NONSTATIONARY MIXING AND THE UNIQUE ERGODICITY OF ADIC TRANSFORMATIONS

We define topological and measure-theoretic mixing for nonstationary dynamical systems and prove that for a nonstationary subshift of finite type, topological mixing implies the minimality of any adic transformation defined on the edge space, while if the Parry measure sequence is mixing, the adic transformation is uniquely ergodic. We also show this measure theoretic mixing is equivalent to weak ergodicity of the edge matrices in the sense of inhomogeneous Markov chain theory.