首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
2.
3.
4.
5.
6.
Let Sd denote the unit sphere in the Euclidean space Rd+1(d1). We develop LeVeque type inequalities for the discrepancy between the rotationally invariant probability measure and the normalized counting measures on Sd. We obtain both upper bound and lower bound estimates. We then use these inequalities to estimate the discrepancy of the normalized counting measures associated with minimal energy configurations on Sd.  相似文献   

7.
8.
Consider a branching random walk, where the underlying branching mechanism is governed by a Galton–Watson process and the migration of particles by a simple random walk in Zd. Denote by Zn(z) the number of particles of generation n located at site zZd. We give the second order asymptotic expansion for Zn(z). The higher order expansion can be derived by using our method here. As a by-product, we give the second order expansion for a simple random walk on Zd, which is used in the proof of the main theorem and is of independent interest.  相似文献   

9.
For a supercritical catalytic branching random walk on Zd, dN, with an arbitrary finite catalysts set we study the spread of particles population as time grows to infinity. It is shown that in the result of the proper normalization of the particles positions in the limit there are a.s. no particles outside the closed convex surface in Rd which we call the propagation front and, under condition of infinite number of visits of the catalysts set, a.s. there exist particles on the propagation front. We also demonstrate that the propagation front is asymptotically densely populated and derive its alternative representation.  相似文献   

10.
11.
Let Xn be a hypersurface in Pn+1 with n1 defined over a finite field Fq of q elements. In this note, we classify, up to projective equivalence, hypersurfaces Xn as above which reach two elementary upper bounds for the number of Fq-points on Xn which involve a Thas’ invariant.  相似文献   

12.
13.
14.
15.
16.
17.
18.
An index ?, length m? quasi-cyclic code can be viewed as a cyclic code of length m over the field Fq? via a basis of the extension Fq?Fq. However, this cyclic code is only linear over Fq, making it an additive cyclic code, or an Fq-linear cyclic code, over the alphabet Fq?. This approach was recently used in Shi et al. (2017) [16] to study a class of quasi-cyclic codes, and more importantly in Shi et al. (2017) [17] to settle a long-standing question on the asymptotic performance of cyclic codes. Here, we answer one of the problems posed in these two articles, and characterize those quasi-cyclic codes which have Fq?-linear cyclic images under a basis of the extension Fq?Fq. Our characterizations are based on the module structure of quasi-cyclic codes, as well as on their CRT decompositions into constituents. In the case of a polynomial basis, we characterize the constituents by using the theory of invariant subspaces of operators. We also observe that analogous results extend to the case of quasi-twisted codes.  相似文献   

19.
20.
We study the projective logarithmic potential Gμ of a probability measure μ on the complex projective space Pn. We prove that the range of the operator μ?Gμ is contained in the (local) domain of definition of the complex Monge–Ampère operator acting on the class of quasi-plurisubharmonic functions on Pn with respect to the Fubini–Study metric. Moreover, when the measure μ has no atom, we show that the complex Monge–Ampère measure of its logarithmic potential is an absolutely continuous measure with respect to the Fubini–Study volume form on Pn.  相似文献   

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

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