نتایج جستجو برای: c perfect complex

تعداد نتایج: 1793356  

Journal: :bulletin of the iranian mathematical society 0
e. amanzadeh faculty of mathematical sciences and computer‎, ‎kharazmi university‎, ‎tehran‎, ‎iran‎. m. t. dibaei faculty of mathematical sciences and computer‎, ‎kharazmi university‎, ‎tehran‎, ‎iran and school of mathematics‎, ‎institute for research in fundamental sciences (ipm)‎, ‎p.o‎. ‎box‎ ‎19395-5746‎, ‎tehran‎, ‎iran.

inspired by a recent work of buchweitz and flenner, we show that, for a semidualizing bimodule $c$, $c$--perfect complexes have the ability to detect when a ring is strongly regular.it is shown that there exists a class of modules which admit minimal resolutions of $c$--projective modules.

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه شیراز - دانشکده علوم 1390

this work is presented in five parts. in the first part preparation of the starting complex [pt(c^n)cl(dmso)], 1, in which c^n = n(1),c(2?)-chelated, deprotonated 2-phenylpyridine, and dmso = dimethylsulfoxide, and its reaction with 1 equiv of the biphosphine ligands bis(diphenylphosphino)amine, dppa, or bis(diphenylphosphino)methane, dppm, to give the complex [pt(c^n)cl(dppa)], 2, or [pt(c^n)c...

اسمعیل حسینی, ن طیارزاده َش نیک نژاد

Let R be an associative ring with identity, C(R) be the category of com-plexes of R-modules and Flat(C(R)) be the class of all at complexes of R-modules. We show that the at cotorsion theory (Flat(C(R)); Flat(C(R))−)have enough injectives in C(R). As an application, we prove that for each atcomplex F and each complex Y of R-modules, Exti (F,X)= 0, whenever Ris n-perfect and i > n.

Journal: :نظریه تقریب و کاربرد های آن 0
ن طیارزاده دانشگاه آزاد واحد گچساران ایران اسمعیل حسینی دانشگاه آزاد واحد گچساران ایران َش نیک نژاد دانشگاه آزاد واحد گچساران

let r be an associative ring with identity, c(r) be the category of com-plexes of r-modules and flat(c(r)) be the class of all at complexes of r-modules. we show that the at cotorsion theory (flat(c(r)); flat(c(r))−)have enough injectives in c(r). as an application, we prove that for each atcomplex f and each complex y of r-modules, exti (f,x)= 0, whenever ris n-perfect and i > n.

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده ادبیات و علوم انسانی 1389

abstract abstract of thesis (includes summary, goals, execution methods, and results) story “al-obnosat al-bayza” is one of the short stories from “hanna mineh” collection. this story is a selection of lives of some humans during a voyage together, each of them is a symbol of human nature (love, mind, kindness) and examine social, cultural, and political aspects of governing system, and it...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه صنعتی اصفهان - دانشکده شیمی 1393

چکیده در این پایان نامه، در ابتدا از واکنش بین پالادیم استات و آلیزارین زرد gg کمپلکس دو هسته ای ارتوپالادیت [pd{? 2(c,n) -{5-(3-nitrophenylazo) salicylic acid}}(µ-oac)]2 (1) ستنز شد. از واکنش این کمپلکس دو هسته ای ارتوپالادیت (1) با لیگاند های تک دندانه تری فنیل فسفین (pph3)، 6،4،2-تری متیل-پیریدین(me3py) کمپلکس های تک هسته ای (2)، (3) سنتز شدند. همچنین از واکنش بین پالادیم استات و آلیزارین ز...

2017
Antoine Limasset Guillaume Rizk Rayan Chikhi Pierre Peterlongo

Minimal perfect hash functions provide space-efficient and collision-free hashing on static sets. Existing algorithms and implementations that build such functions have practical limitations on the number of input elements they can process, due to high construction time, RAM or external memory usage. We revisit a simple algorithm and show that it is highly competitive with the state of the art,...

Journal: :Dynamical Systems-an International Journal 2021

Conditions are given which imply that certain non-autonomous analytic iterated function systems (NIFSs) in the complex plane C have uniformly perfect attractor sets, while other conditions th...

Journal: :Discrete Mathematics 2011
Nicolas Trotignon Kristina Vuskovic

Roussel and Rubio proved a lemma which is essential in the proof of the Strong Perfect Graph Theorem. We give a new short proof of the main case of this lemma. In this note, we also give a short proof of Hayward’s decomposition theorem for weakly chordal graphs, relying on a Roussel–Rubio-type lemma. We recall how Roussel–Rubio-type lemmas yield very short proofs of the existence of even pairs ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید