首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 109 毫秒
1.
2.
We are concerned with the following nonlinear Schrödinger equation ε2Δu+V(x)u=|u|p2u,uH1(RN),where N3, 2<p<2NN2. For ε small enough and a class of V(x), we show the uniqueness of the positive ground state under certain assumptions on asymptotic behavior of V(x) and its first derivatives. Here our results are suitable for a kind of V(x) which has different increasing rates at different directions.  相似文献   

3.
In this paper, we study the existence and concentration behavior of minimizers for iV(c)=infuSc?IV(u), here Sc={uH1(RN)|RNV(x)|u|2<+,|u|2=c>0} and
IV(u)=12RN(a|?u|2+V(x)|u|2)+b4(RN|?u|2)2?1pRN|u|p,
where N=1,2,3 and a,b>0 are constants. By the Gagliardo–Nirenberg inequality, we get the sharp existence of global constraint minimizers of iV(c) for 2<p<2? when V(x)0, V(x)Lloc(RN) and lim|x|+?V(x)=+. For the case p(2,2N+8N)\{4}, we prove that the global constraint minimizers uc of iV(c) behave like
uc(x)c|Qp|2(mcc)N2Qp(mccx?zc),
for some zcRN when c is large, where Qp is, up to translations, the unique positive solution of ?N(p?2)4ΔQp+2N?p(N?2)4Qp=|Qp|p?2Qp in RN and mc=(a2D12?4bD2i0(c)+aD12bD2)12, D1=Np?2N?42N(p?2) and D2=2N+8?Np4N(p?2).  相似文献   

4.
We consider the following Schrödinger equation 2Δu+V(x)u=Γ(x)f(u)inRN,where uH1(RN), u>0, >0 and f is superlinear and subcritical nonlinear term. We show that if V attains local minimum and Γ attains global maximum at the same point or V attains global minimum and Γ attains local maximum at the same point, then there exists a positive solution for sufficiently small >0.  相似文献   

5.
6.
This paper discusses the quasilinear Schrödinger equation Δu+V(x)uΔ[(1+u2)12]u2(1+u2)12=K(x)f(u),xRN,where N3. Under appropriate assumptions on the potentials V and K and local sublinear growth assumptions on the nonlinear term f, we get the existence of infinitely many nontrivial solutions by using a revised Clark theorem and a priori estimate of the solution.  相似文献   

7.
In this paper, we consider the following nonlinear elliptic equation involving the fractional Laplacian with critical exponent:
(?Δ)su=K(x)uN+2sN?2s,u>0inRN,
where s(0,1) and N>2+2s, K>0 is periodic in (x1,,xk) with 1k<N?2s2. Under some natural conditions on K near a critical point, we prove the existence of multi-bump solutions where the centers of bumps can be placed in some lattices in Rk, including infinite lattices. On the other hand, to obtain positive solution with infinite bumps such that the bumps locate in lattices in Rk, the restriction on 1k<N?2s2 is in some sense optimal, since we can show that for kN?2s2, no such solutions exist.  相似文献   

8.
Let rk(C2m+1) be the k-color Ramsey number of an odd cycle C2m+1 of length 2m+1. It is shown that for each fixed m2, rk(C2m+1)<ckk!for all sufficiently large k, where c=c(m)>0 is a constant. This improves an old result by Bondy and Erd?s (1973).  相似文献   

9.
10.
We are concerned with magneto-micropolar fluid equations (1.3)(1.4). The global existence of solutions to the Cauchy problem is investigated under certain conditions. Precisely, for the magneto-micropolar-Navier–Stokes (MMNS) system, we obtain global existence and large time behavior of solutions near a constant states in R3. Appealing to a refined pure energy method, we first obtain a global existence theorem by assuming that the H3 norm of the initial data is small, but the higher order derivatives can be arbitrary large. If the initial data belongs to homogeneous Sobolev norms H˙?s (0s<32) or homogeneous Besov norms B˙2,?s (0<s32), we obtain the optimal decay rates of the solutions and its higher order derivatives. As an immediate byproduct, we also obtain the usual Lp?L2 (1p2) type of the decay rates without requiring that the Lp norm of initial data is small. At last, we derive a weak solution to (1.3)(1.4) in R2 with large initial data.  相似文献   

