Question 1. However, by now, we have only two such SCY3 ([11] for X3 and [9, Lemma 4.6] for X7 ; it is easy to check d2 (f ) > d1 (f ) for f \in Aut (X7 ) there): Theorem 5.
Statement
Question 1. However, by now, we have only two such SCY3 ([11] for X3 and [9, Lemma 4.6] for X7 ; it is easy to check d2 (f ) > d1 (f ) for f \in Aut (X7 ) there): Theorem 5. Two rigid SCY3 Xk (k = 3, 7) have a primitive fk \in Aut (Xk ) of positive entropy. (See [10] for explicit definitions of Xk ). We have the following intrinsic characterization of Xk ([10]): Definition 6. Let X be a SCY3. A surjective morphism ϕ : X \to B to a normal projective variety B with dim B > 0 with connected fiber is called a c2 - contraction if (c2 (X), ϕ∗ HB ) = 0 for an ample Caritier divisor HB on B, or equivalently, if (c2 (X), ϕ∗ N 1 (B)) = 0 (by the psuedo-effectivity of c2 (X)). Note that c2 -contraction ϕ is never an isomorphism (as c2 (X) 6= 0 on N 1 (X) by the simply-connectedness of X). We call a c2 -contraction ϕ0 : X \to B0 maximal if ϕ0 factors holomorphically through any c2 -contraction ϕ : X \to B. Theorem 7. If a SCY3 X has a c2 -contraction, then X has a maximal c2 - contraction ϕ0 : X \to B0 . A SCY3 X has a birational c2 -contraction ϕ if and only if X is isomorphic to one of Xk (k = 3, 7). Also ϕ is maximal in this case. See [10] for proof and details. Here partial vanishing of the second Chen class c2 (Xk ) on Amp (Xk ) \ {0} is natural for SCY3 X of |Aut X| = \infty: Proposition 8. c2 (X)⊥ \capAmp (X)(R)\{0} 6= \varnothing for a SCY3 X of |Aut (X)| = \infty. This is due to Wilson [14]. To my best knowledge, there is no known example such that c2 (X)⊥ \cap Amp (X)(R) \ {0} 6= \varnothing but c2 (X)⊥ \cap Amp (X)(Q) \ {0} = \varnothing. So, it may be reasonable to ask: Wall Crossing and Moduli Spaces, Varieties and Derived Categories 1823
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.