نتایج جستجو برای: sequentially cohen macaulay graph
تعداد نتایج: 224956 فیلتر نتایج به سال:
We prove that a Cohen-Macaulay normal variety X has Du Bois singularities if and only if π∗ωX′(G) ≃ ωX for a log resolution π : X ′ → X , where G is the reduced exceptional divisor of π. Many basic theorems about Du Bois singularities become transparent using this characterization (including the fact that Cohen-Macaulay log canonical singularities are Du Bois). We also give a straightforward an...
Let G be a simple graph on n vertices and JG denote the binomial edge ideal of in polynomial ring S=K[x1,…,xn,y1,…,yn]. In this article, we compute second graded Betti numbers JG, obtain minimal presentation it when is tree or unicyclic graph. We classify all graphs whose ideals are almost complete intersection, prove that they generated by d-sequence Rees algebra their Cohen-Macaulay. also an ...
We introduce a new family of simple graphs, so called, growing graphs. investigate ways to modify given graph G combinatorially obtain graph. One may infinitely many graphs from single show that obtained any is Cohen–Macaulay and every chordal also prove under certain conditions, if only its clique complex grafted give several equivalent conditions in this case. Our work inspired by generalizes...
In a recent paper, E. Steingŕımsson associated to each simple graph G a simplicial complex ∆G denoted as the coloring complex of G. Certain nonfaces of ∆G correspond in a natural manner to proper colorings of G. Indeed, the h-vector is an affine transformation of the chromatic polynomial χG of G, and the reduced Euler characteristic is, up to sign, equal to |χG(−1)| − 1. We show that ∆G is cons...
If V is an equidimensional codimension c subscheme of an n-dimensional projective space, and V is linked to V ′ by a complete intersection X, then we say that V is minimally linked to V ′ if X is a codimension c complete intersection of smallest degree containing V . Gaeta showed that if V is any arithmetically Cohen-Macaulay (ACM) subscheme of codimension two then there is a finite sequence of...
A very well–covered graph is an unmixed without isolated vertices such that the height of its edge ideal half number vertices. We study these graphs by means Betti splittings and mapping cone constructions. show cover ideals Cohen–Macaulay are splittable. As a consequence, we compute explicitly minimal graded free resolution class prove have homological linear quotients. Finally, conjecture sam...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید