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.

We construct a moduli space of stable pairs over a smooth projective variety, parametrizing morphisms from a fixed coherent sheaf to a varying sheaf of fixed topological type, subject to a stability condition. This generalizes the notion used by Pandharipande and Thomas, following Le Potier, where the fixed sheaf is the structure sheaf of the variety. We then describe the relevant deformation and obstruction theories. We also show the existence of the virtual fundamental class in special cases.

Based on the double shockwave approximation procedure, a local Riemann solver for strongly nonlinear equations of state (EOS) such as the Jones-Wilkins-Lee (JWL) EOS is presented, which has suppressed successfully numerical oscillation caused by high-density ratio and high-pressure ratio across the interface between explosion products and air. The real ghost fluid method (RGFM) and the level set method have been used for converting multi-medium flows into pure flows and for implicitly tracking the interface, respectively. A fifth order finite difference weighted essentially non-oscillatory (WENO) scheme and a third order TVD Runge-Kutta method are utilized for the spatial discretization and the time advance, respectively. An enclosed-type MPI-based parallel methodology for the RGFM procedure on a uniform structured mesh is presented to realize the parallelization of three-dimensional {\color{red}(3D)} air explosion. The overall process of 3D air explosion of both TNT and aluminized explosives has been successfully simulated.

No abstract uploaded!

We consider in this work stochastic differential equation (SDE) model for particles in contact with a heat bath when the memory effects are non-negligible. As a result of the fluctuation-dissipation theorem, the differential equations driven by fractional Brownian noise to model memory effects should be paired with Caputo derivatives and based on this we consider fractional stochastic differential equations (FSDEs), which should be understood in an integral form. We establish the existence of strong solutions for such equations. In the linear forcing regime, we compute the solutions explicitly and analyze the asymptotic behavior, through which we verify that satisfying fluctuation-dissipation indeed leads to the correct physical behavior. We further discuss possible extensions to nonlinear forcing regime, while leave the rigorous analysis for future works.