Reversibility properties of semigroup actions on homogeneous spaces

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

Constructions of codes through the semigroup ring B[X; 1/2(2)Z(0)] and encoding

For any finite commutative ring B with an identity there is a strict inclusion B[X; Z(0)] subset of B[X; Z(0)] subset of B[X; 1/2(2)Z(0)] of commutative semigroup rings. This work is a continuation of Shah et al. (2011) [8], in which we extend the study of Andrade and Palazzo (2005) [7] for cyclic codes through the semigroup ring B[X; 1/2; Z(0)] In this study we developed a construction technique of cyclic codes through a semigroup ring B[X; 1/2(2)Z(0)] instead of a polynomial ring. However in the second phase we independently considered BCH, alternant, Goppa, Srivastava codes through a semigroup ring B[X; 1/2(2)Z(0)]. Hence we improved several results of Shah et al. (2011) [8] and Andrade and Palazzo (2005) [7] in a broader sense. Published by Elsevier Ltd

A Note on Linear Codes over Semigroup Rings

In this paper, we introduced new construction techniques of BCH, alternant, Goppa, Srivastava codes through the semigroup ring B[X; 1 3Z0] instead of the polynomial ring B[X; Z0], where B is a finite commutative ring with identity, and for these constructions we improve the several results of [1]. After this, we present a decoding principle for BCH, alternant and Goppa codes which is based on modified Berlekamp-Massey algorithm. This algorithm corrects all errors up to the Hamming weight t ≤ r/2, i.e., whose minimum Hamming distance is r + 1.

Dynamic Morse decompositions for semigroups of homeomorphisms and control systems

In this paper, we introduce the concept of dynamic Morse decomposition for an action of a semigroup of homeomorphisms. Conley has shown in [5, Sec. 7] that the concepts of Morse decomposition and dynamic Morse decompositions are equivalent for flows in metric spaces. Here, we show that a Morse decomposition for an action of a semigroup of homeomorphisms of a compact topological space is a dynamic Morse decomposition. We also define Morse decompositions and dynamic Morse decompositions for control systems on manifolds. Under certain condition, we show that the concept of dynamic Morse decomposition for control system is equivalent to the concept of Morse decomposition.

CYCLIC CODES THROUGH B[X], B[X; 1/kp Z(0)] and B[X; 1/p(k) Z(0)]: A COMPARISON

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

LOSS of EXPONENTIAL STABILITY FOR A THERMOELASTIC SYSTEM WITH MEMORY

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

Uniform exponential dichotomy and continuity of attractors for singularly perturbed damped wave equations

For eta >= 0, we consider a family of damped wave equations u(u) + eta Lambda 1/2u(t) + au(t) + Lambda u = f(u), t > 0, x is an element of Omega subset of R-N, where -Lambda denotes the Laplacian with zero Dirichlet boundary condition in L-2(Omega). For a dissipative nonlinearity f satisfying a suitable growth restrictions these equations define on the phase space H-0(1)(Omega) x L-2(Omega) semigroups {T-eta(t) : t >= 0} which have global attractors A(eta) eta >= 0. We show that the family {A(eta)}(eta >= 0), behaves upper and lower semi-continuously as the parameter eta tends to 0(+).

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)

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)