We study the isoperimetric structure of asymptotically flat Riemannian 3-manifolds (M, g) that are C0-asymptotic to Schwarzschild of mass m > 0. Refining an argument due to H. Bray, we obtain an effective volume comparison theorem in Schwarzschild. We use it to show that isoperimetric regions exist in (M, g) for all sufficiently large volumes, and that they are close to centered coordinate spheres. This implies that the volume-preserving stable constant mean curvature spheres constructed by G. Huisken and S.-T. Yau as well as R. Ye as perturbations of large centered coordinate spheres minimize area among all competing surfaces that enclose the same volume. This confirms a conjecture of H. Bray. Our results are consistent with the uniqueness results for volumepreserving stable constant mean curvature surfaces in initial data sets obtained by G. Huisken and S.-T. Yau and strengthened by J. Qing and G. Tian. The additional hypotheses that the surfaces be spherical and far out in the asymptotic region in their results are not necessary in our work.

We construct relative and global Euler sequences of a module. We apply it to prove some acyclicity results of the Koszul complex of a module and to compute the cohomology of the sheaves of (relative and absolute) differential $p$ -forms of a projective bundle. In particular we generalize Bott’s formula for the projective space to a projective bundle over a scheme of characteristic zero.

No abstract uploaded!

No abstract uploaded!

The Hamiltonian cycle problem is an important problem in graph theory and computer science. It is a special case of the famous traveling salesman problem. A signicant amount of research has been done on the special cases of nding Hamiltonian cycles in subgraphs of triangular, square and hexagonal grids. However, there is little work on more complicated grids. In this paper, we investigate the hardness of Hamiltonian cycle problem in grid graphs of semiregular tessellations, which are tessellations formed by two or more kinds of regular polygons. There are only eight semiregular tessellations, and we prove that the Hamiltonian cycle problem in all of them are NP-complete by reducing from NP-complete problems, such as the Hamiltonian cycle problem in max degree 3 bipartite planar graphs. Knowing the NP-completeness of Hamiltonian cycle problem in semiregular grids indicates that there will not be any polynomial time algorithm that solves the Hamiltonian path problem in these tessellations if NP does not equal to P, which helps show the limits of ecient motion planning algorithms and provides new information about what makes problems computationally dicult to solve.