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)

Conformal compensators and manifest type IIB S-duality

Using the conformal compensator superfields of N = 2 D = 4 supergravity, the Type IIB S-duality transformations are expressed as a linear rotation which mixes the compensator and matter superfields. The classical superspace action for D = 4 compactifications of Type IIB supergravity is manifestly invariant under this transformation. Furthermore, the introduction of conformal compensators allows a Fradkin-Tseytlin term to be added to the manifestly SL(2,Z)-covariant sigma model action of Townsend and Cederwall. © 1998 Published by Elsevier Science B.V.

Encoding through generalized polynomial codes

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

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.

Controllability and stabilizability of linear time-varying distributed hereditary control systems

This paper is concerned with the controllability and stabilizability problem for control systems described by a time-varyinglinear abstract differential equation with distributed delay in the state variables. An approximate controllability propertyis established, and for periodic systems, the stabilization problem is studied. Assuming that the semigroup of operatorsassociated with the uncontrolled and non delayed equation is compact, and using the characterization of the asymptoticstability in terms of the spectrum of the monodromy operator of the uncontrolled system, it is shown that the approximatecontrollability property is a sufficient condition for the existence of a periodic feedback control law that stabilizes thesystem. The result is extended to include some systems which are asymptotically periodic. Copyright © 2014 John Wiley &Sons, Ltd.

On a class of abstract neutral functional differential equations

By using the theory of semigroups of growth α, we discuss the existence of mild solutions for a class of abstract neutral functional differential equations. A concrete application to partial neutral functional differential equations is considered.