Almost Bézout domains

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bézout rings with almost stable range 1 Warren

Elementary divisor domains were defined by Kaplansky [I. Kaplansky, Elementary divisors and modules, Trans. Amer. Math. Soc. 66 (1949) 464–491] and generalized to rings with zero-divisors by Gillman and Henriksen [L. Gillman, M. Henriksen, Some remarks about elementary divisor rings, Trans. Amer. Math. Soc. 82 (1956) 362–365]. In [M.D. Larsen, W.J. Lewis, T.S. Shores, Elementary divisor rings a...

متن کامل

Almost Condensed Domains

As an extension of the class of half condensed domains introduced by D.D. Anderson and Dumitrescu, we introduce and study the class of almost condensed domains. An integral domain D is almost condensed if whenever 0 ̸= z ∈ IJ with I, J ideals of D, there exist I ′, J ′ ideals of D such that I ′ ⊆ Iw, J ′ ⊆ Jw and zD = (I ′J )w. In 1983, D.F. Anderson and D.E. Dobbs [13] called an integral domain...

متن کامل

Tilting Modules over Almost Perfect Domains

We provide a complete classification of all tilting modules and tilting classes over almost perfect domains, which generalizes the classifications of tilting modules and tilting classes over Dedekind and 1-Gorenstein domains. Assuming the APD is Noetherian, a complete classification of all cotilting modules is obtained (as duals of the tilting ones).

متن کامل

Almost Splitting Sets and Agcd Domains

Let D be an integral domain. A multiplicative set S of D is an almost splitting set if for each 0 6= d ∈ D, there exists an n = n(d) with dn = st where s ∈ S and t is v-coprime to each element of S. An integral domain D is an almost GCD (AGCD) domain if for every x, y ∈ D, there exists a positive integer n = n(x, y) such that xnD ∩ ynD is a principal ideal. We prove that the polynomial ring D[X...

متن کامل

Bézout Identities Associated to a Finite Sequence

We consider finite sequences s ∈ D n where D is a commutative, unital, integral domain. We prove three sets of identities (possibly with repetitions), each involving 2n polynomials associated to s. The right-hand side of these identities is a recursively-defined (non-zero) 'product-of-discrepancies'. There are implied iterative algorithms (of quadratic complexity) for the left-hand side coeffic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 1991

ISSN: 0021-8693

DOI: 10.1016/0021-8693(91)90309-v