共查询到20条相似文献,搜索用时 109 毫秒
1.
2.
We are concerned with the following nonlinear Schrödinger equation where , . For small enough and a class of , we show the uniqueness of the positive ground state under certain assumptions on asymptotic behavior of and its first derivatives. Here our results are suitable for a kind of which has different increasing rates at different directions. 相似文献
3.
In this paper, we study the existence and concentration behavior of minimizers for , here and where and are constants. By the Gagliardo–Nirenberg inequality, we get the sharp existence of global constraint minimizers of for when , and . For the case , we prove that the global constraint minimizers of behave like for some when c is large, where is, up to translations, the unique positive solution of in and , and . 相似文献
4.
We consider the following Schrödinger equation where , , and is superlinear and subcritical nonlinear term. We show that if attains local minimum and attains global maximum at the same point or attains global minimum and attains local maximum at the same point, then there exists a positive solution for sufficiently small . 相似文献
5.
6.
This paper discusses the quasilinear Schrödinger equation where . Under appropriate assumptions on the potentials and and local sublinear growth assumptions on the nonlinear term , 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: where and , is periodic in with . 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 , including infinite lattices. On the other hand, to obtain positive solution with infinite bumps such that the bumps locate in lattices in , the restriction on is in some sense optimal, since we can show that for , no such solutions exist. 相似文献
8.
Let be the -color Ramsey number of an odd cycle of length . It is shown that for each fixed , for all sufficiently large , where 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 . Appealing to a refined pure energy method, we first obtain a global existence theorem by assuming that the 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 or homogeneous Besov norms , we obtain the optimal decay rates of the solutions and its higher order derivatives. As an immediate byproduct, we also obtain the usual type of the decay rates without requiring that the norm of initial data is small. At last, we derive a weak solution to (1.3)–(1.4) in with large initial data. 相似文献
11.
A matching in a 3-uniform hypergraph is a set of pairwise disjoint edges. We use to denote the 3-uniform hypergraph whose vertex set can be partitioned into two vertex classes and of size and , respectively, and whose edge set consists of all the triples containing at least two vertices of . Let be a 3-uniform hypergraph of order with no isolated vertex and for any two adjacent vertices . In this paper, we show that contains a matching of size if and only if is not a subgraph of . This result improves our previous one in Zhang and Lu (2018). 相似文献
12.
For given graphs , , the -color Ramsey number, denoted by , is the smallest integer such that if we arbitrarily color the edges of a complete graph of order with colors, then it always contains a monochromatic copy of colored with , for some . Let be a cycle of length and a star of order . In this paper, firstly we give a general upper bound of . In particular, for the 3-color case, we have and this bound is tight in some sense. Furthermore, we prove that for all and , and if is a prime power, then the equality holds. 相似文献
13.
In 2009, Kyaw proved that every -vertex connected -free graph with contains a spanning tree with at most 3 leaves. In this paper, we prove an analogue of Kyaw’s result for connected -free graphs. We show that every -vertex connected -free graph with contains a spanning tree with at most 4 leaves. Moreover, the degree sum condition “” is best possible. 相似文献
14.
The Erd?s–Gallai Theorem states that every graph of average degree more than contains a path of order for . In this paper, we obtain a stability version of the Erd?s–Gallai Theorem in terms of minimum degree. Let be a connected graph of order and be disjoint paths of order respectively, where , , and . If the minimum degree , then except several classes of graphs for sufficiently large , 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 where , , is a parameter, and has some summability properties. By using a perturbation method and critical point theory, we obtain two solutions when and the parameter is small. 相似文献
16.
Shi-Zhong Du 《Journal of Differential Equations》2019,266(9):5942-5970
Refined structures of blowup for non-collapsing maximal solution to a semilinear parabolic equation with 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 for , the Hausdorff dimension of the blowup set for maximal solution whose energy is non-collapsing is shown to be no greater than , 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.
Qichun Wang 《Discrete Mathematics》2019,342(12):111625
It was proved by J. Schatz that the covering radius of the second order Reed–Muller code is 18 (Schatz (1981)). However, the covering radius of has been an open problem for many years. In this paper, we prove that the covering radius of is 40, which is the same as the covering radius of in . As a corollary, we also find new upper bounds for the covering radius of , . 相似文献
19.
20.
Let be a simple connected graph with vertices and edges. The spectral radius of 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 which improves some known bounds: If , where is an integer, then The equality holds if and only if is a complete graph or , where is the graph obtained from by deleting some edge . 相似文献