首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
In this note, we mainly study the relation between the sign of (?Δ)pu and (?Δ)p?iu in Rn with p?2 and n?2 for 1?i?p?1. Given the differential inequality (?Δ)pu<0, first we provide several sufficient conditions so that (?Δ)p?1u<0 holds. Then we provide conditions such that (?Δ)iu<0 for all i=1,2,,p?1, which is known as the sub poly-harmonic property for u. In the last part of the note, we revisit the super poly-harmonic property for solutions to (?Δ)pu=e2pu and (?Δ)pu=uq with q>0 in Rn.  相似文献   

3.
4.
5.
6.
7.
8.
9.
Let q be a positive integer. Recently, Niu and Liu proved that, if nmax?{q,1198?q}, then the product (13+q3)(23+q3)?(n3+q3) is not a powerful number. In this note, we prove (1) that, for any odd prime power ? and nmax?{q,11?q}, the product (1?+q?)(2?+q?)?(n?+q?) is not a powerful number, and (2) that, for any positive odd integer ?, there exists an integer Nq,? such that, for any positive integer nNq,?, the product (1?+q?)(2?+q?)?(n?+q?) is not a powerful number.  相似文献   

10.
11.
12.
13.
We give all even perfect (resp. unitary perfect) polynomials over the prime field F2 of the form xa(x+1)bM1h1?Mrhr, where each Mi is a Mersenne irreducible polynomial, hi=2ni?1 (resp. hi=2ni) and a,b,r,niN. In particular, we characterize nine of the eleven known “sporadic” even perfect polynomials over F2 that have the above form.  相似文献   

14.
15.
Very recently, Thomassé et al. (2017) have given an FPT algorithm for Weighted Independent Set in bull-free graphs parameterized by the weight of the solution, running in time 2O(k5)?n9. In this article we improve this running time to 2O(k2)?n7. As a byproduct, we also improve the previous Turing-kernel for this problem from O(k5) to O(k2). Furthermore, for the subclass of bull-free graphs without holes of length at most 2p?1 for p3, we speed up the running time to 2O(k?k1p?1)?n7. As p grows, this running time is asymptotically tight in terms of k, since we prove that for each integer p3, Weighted Independent Set cannot be solved in time 2o(k)?nO(1) in the class of {bull,C4,,C2p?1}-free graphs unless the ETH fails.  相似文献   

16.
17.
Recently, Mubayi and Wang showed that for r4 and ?3, the number of n-vertex r-graphs that do not contain any loose cycle of length ? is at most 2O(nr?1(logn)(r?3)(r?2)). We improve this bound to 2O(nr?1loglogn).  相似文献   

18.
19.
We define a family KV(g,n+1) of Kashiwara–Vergne problems associated with compact connected oriented 2-manifolds of genus g with n+1 boundary components. The problem KV(0,3) is the classical Kashiwara–Vergne problem from Lie theory. We show the existence of solutions to KV(g,n+1) for arbitrary g and n. The key point is the solution to KV(1,1) based on the results by B. Enriquez on elliptic associators. Our construction is motivated by applications to the formality problem for the Goldman–Turaev Lie bialgebra g(g,n+1). In more detail, we show that every solution to KV(g,n+1) induces a Lie bialgebra isomorphism between g(g,n+1) and its associated graded grg(g,n+1). For g=0, a similar result was obtained by G. Massuyeau using the Kontsevich integral. For g1, n=0, our results imply that the obstruction to surjectivity of the Johnson homomorphism provided by the Turaev cobracket is equivalent to the Enomoto–Satoh obstruction.  相似文献   

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

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