ProbXiv
Explorersign in
Problem archiveProblem record

Statement

(2) Making use of a spectral sequence argument we show that even though G• is not a priori a resolution of M\geqd we have that: \betai,a (M\geqd ) = \betai,a (G• ) . (3) Finally, we characterize M being d-regular in terms of the vanishing of the cohomology in (1) above. Note the complex G• constructed in part (1) of the proof sketch above is a priori not a resolution of M\geqd , but instead is a virtual resolution of M [1]. That said as noted above it does have the same Betti numbers as M\geqd , and in all the examples we have done it turns out to be a resolution. Conjecture 2.5. [2, Conjecture 6.7] The complex G• is the minimal free resolu- tion of M\geqd . 3. Further Questions Since computing the minimal graded free resolution of M\geqd can be effectively done via Gröbner basis methods, Theorem 2.4 provides an efficient algorithm for checking whether a module is d-regular for a particular d \in Zr . It would be interesting to know whether such an algorithm could be extended to computing all of the minimal elements of reg(M ). Question 3.1. Is there an effective algorithm for computing the multigraded Castelnuovo–Mumford regularity of a coherent sheaf or module on Pn ? This is equivalent to finding a finite box in Zr that contains all of the minimal elements of reg(M ). If such a finite box does exist, it is very special to the case of a product of projective spaces. In particular, one may consider multigraded Castelnuovo–Mumford regularity of sheaves and modules on other toric varieties [5]. It turns out that there are examples of finitely generated modules on Hirzebruch surfaces whose multigraded Castelnuovo–Mumford regularity does not lie in finite a box [3]. This naturally leads one to ask what assumptions one needs to avoid such potential issues. Question 3.2. Let X be a smooth projective toric variety, and M a finitely generated Pic(X)-graded

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.