首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
We prove the existence of positive solutions of the following singular quasilinear Schrödinger equations at critical growth
?Δu?λc(x)u?κα(Δ(|u|2α))|u|2α?2u=|u|q?2u+|u|2??2u,uD1,2(RN),
via variational methods, where λ0, c:RNR+, κ>0, 0<α<1/2, 2<q<2?. It is interesting that we do not need to add a weight function to control |u|q?2u.  相似文献   

2.
3.
We study two families of cyclotomic graphs and perfect codes in them. They are Cayley graphs on the additive group of Z[ζm]/A, with connection sets {±(ζmi+A):0im?1} and {±(ζmi+A):0i?(m)?1}, respectively, where ζm (m2) is an mth primitive root of unity, A a nonzero ideal of Z[ζm], and ? Euler's totient function. We call them the mth cyclotomic graph and the second kind mth cyclotomic graph, and denote them by Gm(A) and Gm?(A), respectively. We give a necessary and sufficient condition for D/A to be a perfect t-code in Gm?(A) and a necessary condition for D/A to be such a code in Gm(A), where t1 is an integer and D an ideal of Z[ζm] containing A. In the case when m=3,4, Gm((α)) is known as an Eisenstein–Jacobi and Gaussian networks, respectively, and we obtain necessary conditions for (β)/(α) to be a perfect t-code in Gm((α)), where 0α,βZ[ζm] with β dividing α. In the literature such conditions are known to be sufficient when m=4 and m=3 under an additional condition. We give a classification of all first kind Frobenius circulants of valency 2p and prove that they are all pth cyclotomic graphs, where p is an odd prime. Such graphs belong to a large family of Cayley graphs that are efficient for routing and gossiping.  相似文献   

4.
《Discrete Mathematics》2022,345(7):112866
Let G be a graph with n vertices. A path decomposition of G is a set of edge-disjoint paths containing all the edges of G. Let p(G) denote the minimum number of paths needed in a path decomposition of G. Gallai Conjecture asserts that if G is connected, then p(G)?n/2?. If G is allowed to be disconnected, then the upper bound ?34n? for p(G) was obtained by Donald [7], which was improved to ?23n? independently by Dean and Kouider [6] and Yan [14]. For graphs consisting of vertex-disjoint triangles, ?23n? is reached and so this bound is tight. If triangles are forbidden in G, then p(G)?g+12gn? can be derived from the result of Harding and McGuinness [11], where g denotes the girth of G. In this paper, we also focus on triangle-free graphs and prove that p(G)?3n/5?, which improves the above result with g=4.  相似文献   

5.
We study the non-linear minimization problem on H01(Ω)?Lq with q=2nn?2, α>0 and n4:
infuH01(Ω)6u6Lq=1?Ωa(x,u)|?u|2?λΩ|u|2
where a(x,s) presents a global minimum α at (x0,0) with x0Ω. In order to describe the concentration of u(x) around x0, one needs to calibrate the behavior of a(x,s) with respect to s. The model case is
infuH01(Ω)6u6Lq=1?Ω(α+|x|β|u|k)|?u|2?λΩ|u|2.
In a previous paper dedicated to the same problem with λ=0, we showed that minimizers exist only in the range β<kn/q, which corresponds to a dominant non-linear term. On the contrary, the linear influence for βkn/q prevented their existence. The goal of this present paper is to show that for 0<λαλ1(Ω), 0kq?2 and β>kn/q+2, minimizers do exist.  相似文献   

6.
7.
8.
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).  相似文献   

9.
We consider the nonlinear problem of inhomogeneous Allen–Cahn equation
?2Δu+V(y)u(1?u2)=0inΩ,?u?ν=0on?Ω,
where Ω is a bounded domain in R2 with smooth boundary, ? is a small positive parameter, ν denotes the unit outward normal of ?Ω, V is a positive smooth function on Ω¯. Let Γ be a curve intersecting orthogonally with ?Ω at exactly two points and dividing Ω into two parts. Moreover, Γ satisfies stationary and non-degenerate conditions with respect to the functional ΓV1/2. We can prove that there exists a solution u? such that: as ?0, u? approaches +1 in one part of Ω, while tends to ?1 in the other part, except a small neighborhood of Γ.  相似文献   

10.
In this paper we study the following type of the Schrödinger–Poisson–Slater equation with critical growth
?u+(u2?1|4πx|)u=μ|u|p?1u+|u|4u,inR3,
where μ>0 and p(11/7,5). For the case of p(2,5). We develop a novel perturbation approach, together with the well-known Mountion–Pass theorem, to prove the existence of positive ground states. For the case of p=2, we obtain the nonexistence of nontrivial solutions by restricting the range of μ and also study the existence of positive solutions by the constrained minimization method. For the case of p(11/7,2), we use a truncation technique developed by Brezis and Oswald [9] together with a measure representation concentration-compactness principle due to Lions [27] to prove the existence of radial symmetrical positive solutions for μ(0,μ?) with some μ?>0. The above results nontrivially extend some theorems on the subcritical case obtained by Ianni and Ruiz [18] to the critical case.  相似文献   

11.
Let GP (q2,m) be the m-Paley graph defined on the finite field with order q2. We study eigenfunctions and maximal cliques in generalised Paley graphs GP (q2,m), where m|(q+1). In particular, we explicitly construct maximal cliques of size q+1m or q+1m+1 in GP (q2,m), and show the weight-distribution bound on the cardinality of the support of an eigenfunction is tight for the smallest eigenvalue q+1m of GP (q2,m). These new results extend the work of Baker et al. and Goryainov et al. on Paley graphs of square order. We also study the stability of the Erdős-Ko-Rado theorem for GP (q2,m) (first proved by Sziklai).  相似文献   

