A homological version of the implicit function theorem

Our objective in this paper is to prove an Implicit Function Theorem for general topological spaces. As a consequence, we show that, under certain conditions, the set of the invertible elements of a topological monoid X is an open topological group in X and we use the classical topological group theory to conclude that this set is a Lie group.

A Transmission Problem for Euler-Bernoulli beam with Kelvin-Voigt Damping

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

A note on the superstring BRST operator

We write the BRST operator of the N = 1 superstring as, Q = e-R(1/2πiφdzγ2b)eR where y and b are super-reparameterization ghosts. This provides a trivial proof that Q is nilpotent. © 1999 Published by Elsevier Science B.V. All rights reserved.

Towards covariant quantization of the supermembrane

By replacing ten-dimensional pure spinors with eleven-dimensional pure spinors, the formalism recently developed for covariantly quantizing the d = 10 superparticle and superstring is extended to the d = 11 superparticle and supermembrane. In this formalism, kappa symmetry is replaced by a BRST-like invariance using the nilpotent operator Q = ∮ λ αdα where dα is the worldvolume variable corresponding to the d = 11 spacetime supersymmetric derivative and λα is an SO(10, 1) pure spinor variable satisfying λΓcλ = 0 for c = 1 to 11. Super-Poincaré covariant unintegrated and integrated supermembrane vertex operators are explicitly constructed which are in the cohomology of Q. After double-dimensional reduction of the eleventh dimension, these vertex operators are related to type-IIA superstring vertex operators where Q = QL + QR is the sum of the left and right-moving type-IIA BRST operators and the eleventh component of the pure spinor constraint, λΓ 11λ = 0, replaces the bL 0 - b R 0 constraint of the closed superstring. A conjecture is made for the computation of M-theory scattering amplitudes using these supermembrane vertex operators. © SISSA/ISAS 2002.

On the existence and stability of periodic orbits in non ideal problems: General results

In this work, motivated by non-ideal mechanical systems, we investigate the following O.D.E. ẋ = f (x) + εg (x, t) + ε2g (x, t, ε), where x ∈ Ω ⊂ ℝn, g, g are T periodic functions of t and there is a 0 ∈ Ω such that f (a 0) = 0 and f′ (a0) is a nilpotent matrix. When n = 3 and f (x) = (0, q (x 3) , 0) we get results on existence and stability of periodic orbits. We apply these results in a non ideal mechanical system: the Centrifugal Vibrator. We make a stability analysis of this dynamical system and get a characterization of the Sommerfeld Effect as a bifurcation of periodic orbits. © 2007 Birkhäuser Verlag, Basel.

Encoding through generalized polynomial codes

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

Nilpotency of the b ghost in the non-minimal pure spinor formalism

The b ghost in the non-minimal pure spinor formalism is not a fundamental field. It is based on a complicated chain of operators and proving its nilpotency is nontrivial. Chandia proved this property in arXiv:1008.1778, but with an assumption on the nonminimal variables that is not valid in general. In this work, the b ghost is demonstrated to be nilpotent without this assumption. © 2013 SISSA, Trieste, Italy.

A method for improving the code rate and error correction capability of a cyclic code

Currently, there has been an increasing demand for operational and trustworthy digital data transmission and storage systems. This demand has been augmented by the appearance of large-scale, high-speed data networks for the exchange, processing and storage of digital information in the different spheres. In this paper, we explore a way to achieve this goal. For given positive integers n,r, we establish that corresponding to a binary cyclic code C0[n,n-r], there is a binary cyclic code C[(n+1)3k-1,(n+1)3k-1-3kr], where k is a nonnegative integer, which plays a role in enhancing code rate and error correction capability. In the given scheme, the new code C is in fact responsible to carry data transmitted by C0. Consequently, a codeword of the code C0 can be encoded by the generator matrix of C and therefore this arrangement for transferring data offers a safe and swift mode. © 2013 SBMAC - Sociedade Brasileira de Matemática Aplicada e Computacional.

A semigroups theory approach to a model of suspension bridges

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

Semigrupos de operadores lineares aplicados às equações diferenciais parciais

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

Análise de estabilidade de sistemas dinâmicos híbridos e descontínuos modelados por semigrupos:

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

Existência de soluções para equações integrodiferenciais em epaços de Banach

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

Goppa codes through polynomials of B[X;(1/2^2)Z_0] and its decoding principle

In this paper, we present a decoding principle for Goppa codes constructed by generalized polynomials, which is based on modified Berlekamp-Massey algorithm. This algorithm corrects all errors up to the Hamming weight $t\leq 2r$, i.e., whose minimum Hamming distance is $2^{2}r+1$.

Goppa codes over certain semigroups

A Goppa code is described in terms of a polynomial, known as Goppa polynomial, and in contrast to cyclic codes, where it is difficult to estimate the minimum Hamming distance d from the generator polynomial. Furthermore, a Goppa code has the property that d ≥ deg(h(X))+1, where h(X) is a Goppa polynomial. In this paper, we present a decoding principle for Goppa codes constructed by generalized polynomials, which is based on modified Berlekamp-Massey algorithm.