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.
The analogue of Question is much more complicated in the case of @math . Indeed, the non-trivial boundary of @math is difficult to describe: it depends on @math in a complicated and interesting fashion ( @cite_7 , @cite_27 Theorem 1.4 and Table 1).
@cite_27 @cite_7
2951132123 2620978636 30524954 2083308781
We address the problem of replicating a Voronoi diagram @math of a planar point set @math by making proximity queries, which are of three possible (in decreasing order of information content): 1. the exact location of the nearest site(s) in @math ; 2. the distance to and label(s) of the nearest site(s) in @math ; 3. a unique label for every nearest site in @math . We provide algorithms showing how queries of Type 1 and Type 2 allow an exact cloning of @math with @math queries and @math processing time. We also prove that queries of Type 3 can never exactly clone @math , but we show that with @math queries we can construct an @math -approximate cloning of @math . In addition to showing the limits of nearest-neighbor database security, our methods also provide one of the first natural algorithmic applications of retroactive data structures. The standard seminorm in the space @math , with @math < @math , does not converge, when @math approaches @math , to the corresponding @math seminorm. We prove that continuity is restored provided we multiply the @math seminorm by an appropriate factor. In this paper, we prove tight lower bounds on the smallest degree of a nonzero polynomial in the ideal generated by @math or @math in the polynomial ring @math , @math are coprime, which is called over @math . The immunity of @math is lower bounded by @math , which is achievable when @math is a multiple of @math ; the immunity of @math is exactly @math for every @math and @math . Our result improves the previous bound @math by Green. We observe how immunity over @math is related to @math circuit lower bound. For example, if the immunity of @math over @math is lower bounded by @math , and @math , then @math requires @math circuit of exponential size to compute. Let @math be a geometrically bounded symplectic manifold, @math be a closed, regular coisotropic submanifold, and @math be a Hamiltonian diffeomorphism. The main result of this article is that the number of leafwise fixed points of @math is bounded below by the sum of the Betti numbers of @math , provided that the Hofer distance between @math and the identity is small enough and the pair @math is non-degenerate. As an application, I prove a presymplectic non-embedding result. A version of the Arnold-Givental conjecture for coisotropic submanifolds is also discussed.