In lieu of an abstract, here is a brief excerpt of the content:

ERRATUM TO “TWISTED GENUS BOUNDS FOR SUBVARIETIES OF GENERIC HYPERSURFACES” By HERBERT CLEMENS and ZIV RAN Our purpose is to give an improved, cleaner statement of part of the main result in [1]. The Main Theorem (Theorem 0.1, p. 91) is needlessly understated (and somewhat misstated). Formula (0.2), p. 91 should read (0.2) h0 (ωY) + 1 ≥ min ( dim (span( f(Y)) − k + 2, 4)). As a consequence, the exception allowed On p. 92, l. 3 is, in fact, excluded and we have established: THEOREM 0.1 bis. Any integral curve Y on the generic sextic 3-fold has geometric genus g(Y) ≥ 3. The change comes from Lemma 4.2, p. 102 in which formula (4.7) should read (4.7) h0 (ωY(n + 2 − d)) ≥ min (p + 1 − k, 3). To see this, note that the foregoing argument on p. 101 shows in the general case where p ≥ k that h0 (c1(N )) ≥ 1; if in fact p > k, so γ is nonconstant, we get h0 (c1(N )) ≥ 2; finally in case p > k + 1, the image of γ cannot be a P1 in the Grassmannian, and we get h0 (c1(N )) ≥ 3. Manuscript received July 14, 2004. American Journal of Mathematics 127 (2005), 241–242. 241 242 HERBERT CLEMENS AND ZIV RAN Putting these together and using, as usual, that h0 (ωY(n + 2 − d)) ≥ h0 (c1(N )), we get (4.7). At this point, the argument on p. 102 applies as is. This argument, which is independent of the rest of the paper, shows that any plane curve Y on the generic sextic 3-fold has genus at least 4. Putting this together with the above (0.2), we can state Lemma 4.3 p. 102 without the phrase “except possibly...,” leading to the above improved statement of Theorem 0.1. Erratum. On p. 109, l. 9, “> s” should be replaced by “< s.” DEPARTMENT OF MATHEMATICS, THE OHIO STATE UNIVERSITY, COLUMBUS, OH 43210 DEPARTMENT OF MATHEMATICS, UNIVERSITY OF CALIFORNIA, RIVERSIDE, CA 92521 REFERENCES [1] H. Clemens and Z. Ran, Twisted genus bounds for subvarieties of generic hypersurfaces, Amer. J. Math. 126 (2004), 89–120. ...


Additional Information

Print ISSN
pp. 241-242
Launched on MUSE
Open Access
Back To Top

This website uses cookies to ensure you get the best experience on our website. Without cookies your experience may not be seamless.