572 resultados para semigroup algebras


Relevância:

10.00% 10.00%

Publicador:

Resumo:

Implicit ODE, cubic in derivative, generically has no infinitesimal symmetries even at regular points with distinct roots. Cartan showed that at regular points, ODEs with hexagonal 3-web of solutions have symmetry algebras of the maximal possible dimension 3. At singular points such a web can lose all its symmetries. In this paper we study hexagonal 3-webs having at least one infinitesimal symmetry at singular points. In particular, we establish sufficient conditions for the existence of non-trivial symmetries and show that under natural assumptions such a symmetry is semi-simple, i.e. is a scaling in some coordinates. Using the obtained results, we provide a complete classification of hexagonal singular 3-web germs in the complex plane, satisfying the following two conditions: 1) the Chern connection form is holomorphic at the singular point, 2) the web admits at least one infinitesimal symmetry at this point. As a by-product, a classification of hexagonal weighted homogeneous 3-webs is obtained.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

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$.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

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.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

In this paper we show that the quaternion orders OZ[ √ 2] ≃ ( √ 2, −1)Z[ √ 2] and OZ[ √ 3] ≃ (3 + 2√ 3, −1)Z[ √ 3], appearing in problems related to the coding theory [4], [3], are not maximal orders in the quaternion algebras AQ( √ 2) ≃ ( √ 2, −1)Q( √ 2) and AQ( √ 3) ≃ (3 + 2√ 3, −1)Q( √ 3), respectively. Furthermore, we identify the maximal orders containing these orders.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

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.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

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.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

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}$.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

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

Relevância:

10.00% 10.00%

Publicador:

Resumo:

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

Relevância:

10.00% 10.00%

Publicador:

Resumo:

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

Relevância:

10.00% 10.00%

Publicador:

Resumo:

A simple description of the KP hierarchy and its multi-hamiltonian structure is given in terms of two Bose currents. A deformation scheme connecting various W-infinity algebras and the relation between two fundamental nonlinear structures are discussed. Properties of Faá di Bruno polynomials are extensively explored in this construction. Applications of our method are given for the Conformal Affine Toda model, WZNW models and discrete KP approach to Toda lattice chain.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Recently Lukierski et al. [1] defined a κ-deformed Poincaré algebra which is characterized by having the energy-momentum and angular momentum sub-algebras not deformed. Further Biedenharn et al. [2] showed that on gauging the κ-deformed electron with the electromagnetic field, one can set a limit on the allowed value of the deformation parameter ∈ ≡ 1/κ < 1 fm. We show that one gets Regge like angular excitations, J, of the mesons, non-strange and strange baryons, with a value of ∈ ∼ 0.082 fm and predict a flattening with J of the corresponding trajectories. The Regge fit improves on including deformation, particularly for the baryon spectrum.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Pós-graduação em Matemática em Rede Nacional - IBILCE