Taylor and minimal resolutions of homogeneous polynomial ideals

نویسندگان

چکیده

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

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

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

منابع مشابه

Taylor and minimal resolutions of homogeneous polynomial ideals

In the theory of monomial ideals of a polynomial ring S over a field k, it is convenient that for each such ideal I there is a standard free resolution, so called Taylor resolution, that can be canonically constructed from the minimal system of monomial generators of I (see [7], p.439 and section 2). On the other hand no construction of a minimal resolution for an arbitrary monomial ideal has b...

متن کامل

Monomial Ideals with Linear Quotients Whose Taylor Resolutions Are Minimal

We study when Taylor resolutions of monomial ideals are minimal, particularly for ideals with linear quotients.

متن کامل

Planar Graphs as Minimal Resolutions of Trivariate Monomial Ideals

We introduce the notion of rigid embedding in a grid surface, a new kind of plane drawing for simple triconnected planar graphs. Rigid embeddings provide methods to (1) find well-structured (cellular, here) minimal free resolutions for arbitrary monomial ideals in three variables; (2) strengthen the Brightwell–Trotter bound on the order dimension of triconnected planar maps by giving a geometri...

متن کامل

Monomial Ideals, Edge Ideals of Hypergraphs, and Their Minimal Graded Free Resolutions

We use the correspondence between hypergraphs and their associated edge ideals to study the minimal graded free resolution of squarefree monomial ideals. The theme of this paper is to understand how the combinatorial structure of a hypergraph H appears within the resolution of its edge ideal I(H). We discuss when recursive formulas to compute the graded Betti numbers of I(H) in terms of its sub...

متن کامل

Resolutions of Facet Ideals

In this paper we study the resolution of a facet ideal associated with a special class of simplicial complexes introduced by Faridi. These simplicial complexes are called trees, and are a generalization (to higher dimensions) of the concept of a tree in graph theory. We show that the Koszul homology of the facet ideal I of a tree is generated by the homology classes of monomial cycles, determin...

متن کامل

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


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

ژورنال

عنوان ژورنال: Mathematical Research Letters

سال: 1999

ISSN: 1073-2780,1945-001X

DOI: 10.4310/mrl.1999.v6.n6.a14