Codimension 2 complete intersections in P^N have a natural parameter space H : a projective bundle over a projective space given by the choice of the lower degree equation and of the higher degree equation up to a multiple of the first. Motivated by the question of existence of complete families of smooth complete intersections, we study the birational geometry of H . In a first part, we show that the first contraction of the MMP for H always exists and we describe it. Then, we show that it is possible to run the full MMP for H , and we describe it, in two degenerate cases. As an application, we prove the existence of complete curves in the punctual Hilbert scheme of complete intersection subschemes of A^2.
Here is another difference between @math and @math . The trivial contraction of @math is the fibration over @math , that associates to @math its degree @math equation @math , and the non-trivial contraction that starts the MMP for @math is closely related to a Hilbert-Chow morphism (see for instance the proof Lemma ). On the contrary, the trivial contraction of @math is the Hilbert-Chow morphism and the non-trivial contraction that starts the MMP for @math is given by considering the degree @math equations of a length @math subscheme ( @cite_0 Proposition 3.1).
@cite_0
1945101555 1835694908 2807350215 2947949186
Let @math be a smooth scheme over an algebraically closed field @math of characteristic zero and @math a regular function, and write @math Crit @math , as a closed subscheme of @math . The motivic vanishing cycle @math is an element of the @math -equivariant motivic Grothendieck ring @math defined by Denef and Loeser math.AG 0006050 and Looijenga math.AG 0006220, and used in Kontsevich and Soibelman's theory of motivic Donaldson-Thomas invariants, arXiv:0811.2435. We prove three main results: (a) @math depends only on the third-order thickenings @math of @math . (b) If @math is another smooth scheme, @math is regular, @math Crit @math , and @math is an embedding with @math and @math an isomorphism, then @math equals @math "twisted" by a motive associated to a principal @math -bundle defined using @math , where now we work in a quotient ring @math of @math . (c) If @math is an "oriented algebraic d-critical locus" in the sense of Joyce arXiv:1304.4508, there is a natural motive @math , such that if @math is locally modelled on Crit @math , then @math is locally modelled on @math . Using results from arXiv:1305.6302, these imply the existence of natural motives on moduli schemes of coherent sheaves on a Calabi-Yau 3-fold equipped with "orientation data", as required in Kontsevich and Soibelman's motivic Donaldson-Thomas theory arXiv:0811.2435, and on intersections of oriented Lagrangians in an algebraic symplectic manifold. This paper is an analogue for motives of results on perverse sheaves of vanishing cycles proved in arXiv:1211.3259. We extend this paper to Artin stacks in arXiv:1312.0090. Let @math be a primitive Hilbert modular form of parallel weight @math and level @math for the totally real field @math , and let @math be a rational prime coprime to @math . If @math is ordinary at @math and @math is a CM extension of @math of relative discriminant @math prime to @math , we give an explicit construction of the @math -adic Rankin-Selberg @math -function @math . When the sign of its functional equation is @math , we show, under the assumption that all primes @math are principal ideals of @math which split in @math , that its central derivative is given by the @math -adic height of a Heegner point on the abelian variety @math associated with @math . This @math -adic Gross--Zagier formula generalises the result obtained by Perrin-Riou when @math and @math satisfies the so-called Heegner condition. We deduce applications to both the @math -adic and the classical Birch and Swinnerton-Dyer conjectures for @math . We show that any language in nondeterministic time @math , where the number of iterated exponentials is an arbitrary function @math , can be decided by a multiprover interactive proof system with a classical polynomial-time verifier and a constant number of quantum entangled provers, with completeness @math and soundness @math , where the number of iterated exponentials is @math and @math is a universal constant. The result was previously known for @math and @math ; we obtain it for any time-constructible function @math . The result is based on a compression technique for interactive proof systems with entangled provers that significantly simplifies and strengthens a protocol compression result of Ji (STOC'17). As a separate consequence of this technique we obtain a different proof of Slofstra's recent result (unpublished) on the uncomputability of the entangled value of multiprover games. Finally, we show that even minor improvements to our compression result would yield remarkable consequences in computational complexity theory and the foundations of quantum mechanics: first, it would imply that the class MIP* contains all computable languages; second, it would provide a negative resolution to a multipartite version of Tsirelson's problem on the relation between the commuting operator and tensor product models for quantum correlations. We study the problem of approximating the commuting-operator value of a two-player non-local game. It is well-known that it is @math -complete to decide whether the classical value of a non-local game is 1 or @math . Furthermore, as long as @math is small enough, this result does not depend on the gap @math . In contrast, a recent result of Fitzsimons, Ji, Vidick, and Yuen shows that the complexity of computing the quantum value grows without bound as the gap @math decreases. In this paper, we show that this also holds for the commuting-operator value of a game. Specifically, in the language of multi-prover interactive proofs, we show that the power of @math (proofs with two provers, one round, completeness probability @math , soundness probability @math , and commuting-operator strategies) can increase without bound as the gap @math gets arbitrarily small. Our results also extend naturally in two ways, to perfect zero-knowledge protocols, and to lower bounds on the complexity of computing the approximately-commuting value of a game. Thus we get lower bounds on the complexity class @math - @math of perfect zero-knowledge multi-prover proofs with approximately-commuting operator strategies, as the gap @math gets arbitrarily small. While we do not know any computable time upper bound on the class @math , a result of the first author and Vidick shows that for @math and @math , the class @math , with constant communication from the provers, is contained in @math . We give a lower bound of @math (ignoring constants inside the function) for this class, which is tight up to polynomial factors assuming the exponential time hypothesis.