11.
Yi Zhang  Mei Lu 《Discrete Mathematics》2019,342(6):1731-1737
A matching in a 3-uniform hypergraph is a set of pairwise disjoint edges. We use E3(2d?1,n?2d+1) to denote the 3-uniform hypergraph whose vertex set can be partitioned into two vertex classes V1 and V2 of size 2d?1 and n?2d+1, respectively, and whose edge set consists of all the triples containing at least two vertices of V1. Let H be a 3-uniform hypergraph of order n13d with no isolated vertex and deg(u)+deg(v)>2(n?12?n?d2) for any two adjacent vertices u,vV(H). In this paper, we show that H contains a matching of size d if and only if H is not a subgraph of E3(2d?1,n?2d+1). This result improves our previous one in Zhang and Lu (2018).  相似文献   

12.
For k given graphs G1,G2,,Gk, k2, the k-color Ramsey number, denoted by R(G1,G2,,Gk), is the smallest integer N such that if we arbitrarily color the edges of a complete graph of order N with k colors, then it always contains a monochromatic copy of Gi colored with i, for some 1ik. Let Cm be a cycle of length m and K1,n a star of order n+1. In this paper, firstly we give a general upper bound of R(C4,C4,,C4,K1,n). In particular, for the 3-color case, we have R(C4,C4,K1,n)n+4n+5+3 and this bound is tight in some sense. Furthermore, we prove that R(C4,C4,K1,n)n+4n+5+2 for all n=?2?? and ?2, and if ? is a prime power, then the equality holds.  相似文献   

13.
In 2009, Kyaw proved that every n-vertex connected K1,4-free graph G with σ4(G)n?1 contains a spanning tree with at most 3 leaves. In this paper, we prove an analogue of Kyaw’s result for connected K1,5-free graphs. We show that every n-vertex connected K1,5-free graph G with σ5(G)n?1 contains a spanning tree with at most 4 leaves. Moreover, the degree sum condition “σ5(G)n?1” is best possible.  相似文献   

14.
The Erd?s–Gallai Theorem states that every graph of average degree more than l?2 contains a path of order l for l2. In this paper, we obtain a stability version of the Erd?s–Gallai Theorem in terms of minimum degree. Let G be a connected graph of order n and F=(?i=1kP2ai)?(?i=1lP2bi+1) be k+l disjoint paths of order 2a1,,2ak,2b1+1,,2bl+1, respectively, where k0, 0l2, and k+l2. If the minimum degree δ(G)i=1kai+i=1lbi?1, then F?G except several classes of graphs for sufficiently large n, which extends and strengths the results of Ali and Staton for an even path and Yuan and Nikiforov for an odd path.  相似文献   

15.
We look for positive solutions for the singular equation Δu12xu=μh(x)uq1+λu+u(N+2)/(N2),in RN, where N3, λ>0, μ>0 is a parameter, 0<q<1 and h has some summability properties. By using a perturbation method and critical point theory, we obtain two solutions when max{1,N/4}<λ<N/2 and the parameter μ>0 is small.  相似文献   

16.
Refined structures of blowup for non-collapsing maximal solution to a semilinear parabolic equation
ut?u=|u|p?1u
with p>1 are studied. We will prove that the blowup set is empty for non-collapsing blowing-up in subcritical case, and all finite time non-collapsing blowing-up must be refined type II in critical case. When p>pSN+2N?2 for N3, the Hausdorff dimension of the blowup set for maximal solution whose energy is non-collapsing is shown to be no greater than N?2?4p?1, which answers a question proposed in [7] positively. At the end of this paper, we also present some new examples of collapsing and non-collapsing blowups.  相似文献   

17.
18.
It was proved by J. Schatz that the covering radius of the second order Reed–Muller code RM(2,6) is 18 (Schatz (1981)). However, the covering radius of RM(2,7) has been an open problem for many years. In this paper, we prove that the covering radius of RM(2,7) is 40, which is the same as the covering radius of RM(2,7) in RM(3,7). As a corollary, we also find new upper bounds for the covering radius of RM(2,n), n=8,9,10.  相似文献   

19.
20.
Let G be a simple connected graph with n vertices and m edges. The spectral radius ρ(G) of G is the largest eigenvalue of its adjacency matrix. In this paper, we firstly consider the effect on the spectral radius of a graph by removing a vertex, and then as an application of the result, we obtain a new sharp upper bound of ρ(G) which improves some known bounds: If (k?2)(k?3)2m?nk(k?3)2, where k(3kn) is an integer, then ρ(G)2m?n?k+52+2m?2n+94.The equality holds if and only if G is a complete graph Kn or K4?e, where K4?e is the graph obtained from K4 by deleting some edge e.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号