اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMinimal resolutions of monomial ideals
156
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
An explicit combinatorial minimal free resolution of an arbitrary monomial ideal $I$ in a polynomial ring in $n$ variables over a field of characteristic $0$ is defined canonically, without any choices, using higher-dimensional generalizations of combined spanning trees for cycles and cocycles (hedges) in the upper Koszul simplicial complexes of $I$ at lattice points in $mathbb{Z}^n$. The differentials in these sylvan resolutions are expressed as matrices whose entries are sums over lattice paths of weights determined combinatorially by sequences of hedges (hedgerows) along each lattice path. This combinatorics enters via an explicit matroidal expression for the Moore-Penrose pseudoinverses of the differentials in any CW complex as weighted averages of splittings defined by hedges. This Hedge Formula also yields a projection formula from CW chains to boundaries. The translation from Moore-Penrose combinatorics to free resolutions relies on Wall complexes, which construct minimal free resolutions of graded ideals from vertical splittings of Koszul bicomplexes. The algebra of Wall complexes applied to individual hedgerows yields explicit but noncanonical combinatorial minimal free resolutions of arbitrary monomial ideals in any characteristic.
قيم البحث
اقرأ أيضاً
This paper is concerned with the question of whether geometric structures such as cell complexes can be used to simultaneously describe the minimal free resolutions of all powers of a monomial ideal. We provide a full answer in the case of square-fre
e monomial ideals of projective dimension one, by introducing a combinatorial construction of a family of (cubical) cell complexes whose 1-skeletons are powers of a graph that supports the resolution of the ideal.
Let $A = K[X_1,ldots, X_d]$ and let $I$, $J$ be monomial ideals in $A$. Let $I_n(J) = (I^n colon J^infty)$ be the $n^{th}$ symbolic power of $I$ wrt $J$. It is easy to see that the function $f^I_J(n) = e_0(I_n(J)/I^n)$ is of quasi-polynomial type, s
ay of period $g$ and degree $c$. For $n gg 0$ say [ f^I_J(n) = a_c(n)n^c + a_{c-1}(n)n^{c-1} + text{lower terms}, ] where for $i = 0, ldots, c$, $a_i colon mathbb{N} rt mathbb{Z}$ are periodic functions of period $g$ and $a_c eq 0$. In an earlier paper we (together with Herzog and Verma) proved that $dim I_n(J)/I^n$ is constant for $n gg 0$ and $a_c(-)$ is a constant. In this paper we prove that if $I$ is generated by some elements of the same degree and height $I geq 2$ then $a_{c-1}(-)$ is also a constant.
Minimal cellular resolutions of the edge ideals of cointerval hypergraphs are constructed. This class of d-uniform hypergraphs coincides with the complements of interval graphs (for the case d=2), and strictly contains the class of `strongly stable h
ypergraphs corresponding to pure shifted simplicial complexes. The polyhedral complexes supporting the resolutions are described as certain spaces of directed graph homomorphisms, and are realized as subcomplexes of mixed subdivisions of the Minkowski sums of simplices. Resolutions of more general hypergraphs are obtained by considering decompositions into cointerval hypergraphs.
We prove a characterization of the j-multiplicity of a monomial ideal as the normalized volume of a polytopal complex. Our result is an extension of Teissiers volume-theoretic interpretation of the Hilbert-Samuel multiplicity for m-primary monomial i
deals. We also give a description of the epsilon-multiplicity of a monomial ideal in terms of the volume of a region.
Let I=I(D) be the edge ideal of a weighted oriented graph D. We determine the irredundant irreducible decomposition of I. Also, we characterize the associated primes and the unmixed property of I. Furthermore, we give a combinatorial characterization
for the unmixed property of I, when D is bipartite, D is a whisker or D is a cycle. Finally, we study the Cohen-Macaulay property of I.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
