This paper is concerned with the orbital stability and orbital instability of solitary waves for some complex Hamiltonian systems in abstract form. Under some assumptions on the spectra of the related operator and the...This paper is concerned with the orbital stability and orbital instability of solitary waves for some complex Hamiltonian systems in abstract form. Under some assumptions on the spectra of the related operator and the decaying estimates of the semigroup, the sufficient conditions on orbital stability and instability are obtained.展开更多
We investigate the quasi-exact solutions of the Schrodinger wave equation for two-dimensional non-hermitian complex Hamiltonian systems within the frame work of an extended complex phase space characterized by x = x1 ...We investigate the quasi-exact solutions of the Schrodinger wave equation for two-dimensional non-hermitian complex Hamiltonian systems within the frame work of an extended complex phase space characterized by x = x1 ＋ ip3, y = x2 ＋ ip4, px= p1＋ ix3, py= p2 ＋ ix4. Explicit expressions of the energy eigenvalues and the eigenfunctions for ground and first excited states for a complex quartic potential are obtained. Eigenvalue spectra of some variants of the complex quartic potential, including PT-symmetrie one, are also worked out.展开更多
With a view to getting further insight into the solutions of one-dimensional analogous Schr?dinger equation for a non-hermitian (complex) Hamiltonian system, we investigate the quasi-exact PT- symmetric solutions for ...With a view to getting further insight into the solutions of one-dimensional analogous Schr?dinger equation for a non-hermitian (complex) Hamiltonian system, we investigate the quasi-exact PT- symmetric solutions for an octic potential and its variant using extended complex phase space approach characterized by x=x1+ip2, p=p1+ix2, where (x1, p1) and (x2, p2) are real and considered as canonical pairs. Besides the complexity of the phase space, complexity of potential parameters is also considered. The analyticity property of the eigenfunction alone is found sufficient to throw light on the nature of eigenvalue and eigenfunction of a system. The imaginary part of energy eigenvalue of a non-hermitian Hamiltonian exist for complex potential parameters and reduces to zero for real parameters. However, in the present work, it is found that imaginary component of the energy eigenvalue vanishes even when potential parameters are complex, provided that PT-symmetric condition is satisfied. Thus PT- symmetric version of a non-hermitian Hamiltonian possesses the real eigenvalue.展开更多
This paper proposes a novel four-dimensional approach to the structural study of protein complexes. In the approach, the surface of a protein molecule is to be described using the intersection of a pair of four-dimens...This paper proposes a novel four-dimensional approach to the structural study of protein complexes. In the approach, the surface of a protein molecule is to be described using the intersection of a pair of four-dimensional triangular cones (with multiple top vertexes). As a mathematical toy model of protein complexes, we consider complexes of closed trajectories of n-simplices (n=2,3,4...), where the design problem of protein complexes corresponds to an extended version of the Hamiltonian cycle problem. The problem is to find “a set of” closed trajectories of n-simplices which fills the n-dimensional region defined by a given pair of n+1 -dimensional triangular cones. Here we give a solution to the extended Hamiltonian cycle problem in the case of n=2 using the discrete differential geometry of triangles (i.e., 2-simplices).展开更多
Decision tree complexity is an important measure of computational complexity. A graph property is a set of graphs such that if some graph G is in the set then each isomorphic graph to G is also in the set. Let P be a ...Decision tree complexity is an important measure of computational complexity. A graph property is a set of graphs such that if some graph G is in the set then each isomorphic graph to G is also in the set. Let P be a graph property on n vertices, if every decision tree algorithm recognizing P must examine at least k pairs of vertices in the worst case, then it is said that the decision tree complexity of P is k. If every decision tree algorithm recognizing P must examine all n(n-1)/2 pairs of vertices in the worst case, then P is said to be elusive. Karp conjectured that every nontrivial monotone graph property is elusive. This paper concerns the elusiveness of Hamiltonian property. It is proved that if n=p+1, pp or pq+1, (where p,q are distinct primes), then Hamiltonian property on n vertices is elusive.展开更多
基金The research is supported by the National Nature Science Foundation of China 10271082 and Beijing Natural Science Foundation 1052003 and FBEC（KJ200310028010）. Acknowledgement The author is very grateful to Professor Yaping Wu for her guidance, useful advice and constant encouragement.
文摘This paper is concerned with the orbital stability and orbital instability of solitary waves for some complex Hamiltonian systems in abstract form. Under some assumptions on the spectra of the related operator and the decaying estimates of the semigroup, the sufficient conditions on orbital stability and instability are obtained.
文摘We investigate the quasi-exact solutions of the Schrodinger wave equation for two-dimensional non-hermitian complex Hamiltonian systems within the frame work of an extended complex phase space characterized by x = x1 ＋ ip3, y = x2 ＋ ip4, px= p1＋ ix3, py= p2 ＋ ix4. Explicit expressions of the energy eigenvalues and the eigenfunctions for ground and first excited states for a complex quartic potential are obtained. Eigenvalue spectra of some variants of the complex quartic potential, including PT-symmetrie one, are also worked out.
文摘With a view to getting further insight into the solutions of one-dimensional analogous Schr?dinger equation for a non-hermitian (complex) Hamiltonian system, we investigate the quasi-exact PT- symmetric solutions for an octic potential and its variant using extended complex phase space approach characterized by x=x1+ip2, p=p1+ix2, where (x1, p1) and (x2, p2) are real and considered as canonical pairs. Besides the complexity of the phase space, complexity of potential parameters is also considered. The analyticity property of the eigenfunction alone is found sufficient to throw light on the nature of eigenvalue and eigenfunction of a system. The imaginary part of energy eigenvalue of a non-hermitian Hamiltonian exist for complex potential parameters and reduces to zero for real parameters. However, in the present work, it is found that imaginary component of the energy eigenvalue vanishes even when potential parameters are complex, provided that PT-symmetric condition is satisfied. Thus PT- symmetric version of a non-hermitian Hamiltonian possesses the real eigenvalue.
文摘This paper proposes a novel four-dimensional approach to the structural study of protein complexes. In the approach, the surface of a protein molecule is to be described using the intersection of a pair of four-dimensional triangular cones (with multiple top vertexes). As a mathematical toy model of protein complexes, we consider complexes of closed trajectories of n-simplices (n=2,3,4...), where the design problem of protein complexes corresponds to an extended version of the Hamiltonian cycle problem. The problem is to find “a set of” closed trajectories of n-simplices which fills the n-dimensional region defined by a given pair of n+1 -dimensional triangular cones. Here we give a solution to the extended Hamiltonian cycle problem in the case of n=2 using the discrete differential geometry of triangles (i.e., 2-simplices).
文摘Decision tree complexity is an important measure of computational complexity. A graph property is a set of graphs such that if some graph G is in the set then each isomorphic graph to G is also in the set. Let P be a graph property on n vertices, if every decision tree algorithm recognizing P must examine at least k pairs of vertices in the worst case, then it is said that the decision tree complexity of P is k. If every decision tree algorithm recognizing P must examine all n(n-1)/2 pairs of vertices in the worst case, then P is said to be elusive. Karp conjectured that every nontrivial monotone graph property is elusive. This paper concerns the elusiveness of Hamiltonian property. It is proved that if n=p+1, pp or pq+1, (where p,q are distinct primes), then Hamiltonian property on n vertices is elusive.
