首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
3.
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.  相似文献   

4.
5.
6.
We study LpLr restriction estimates for algebraic varieties in d-dimensional vector spaces over finite fields. Unlike the Euclidean case, if the dimension d is even, then it is conjectured that the L(2d+2)/(d+3)L2 Stein–Tomas restriction result can be improved to the L(2d+4)/(d+4)L2 estimate for both spheres and paraboloids in finite fields. In this paper we show that the conjectured LpL2 restriction estimate holds in the specific case when test functions under consideration are restricted to d-coordinate functions or homogeneous functions of degree zero. To deduce our result, we use the connection between the restriction phenomena for our varieties in d dimensions and those for homogeneous varieties in (d+1) dimensions.  相似文献   

7.
8.
9.
10.
11.
The finite field analog of the classical Kakeya problem asks the smallest possible size for a set of points in the Desarguesian affine plane which contains a line in every direction. This problem has been definitively solved by Blokhuis and Mazzocca (2008), who show that in AG(2,s), s a prime power, the smallest possible size of such a set is 12s(s+1). In this paper we examine a new construction of an infinite family of sets in AG(2,s) containing a line in every direction, where s=qe with q a prime power and e an integer with e>1. These sets have size 12q2e+O(q2e1), which is small in the sense that the lower bound is also 12q2e plus smaller order terms. In addition, we discuss the minimality of our sets, showing that they contain no proper subset containing a line in every direction.  相似文献   

12.
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.  相似文献   

13.
14.
Let Ω?RN be a Lipschitz domain and Γ be a relatively open and non-empty subset of its boundary ?Ω. We show that the solution to the linear first-order system:(1)?ζ=Gζ,ζ|Γ=0, vanishes if GL1(Ω;R(N×N)×N) and ζW1,1(Ω;RN). In particular, square-integrable solutions ζ of (1) with GL1L2(Ω;R(N×N)×N) vanish. As a consequence, we prove that:???:C°(Ω,Γ;R3)[0,),u?6sym(?uP?1)6L2(Ω) is a norm if PL(Ω;R3×3) with CurlPLp(Ω;R3×3), CurlP?1Lq(Ω;R3×3) for some p,q>1 with 1/p+1/q=1 as well as detP?c+>0. We also give a new and different proof for the so-called ‘infinitesimal rigid displacement lemma’ in curvilinear coordinates: Let ΦH1(Ω;R3), Ω?R3, satisfy sym(?Φ??Ψ)=0 for some ΨW1,(Ω;R3)H2(Ω;R3) with det?Ψ?c+>0. Then there exists a constant translation vector aR3 and a constant skew-symmetric matrix Aso(3), such that Φ=AΨ+a.  相似文献   

15.
16.
17.
18.
19.
20.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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