Bounding Projective Dimension

نویسندگان

  • JASON McCULLOUGH
  • ALEXANDRA SECELEANU
چکیده

The use of algorithms in algebra as well as the study of their complexity was initiated before the advent of modern computers. Hermann [25] studied the ideal membership problem, i.e determining whether a given polynomial is in a fixed homogeneous ideal, and found a doubly exponential bound on its computational complexity. Later Mayr and Meyer [31] found examples which show that her bound was nearly optimal. Their examples were further studied by Bayer and Stillman [3] and Koh [28] who showed that these ideals also had syzygies whose degrees are doubly exponential in the number of variables of the ambient ring. This survey addresses a different measure of the complexity of an ideal, approaching the problem from the perspective of computing the minimal free resolution of the ideal. Among invariants of free resolutions, we focus on the projective dimension, which counts the number of steps one needs to undertake in finding a minimal resolution; the precise definition of projective dimension is given in Section 2. In this paper we discuss estimates on the projective dimension of cyclic graded modules over a polynomial ring in terms of the degrees of the minimal generators of the defining ideal. We also establish connections to another well-known invariant, namely regularity. The investigation of this problem was initiated by Stillman who posed the following question:

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

ثبت نام

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

منابع مشابه

Bounding the Projective Dimension of a Squarefree Monomial Ideal via Domination in Clutters

We introduce the concept of edgewise domination in clutters, and use it to provide an upper bound for the projective dimension of any squarefree monomial ideal. We then compare this bound to a bound given by Faltings. Finally, we study a family of clutters associated to graphs and compute domination parameters for certain classes of these clutters.

متن کامل

Characterization of some projective special linear groups in dimension four by their orders and degree patterns

‎Let $G$ be a finite group‎. ‎The degree pattern of $G$ denoted by‎ ‎$D(G)$ is defined as follows‎: ‎If $pi(G)={p_{1},p_{2},...,p_{k}}$ such that‎ ‎$p_{1}

متن کامل

The existence totally reflexive covers

Let $R$ be a commutative Noetherian ring. We prove that  over a local ring $R$ every finitely generated $R$-module $M$ of finite Gorenstein projective dimension has a Gorenstein projective cover$varphi:C rightarrow M$ such that $C$ is finitely generated and the projective dimension of $Kervarphi$ is finite and $varphi$ is surjective.

متن کامل

Gorenstein projective objects in Abelian categories

Let $mathcal {A}$ be an abelian category with enough projective objects and $mathcal {X}$ be a full subcategory of $mathcal {A}$. We define Gorenstein projective objects with respect to $mathcal {X}$ and $mathcal{Y}_{mathcal{X}}$, respectively, where $mathcal{Y}_{mathcal{X}}$=${ Yin Ch(mathcal {A})| Y$ is acyclic and $Z_{n}Yinmathcal{X}}$. We point out that under certain hypotheses, these two G...

متن کامل

Characterization of projective special linear groups in dimension three by their orders and degree patterns

The prime graph $Gamma(G)$ of a group $G$ is a graph with vertex set $pi(G)$, the set of primes dividing the order of $G$, and two distinct vertices $p$ and $q$ are adjacent by an edge written $psim q$ if there is an element in $G$ of order $pq$. Let $pi(G)={p_{1},p_{2},...,p_{k}}$. For $pinpi(G)$, set $deg(p):=|{q inpi(G)| psim q}|$, which is called the degree of $p$. We also set $D(G):...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012