نتایج جستجو برای: sequentially cohen macaulay graph

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

Let $(R,underline{m})$ be a commutative Noetherian local ring and $M$ be a non-zero finitely generated $R$-module. We show that if $R$ is almost Cohen-Macaulay and $M$ is perfect with finite projective dimension, then $M$ is an almost Cohen-Macaulay module. Also, we give some necessary and sufficient condition on $M$ to be an almost Cohen-Macaulay module, by using $Ext$ functors.

Journal: :journal of algebraic systems 2015
moharram aghapournahr khadijeh ahmadi-amoli miryousef sadeghi

‎we introduce a generalization of the notion of‎ depth of an ideal on a module by applying the concept of‎ local cohomology modules with respect to a pair‎ ‎of ideals‎. ‎we also introduce the concept of $(i,j)$-cohen--macaulay modules as a generalization of concept of cohen--macaulay modules‎. ‎these kind of modules are different from cohen--macaulay modules‎, as an example shows‎. ‎also an art...

2018
Argimiro Arratia

It is shown in this paper how a solution for a combinatorial problem obtained from applying the greedy algorithm is guaranteed to be optimal for those instances of the problem that, under an appropriate algebraic representation, satisfy the Cohen-Macaulay property known for rings and modules in Commutative Algebra. The choice of representation for the instances of a given combinatorial problem ...

1997
Roger Wiegand ROGER WIEGAND

Let (R,m) be a local Cohen-Macaulay ring whose m-adic completion R̂ has an isolated singularity. We verify the following conjecture of F.-O. Schreyer: R has finite Cohen-Macaulay type if and only if R̂ has finite Cohen-Macaulay type. We show also that the hypersurface k[[x0, . . . , xd]]/(f) has finite Cohen-Macaulay type if and only if k [[x0, . . . , xd]]/(f) has finite Cohen-Macaulay type, whe...

Journal: :Electr. J. Comb. 2014
Türker Bíyíkoglu Yusuf Civan

We call a vertex x of a graph G = (V,E) a codominated vertex if NG[y] ⊆ NG[x] for some vertex y ∈ V \{x}, and a graph G is called codismantlable if either it is an edgeless graph or it contains a codominated vertex x such that G − x is codismantlable. We show that (C4, C5)-free vertex-decomposable graphs are codismantlable, and prove that if G is a (C4, C5, C7)-free well-covered graph, then ver...

Journal: :J. Comb. Theory, Ser. A 1999
Dmitry N. Kozlov

To every directed graph G one can associate a complex (G) consisting of directed subforests. This construction, suggested to us by R. Stanley, is especially important in the case of a complete double directed graph Gn, where it leads to studying some interesting representations of the symmetric group and corresponds (via Stanley-Reisner correspondence) to an interesting quotient ring. Our main ...

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

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