12.
We study ground states of two-component Bose–Einstein condensates (BEC) with trapping potentials in R2, where the intraspecies interaction (?a1,?a2) and the interspecies interaction ?β are both attractive, i.e, a1, a2 and β are all positive. The existence and non-existence of ground states are classified completely by investigating equivalently the associated L2-critical constraint variational problem. The uniqueness and symmetry-breaking of ground states are also analyzed under different types of trapping potentials as ββ?=a?+(a??a1)(a??a2), where 0<ai<a?:=6w622 (i=1,2) is fixed and w is the unique positive solution of Δw?w+w3=0 in R2. The semi-trivial limit behavior of ground states is tackled in the companion paper [12].  相似文献   

13.
The paper investigates longtime dynamics of the Kirchhoff wave equation with strong damping and critical nonlinearities: utt?(1+??u2)Δu?Δut+h(ut)+g(u)=f(x), with ?[0,1]. The well-posedness and the existence of global and exponential attractors are established, and the stability of the attractors on the perturbation parameter ? is proved for the IBVP of the equation provided that both nonlinearities h(s) and g(s) are of critical growth.  相似文献   

14.
We are concerned with the following singularly perturbed Gross–Pitaevskii equation describing Bose–Einstein condensation of trapped dipolar quantum gases:
{?ε2Δu+V(x)u+λ1|u|2u+λ2(K?|u|2)u=0 in R3,u>0,uH1(R3),
where ε is a small positive parameter, λ1,λ2R, ? denotes the convolution, K(x)=1?3cos2?θ|x|3 and θ=θ(x) is the angle between the dipole axis determined by (0,0,1) and the vector x. Under certain assumptions on (λ1,λ2)R2, we construct a family of positive solutions uεH1(R3) which concentrates around the local minima of V as ε0. Our main results extend the results in J. Byeon and L. Jeanjean (2007) [6], which dealt with singularly perturbed Schrödinger equations with a local nonlinearity, to the nonlocal Gross–Pitaevskii type equation.  相似文献   

15.
《Discrete Mathematics》2022,345(10):113004
Let G be a graph. We say that G is perfectly divisible if for each induced subgraph H of G, V(H) can be partitioned into A and B such that H[A] is perfect and ω(H[B])<ω(H). We use Pt and Ct to denote a path and a cycle on t vertices, respectively. For two disjoint graphs F1 and F2, we use F1F2 to denote the graph with vertex set V(F1)V(F2) and edge set E(F1)E(F2), and use F1+F2 to denote the graph with vertex set V(F1)V(F2) and edge set E(F1)E(F2){xy|xV(F1) and yV(F2)}. In this paper, we prove that (i) (P5,C5,K2,3)-free graphs are perfectly divisible, (ii) χ(G)2ω2(G)?ω(G)?3 if G is (P5,K2,3)-free with ω(G)2, (iii) χ(G)32(ω2(G)?ω(G)) if G is (P5,K1+2K2)-free, and (iv) χ(G)3ω(G)+11 if G is (P5,K1+(K1K3))-free.  相似文献   

16.
17.
《Discrete Mathematics》2022,345(3):112717
A transversal set of a graph G is a set of vertices incident to all edges of G. The transversal number of G, denoted by τ(G), is the minimum cardinality of a transversal set of G. A simple graph G with no isolated vertex is called τ-critical if τ(G?e)<τ(G) for every edge eE(G). For any τ-critical graph G with τ(G)=t, it has been shown that |V(G)|2t by Erd?s and Gallai and that |E(G)|(t+12) by Erd?s, Hajnal and Moon. Most recently, it was extended by Gyárfás and Lehel to |V(G)|+|E(G)|(t+22). In this paper, we prove stronger results via spectrum. Let G be a τ-critical graph with τ(G)=t and |V(G)|=n, and let λ1 denote the largest eigenvalue of the adjacency matrix of G. We show that n+λ12t+1 with equality if and only if G is tK2, Ks+1(t?s)K2, or C2s?1(t?s)K2, where 2st; and in particular, λ1(G)t with equality if and only if G is Kt+1. We then apply it to show that for any nonnegative integer r, we have n(r+λ12)(t+r+12) and characterize all extremal graphs. This implies a pure combinatorial result that r|V(G)|+|E(G)|(t+r+12), which is stronger than Erd?s-Hajnal-Moon Theorem and Gyárfás-Lehel Theorem. We also have some other generalizations.  相似文献   

18.
《Discrete Mathematics》2022,345(10):113001
The linked double star Sc(n,m), where nm0, is the graph consisting of the union of two stars K1,n and K1,m with a path on c vertices joining the centers. Its Ramsey number r(Sc(n,m)) is the smallest integer r such that every 2-coloring of the edges of a Kr admits a monochromatic Sc(n,m). In this paper, we study the Ramsey numbers of linked double stars when c is odd. In particular, we establish bounds on the value of r(Sc(n,m)) and determine the exact value of r(Sc(n,m)) if nc, or if n?c2??2 and m=2.  相似文献   

19.
20.
We are concerned with the existence of blowing-up solutions to the following boundary value problem
?Δu=λa(x)eu?4πNδ0 in Ω,u=0 on ?Ω,
where Ω is a smooth and bounded domain in R2 such that 0Ω, a(x) is a positive smooth function, N is a positive integer and λ>0 is a small parameter. Here δ0 defines the Dirac measure with pole at 0. We find conditions on the function a and on the domain Ω under which there exists a solution uλ blowing up at 0 and satisfying λΩa(x)euλ8π(N+1) as λ0+.  相似文献   

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

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