The goal of this paper is to develop a novel semi-implicit spectral deferred correction (SDC) time marching method. The method can be used in a large class of problems, especially for highly nonlinear ordinary differential equations (ODEs) without easily separating of stiff and non-stiff components, which is more general and efficient comparing with traditional semi-implicit SDC methods. The proposed semi-implicit SDC method is based on low order time integration methods and corrected iteratively. The order of accuracy is increased for each additional iteration. And we also explore its local truncation error analytically. This SDC method is intended to be combined with the method of lines, which provides a flexible framework to develop high order semi-implicit time marching methods for nonlinear partial differential equations (PDEs). In this paper we mainly focus on the applications of the nonlinear PDEs with higher order spatial derivatives, e.g. convection diffusion equation, the surface diffusion and Willmore flow of graphs, the Cahn– Hilliard equation, the Cahn–Hilliard–Brinkman system and the phase field crystal equation. Coupled with the local discontinuous Galerkin (LDG) spatial discretization, the fully discrete schemes are all high order accurate in both space and time, and stable numerically with the time step proportional to the spatial mesh size. Numerical experiments are carried out to illustrate the accuracy and capability of the proposed semi-implicit SDC method.

We explore the fine structure of the holographic entanglement entropy proposal (the Ryu-Takayanagi formula) in AdS$_3$/CFT$_{2}$. With the guidance from the boundary and bulk modular flows we find a natural slicing of the entanglement wedge with the modular planes, which are co-dimension one bulk surfaces tangent to the modular flow everywhere. This gives an one-to-one correspondence between the points on the boundary interval $\mathcal{A}$ and the points on the Ryu-Takayanagi (RT) surface $\mathcal{E}_{\mathcal{A}}$. In the same sense an arbitrary subinterval $\mathcal{A}_2$ of $\mathcal{A}$ will correspond to a subinterval $\mathcal{E}_2$ of $\mathcal{E}_{\mathcal{A}}$. This fine correspondence indicates that the length of $\mathcal{E}_2$ captures the contribution $s_{\mathcal{A}}(\mathcal{A}_2)$ from $\mathcal{A}_2$ to the entanglement entropy $S_{\mathcal{A}}$, hence gives the contour function for entanglement entropy. Furthermore we propose that $s_{\mathcal{A}}(\mathcal{A}_2)$ in general can be written as a simple linear combination of entanglement entropies of single intervals inside $\mathcal{A}$. This proposal passes several non-trivial tests.

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.