Let (X, ) be a pair. We study how the condition (X, ) causes surjectivity or birationality of the Albanese map and the Albanese morphism of (X, ) in both characteristic (X, ) and characteristic (X, ) . In particular in characteristic (X, ) we generalize Kawamata's result to the cases of log canonial pairs, and in characteristic (X, ) we generalize a result of Hacon-Patakfalvi to the cases of log pairs. Moreover we show that if (X, ) is a normal projective threefold in characteristic (X, ) , the coefficients of the components of (X, ) are (X, ) and (X, ) is semiample, then the Albanese morphism of (X, ) is surjective under reasonable assumptions on (X, ) and the singularities of the general fibers of the Albanese morphism. This is a positive characteristic analog in dimension 3 of a result of Zhang on a conjecture of Demailly-Peternell-Schneider.

In this paper, we study time-periodic perturbation of classical systems with two degrees of freedom. A transition chain is established, by passing through small neighborhood of double resonant point, to connect any two cohomology classes corresponding to resonant frequencies. Applying the result to nearly integrable Hamiltonian systems with three degrees of freedom, one obtains a transition chain along which one is able to construct diffusion orbits suggested by Arnold in [A66].

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.

No abstract uploaded!

TheLpAleksandrovintegralcurvatureanditscorrespondingchar- acterization problem—the Lp Aleksandrov problem—were recently introduced by Huang, Lutwak, Yang, and Zhang. The current work presents a solution to the Lp Aleksandrov problem for origin-symmetric polytopes when −1 < p < 0.