共查询到20条相似文献,搜索用时 46 毫秒
1.
《Journal of Pure and Applied Algebra》2019,223(11):5030-5048
Take positive integers m, n and d. Let Y be an m-fold cyclic cover of ramified over a general hypersurface of degree md. In this paper we study the space of lines in Y and show that it is smooth of dimension if and . When , our result gives a formula on the number of m-contact order lines of X (see Definition 1.2). 相似文献
2.
3.
4.
5.
7.
8.
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 . 相似文献
9.
Zhouxin Li 《Journal of Differential Equations》2019,266(11):7264-7290
We prove the existence of positive solutions of the following singular quasilinear Schrödinger equations at critical growth via variational methods, where , , , , . It is interesting that we do not need to add a weight function to control . 相似文献
10.
Charles Almeida Aline V. Andrade Rosa M. Miró-Roig 《Journal of Pure and Applied Algebra》2019,223(4):1817-1831
Let be a minimal monomial Togliatti system of forms of degree d. In [4], Mezzetti and Miró-Roig proved that the minimal number of generators of lies in the interval . In this paper, we prove that for and , the integer values in cannot be realized as the number of minimal generators of a minimal monomial Togliatti system. We classify minimal monomial Togliatti systems of forms of degree d with or 3n (i.e. with the minimal number of generators reaching the border of the non-existence interval). Finally, we prove that for , and there exists a minimal monomial Togliatti system of forms of degree d with . 相似文献
11.
12.
13.
14.
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, can be partitioned into A and B such that is perfect and . We use and to denote a path and a cycle on t vertices, respectively. For two disjoint graphs and , we use to denote the graph with vertex set and edge set , and use to denote the graph with vertex set and edge set . In this paper, we prove that (i) -free graphs are perfectly divisible, (ii) if G is -free with , (iii) if G is -free, and (iv) if G is -free. 相似文献
16.
17.
18.
19.
20.