In this paper, we present a cross-constrained variational method to study the Cauchy problem of the nonlinear Klein-Gordon equations with critical nonlinearity in two space dimensions. By constructing a type of cross-...In this paper, we present a cross-constrained variational method to study the Cauchy problem of the nonlinear Klein-Gordon equations with critical nonlinearity in two space dimensions. By constructing a type of cross-constrained variational problem and establishing so-called cross-invariant manifolds of the evolution flow, we establish a sharp threshold of global existence and blowup of it. Furthermore, we answer the question： How small are the initial data if the solution exists globally.展开更多
The global solution for a coupled nonlinear Klein-Gordon system in two- dimensional space was studied. First, a sharp threshold of blowup and global existence for the system was obtained by constructing a type of cros...The global solution for a coupled nonlinear Klein-Gordon system in two- dimensional space was studied. First, a sharp threshold of blowup and global existence for the system was obtained by constructing a type of cross-constrained variational problem and establishing so-called cross-invariant manifolds of the evolution flow. Then the result of how small the initial data for which the solution exists globally was proved by using the scaling argument.展开更多
A path in an edge-colored graph G is called a rainbow path if no two edges of the path are colored the same color.The minimum number of colors required to color the edges of G such that every pair of vertices are conn...A path in an edge-colored graph G is called a rainbow path if no two edges of the path are colored the same color.The minimum number of colors required to color the edges of G such that every pair of vertices are connec ted by at least k internally ver tex-disjoint rainbow paths is called the rainbow k-connectivity of the graph G,denoted by rck(G).For the random graph G(n,p),He and Liang got a sharp threshold function for the property rck(G(n,p))≤d.For the random equi-bipartite graph G(n,n,p),Fujita et.al.got a sharp threshold function for the property rck(G(n,n,p))≤3.They also posed the following problem:For d≥2,determine a sharp threshold function for the property rck(G)≤d,where G is another random graph model.This paper is to give a solution to their problem in the general random bipartite graph model G(m,n,p).展开更多
基金Supported by the National Natural Science Foundation of China(No.10771151,10801102,10726034)Sichuan Youth Sciences and Technology Foundation(07ZQ026-009)China Postdoctoral Science Foundation Funded Project.
文摘In this paper, we present a cross-constrained variational method to study the Cauchy problem of the nonlinear Klein-Gordon equations with critical nonlinearity in two space dimensions. By constructing a type of cross-constrained variational problem and establishing so-called cross-invariant manifolds of the evolution flow, we establish a sharp threshold of global existence and blowup of it. Furthermore, we answer the question： How small are the initial data if the solution exists globally.
基金Project supported by the National Natural Science Foundation of China (No.10271084)the Natural Science Foundation for Young Scholars of Sichuan Province of China (No.07JQ0094)
文摘The global solution for a coupled nonlinear Klein-Gordon system in two- dimensional space was studied. First, a sharp threshold of blowup and global existence for the system was obtained by constructing a type of cross-constrained variational problem and establishing so-called cross-invariant manifolds of the evolution flow. Then the result of how small the initial data for which the solution exists globally was proved by using the scaling argument.
基金This paper is supported by the National Natural Science Foundation of China(Nos.11871034,11531011)by the Natural Science Foundation of Jiangsu Province(No.BK20150169).
文摘A path in an edge-colored graph G is called a rainbow path if no two edges of the path are colored the same color.The minimum number of colors required to color the edges of G such that every pair of vertices are connec ted by at least k internally ver tex-disjoint rainbow paths is called the rainbow k-connectivity of the graph G,denoted by rck(G).For the random graph G(n,p),He and Liang got a sharp threshold function for the property rck(G(n,p))≤d.For the random equi-bipartite graph G(n,n,p),Fujita et.al.got a sharp threshold function for the property rck(G(n,n,p))≤3.They also posed the following problem:For d≥2,determine a sharp threshold function for the property rck(G)≤d,where G is another random graph model.This paper is to give a solution to their problem in the general random bipartite graph model G(m,n,p).
