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.

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.

A decoding procedure which improves code rate and error corrections

Corresponding to $C_{0}[n,n-r]$, a binary cyclic code generated by a primitive irreducible polynomial $p(X)\in \mathbb{F}_{2}[X]$ of degree $r=2b$, where $b\in \mathbb{Z}^{+}$, we can constitute a binary cyclic code $C[(n+1)^{3^{k}}-1,(n+1)^{3^{k}}-1-3^{k}r]$, which is generated by primitive irreducible generalized polynomial $p(X^{\frac{1}{3^{k}}})\in \mathbb{F}_{2}[X;\frac{1}{3^{k}}\mathbb{Z}_{0}]$ with degree $3^{k}r$, where $k\in \mathbb{Z}^{+}$. This new code $C$ improves the code rate and has error corrections capability higher than $C_{0}$. The purpose of this study is to establish a decoding procedure for $C_{0}$ by using $C$ in such a way that one can obtain an improved code rate and error-correcting capabilities for $C_{0}$.