首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
Minimal blocking sets in PG(2,q2) have size at most q3+1. This result is due to Bruen and Thas and the bound is sharp, sets attaining this bound are called unitals. In this paper, we show that the second largest minimal blocking sets have size at most q3+1(p3)/2, if q=p, p67, or q=ph, p>7, h>1. Our proof also works for sets having at least one tangent at each of its points (that is, for tangency sets).  相似文献   

3.
4.
5.
We employ separation of variables to prove weighted resolvent estimates for the semiclassical Schrödinger operator ?h2Δ+V(|x|)?E in dimension n2, where h,E>0, and V:[0,)R is L and compactly supported. The weighted resolvent norm grows no faster than exp?(Ch?1), while an exterior weighted norm grows h?1. We introduce a new method based on the Mellin transform to handle the two-dimensional case.  相似文献   

6.
7.
8.
This paper deals with the chemotaxis-growth system: ut=Δu???(u?v)+μu(1?u), vt=Δv?v+w, τwt+δw=u in a smooth bounded domain Ω?R3 with zero-flux boundary conditions, where μ, δ, and τ are given positive parameters. It is shown that the solution (u,v,w) exponentially stabilizes to the constant stationary solution (1,1δ,1δ) in the norm of L(Ω) as t provided that μ>0 and any given nonnegative and suitably smooth initial data (u0,v0,w0) fulfills u0?0, which extends the condition μ>18δ2 in [8].  相似文献   

9.
10.
11.
12.
Let M be a random m×n rank-r matrix over the binary field F2, and let wt(M) be its Hamming weight, that is, the number of nonzero entries of M.We prove that, as m,n+ with r fixed and m/n tending to a constant, we have thatwt(M)12r2mn2r(12r)4(m+n)mn converges in distribution to a standard normal random variable.  相似文献   

13.
14.
15.
16.
17.
《Discrete Mathematics》2023,346(4):113304
In 1965 Erd?s asked, what is the largest size of a family of k-element subsets of an n-element set that does not contain a matching of size s+1? In this note, we improve upon a recent result of Frankl and resolve this problem for s>101k3 and (s+1)k?n<(s+1)(k+1100k).  相似文献   

18.
19.
Let χ be an order c multiplicative character of a finite field and f(x)=xd+λxe a binomial with (d,e)=1. We study the twisted classical and T-adic Newton polygons of f. When p>(de)(2d1), we give a lower bound of Newton polygons and show that they coincide if p does not divide a certain integral constant depending on pmodcd.We conjecture that this condition holds if p is large enough with respect to c,d by combining all known results and the conjecture given by Zhang-Niu. As an example, we show that it holds for e=d1.  相似文献   

20.
We consider four classes of polynomials over the fields Fq3, q=ph, p>3, f1(x)=xq2+q1+Axq2q+1+Bx, f2(x)=xq2+q1+Axq3q2+q+Bx, f3(x)=xq2+q1+Axq2Bx, f4(x)=xq2+q1+AxqBx, where A,BFq. We find sufficient conditions on the pairs (A,B) for which these polynomials permute Fq3 and we give lower bounds on the number of such pairs.  相似文献   

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

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