997 resultados para Commutative Ring Theory
Resumo:
In this paper, we investigate effect algebras and base normed spaces from the categorical point of view. We prove that the category of effect algebras is complete and cocomplete as well as the category of base normed spaces is complete, and discuss the contravariant functor from the category of effect algebras to the category of base normed spaces.
Resumo:
Let I be an ideal in a local Cohen-Macaulay ring (A, m). Assume I to be generically a complete intersection of positive height. We compute the depth of the Rees algebra and the form ring of I when the analytic deviation of I equals one and its reduction number is also at most one. The formu- las we obtain coincide with the already known formulas for almost complete intersection ideals.
Resumo:
Let epsilon be a commutative ring with identity and P is an element of epsilon[x] be a polynomial. In the present paper we consider digit representations in the residue class ring epsilon[x]/(P). In particular, we are interested in the question whether each A is an element of epsilon[x]/(P) can be represented modulo P in the form e(0)+ e(1)x + ... + e(h)x(h), where the e(i) is an element of epsilon[x]/(P) are taken from a fixed finite set of digits. This general concept generalizes both canonical number systems and digit systems over finite fields. Due to the fact that we do not assume that 0 is an element of the digit set and that P need not be monic, several new phenomena occur in this context.
Resumo:
Grobner bases have been generalised to polynomials over a commutative ring A in several ways. Here we focus on strong Grobner bases, also known as D-bases. Several authors have shown that strong Grobner bases can be effectively constructed over a principal ideal domain. We show that this extends to any principal ideal ring. We characterise Grobner bases and strong Grobner bases when A is a principal ideal ring. We also give algorithms for computing Grobner bases and strong Grobner bases which generalise known algorithms to principal ideal rings. In particular, we give an algorithm for computing a strong Grobner basis over a finite-chain ring, for example a Galois ring.
Resumo:
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
Resumo:
Let a commutative ring R be a direct product of indecomposable rings with identity and let G be a finite abelian p-group. In the present paper we give a complete system of invariants of the group algebra RG of G over R when p is an invertible element in R. These investigations extend some classical results of Berman (1953 and 1958), Sehgal (1970) and Karpilovsky (1984) as well as a result of Mollov (1986).
Resumo:
We give sufficient conditions for homotopical localization functors to preserve algebras over coloured operads in monoidal model categories. Our approach encompasses a number of previous results about preservation of structures under localizations, such as loop spaces or infinite loop spaces, and provides new results of the same kind. For instance, under suitable assumptions, homotopical localizations preserve ring spectra (in the strict sense, not only up to homotopy), modules over ring spectra, and algebras over commutative ring spectra, as well as ring maps, module maps, and algebra maps. It is principally the treatment of module spectra and their maps that led us to the use of coloured operads (also called enriched multicategories) in this context.
Resumo:
The set of integers forms a commutative ring whose elements admit a unique decomposition into primes. In this folder three lecture notes are bound, concerning topics, developed by dropping or replacing special properties of this most natural and most special ring. For short: investigated are groupoids w.r.t the interplay of multiplication - on the one hand - and divisibility, ideal decomposition and residuation, respectively, on the other hand.
Resumo:
Let R be a commutative ring, G a group and RG its group ring. Let phi : RG -> RG denote the R-linear extension of an involution phi defined on G. An element x in RG is said to be phi-antisymmetric if phi(x) = -x. A characterization is given of when the phi-antisymmetric elements of RG commute. This is a completion of earlier work.
Resumo:
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.
Resumo:
Let B[X; S] be a monoid ring with any fixed finite unitary commutative ring B and is the monoid S such that b = a + 1, where a is any positive integer. In this paper we constructed cyclic codes, BCH codes, alternant codes, Goppa codes, Srivastava codes through monoid ring . For a = 1, almost all the results contained in [16] stands as a very particular case of this study.
Resumo:
Residuated lattices, although originally considered in the realm of algebra providing a general setting for studying ideals in ring theory, were later shown to form algebraic models for substructural logics. The latter are non-classical logics that include intuitionistic, relevance, many-valued, and linear logic, among others. Most of the important examples of substructural logics are obtained by adding structural rules to the basic logical calculus
Resumo:
2000 Mathematics Subject Classification: 15A69, 15A78.