Page 1 Next

Displaying 1 – 20 of 21

Showing per page

On a generalization of de Rham lemma

Kyoji Saito (1976)

Annales de l'institut Fourier

Let M be a free module over a noetherian ring. For ω 1 , ... , ω k M , let 𝒜 be the ideal generated by coefficients of ω 1 ... ω k . For an element ω p M with p < prof . 𝒜 , if ω ω 1 ... ω k = 0 , there exists η 1 , ... , η k p - 1 M such that ω = i = 1 k η i ω i .This is a generalization of a lemma on the division of forms due to de Rham (Comment. Math. Helv., 28 (1954)) and has some applications to the study of singularities.

On commutative rings whose prime ideals are direct sums of cyclics

M. Behboodi, A. Moradzadeh-Dehkordi (2012)

Archivum Mathematicum

In this paper we study commutative rings R whose prime ideals are direct sums of cyclic modules. In the case R is a finite direct product of commutative local rings, the structure of such rings is completely described. In particular, it is shown that for a local ring ( R , ) , the following statements are equivalent: (1) Every prime ideal of R is a direct sum of cyclic R -modules; (2) = λ Λ R w λ where Λ is an index set and R / Ann ( w λ ) is a principal ideal ring for each λ Λ ; (3) Every prime ideal of R is a direct sum of at most...

On n-derivations and Relations between Elements rⁿ-r for Some n

Maciej Maciejewski, Andrzej Prószyński (2014)

Bulletin of the Polish Academy of Sciences. Mathematics

We find complete sets of generating relations between the elements [r] = rⁿ - r for n = 2 l and for n = 3. One of these relations is the n-derivation property [rs] = rⁿ[s] + s[r], r,s ∈ R.

On prime modules over pullback rings

Shahabaddin Ebrahimi Atani (2004)

Czechoslovak Mathematical Journal

First, we give a complete description of the indecomposable prime modules over a Dedekind domain. Second, if R is the pullback, in the sense of [9], of two local Dedekind domains then we classify indecomposable prime R -modules and establish a connection between the prime modules and the pure-injective modules (also representable modules) over such rings.

On prime submodules and primary decomposition

Yücel Tiraş, Harmanci, Abdullah (2000)

Czechoslovak Mathematical Journal

We characterize prime submodules of R × R for a principal ideal domain R and investigate the primary decomposition of any submodule into primary submodules of R × R .

On pseudo-prime multiplication modules over pullback rings

Fatemeh Esmaeili Khalil Saraei (2016)

Colloquium Mathematicae

The purpose of this paper is to present a new approach to the classification of indecomposable pseudo-prime multiplication modules over pullback of two local Dedekind domains. We extend the definitions and the results given by Ebrahimi Atani and Farzalipour (2009) to more general cases.

On the minimaxness and coatomicness of local cohomology modules

Marzieh Hatamkhani, Hajar Roshan-Shekalgourabi (2022)

Czechoslovak Mathematical Journal

Let R be a commutative Noetherian ring, I an ideal of R and M an R -module. We wish to investigate the relation between vanishing, finiteness, Artinianness, minimaxness and 𝒞 -minimaxness of local cohomology modules. We show that if M is a minimax R -module, then the local-global principle is valid for minimaxness of local cohomology modules. This implies that if n is a nonnegative integer such that ( H I i ( M ) ) 𝔪 is a minimax R 𝔪 -module for all 𝔪 Max ( R ) and for all i < n , then the set Ass R ( H I n ( M ) ) is finite. Also, if H I i ( M ) is minimax for...

On the structure of linear recurrent error-control codes

Michel Fliess (2002)

ESAIM: Control, Optimisation and Calculus of Variations

We are extending to linear recurrent codes, i.e., to time-varying convolutional codes, most of the classic structural properties of fixed convolutional codes. We are also proposing a new connection between fixed convolutional codes and linear block codes. These results are obtained thanks to a module-theoretic framework which has been previously developed for linear control.

On the structure of linear recurrent error-control codes

Michel Fliess (2010)

ESAIM: Control, Optimisation and Calculus of Variations

We are extending to linear recurrent codes, i.e., to time-varying convolutional codes, most of the classic structural properties of fixed convolutional codes. We are also proposing a new connection between fixed convolutional codes and linear block codes. These results are obtained thanks to a module-theoretic framework which has been previously developed for linear control.

Currently displaying 1 – 20 of 21

Page 1 Next