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

3.
In the infinite-dimensional separable complex Hilbert space we construct new abstract examples of unbounded maximal accretive and maximal sectorial operators B for which domB12domB?12. New criterions for the equality are established.  相似文献   

4.
5.
The magnetohydrodynamic (MHD) equations have played pivotal roles in the study of many phenomena in geophysics, astrophysics, cosmology and engineering. The fundamental problem of whether or not classical solutions of the 3D MHD equations can develop finite-time singularities remains an outstanding open problem. Mathematically this problem is supercritical in the sense that the 3D MHD equations do not have enough dissipation. If we replace the standard velocity dissipation Δu and the magnetic diffusion Δb by ?(?Δ)αu and ?(?Δ)βb, respectively, the resulting equations with α54 and α+β52 then always have global classical solutions. An immediate issue is whether or not the hyperdissipation can be further reduced. This paper shows that the global regularity still holds even if there is only directional velocity dissipation and horizontal magnetic diffusion ?(?Δh)54b, where Δh=?12+?22.  相似文献   

6.
7.
Let N2. If gLc1(RN) has zero integral, then the equation divX=g need not have a solution XWloc1,1(RN;RN) [6] or even XLlocN/(N?1) (RN;RN) [2]. Using these results, we prove that, whenever N3 and 2?N?1, there exists some ?-form fLc1(RN;Λ?) such that df=0 and the equation dλ=f has no solution λWloc1,1(RN;Λ??1). This provides a negative answer to a question raised by Baldi, Franchi, and Pansu [1].  相似文献   

8.
We characterize all finite metabelian 2-groups G whose abelianizations Gab are of type (2,2n), with n2, and for which their commutator subgroups G have rank=2. This is given in terms of the order of the abelianizations of the maximal subgroups and the structure of the abelianizations of those normal subgroups of index 4 in G. We then translate these group theoretic properties to give a characterization of number fields k with 2-class group Cl2(k)?(2,2n), n2, such that the rank of Cl2(k1)=2 where k1 is the Hilbert 2-class field of k. In particular, we apply all this to real quadratic number fields whose discriminants are a sum of two squares.  相似文献   

9.
In this paper, we consider the following nonlinear elliptic equation involving the fractional Laplacian with critical exponent:
(?Δ)su=K(x)uN+2sN?2s,u>0inRN,
where s(0,1) and N>2+2s, K>0 is periodic in (x1,,xk) with 1k<N?2s2. Under some natural conditions on K near a critical point, we prove the existence of multi-bump solutions where the centers of bumps can be placed in some lattices in Rk, including infinite lattices. On the other hand, to obtain positive solution with infinite bumps such that the bumps locate in lattices in Rk, the restriction on 1k<N?2s2 is in some sense optimal, since we can show that for kN?2s2, no such solutions exist.  相似文献   

10.
11.
The paper deals with panchromatic 3-colorings of random hypergraphs. A vertex 3-coloring is said to be panchromatic for a hypergraph if every color can be found on every edge. Let H(n,k,p) denote the binomial model of a random k-uniform hypergraph on n vertices. For given fixed c>0, k3 and p=cnnk, we prove that if c<ln3332kln32O32kthen H(n,k,p) admits a panchromatic 3-coloring with probability tending to 1 as n, but if k is large enough and c>ln3332kln32+O34kthen H(n,k,p) does not admit a panchromatic 3-coloring with probability tending to 1 as n.  相似文献   

12.
We first give an example of a rigid structure of computable dimension 2 such that the unique isomorphism between two non-computably isomorphic computable copies has Turing degree strictly below 0, and not above 0. This gives a first example of a computable structure with a degree of categoricity that does not belong to an interval of the form [0(α),0(α+1)] for any computable ordinal α. We then extend the technique to produce a rigid structure of computable dimension 3 such that if d0, d1, and d2 are the degrees of isomorphisms between distinct representatives of the three computable equivalence classes, then each di<d0d1d2. The resulting structure is an example of a structure that has a degree of categoricity, but not strongly.  相似文献   

13.
14.
15.
《Discrete Mathematics》2023,346(1):113151
The Plurality problem - introduced by Aigner - has many variants. In this article we deal with the following version: suppose we are given n balls, each of them colored by one of three colors. A plurality ball is one such that its color class is strictly larger than any other color class. Questioner asks a triplet (or a k-set in general), and Adversary as an answer gives the partition of the triplet (or the k-set) into color classes. Questioner wants to find a plurality ball as soon as possible or show that there is no such ball, while Adversary wants to postpone this.We denote by Ap(n,k) the largest number of queries needed to ask in the worst case if both play optimally. We provide an almost precise result in the case of even n by proving that for n4 even we have34n?2Ap(n,3)34n?12, and for n3 odd we have34n?O(log?n)Ap(n,3)34n?12.We also prove some bounds on the number of queries needed to ask in the case k3.  相似文献   

16.
17.
We consider a d-parameter Hermite process with Hurst index H=(H1,..,Hd)12,1d and we study its limit behavior in distribution when the Hurst parameters Hi,i=1,..,d (or a part of them) converge to 12 and/or 1. The limit obtained is Gaussian (when at least one parameter tends to 12) and non-Gaussian (when at least one-parameter tends to 1 and none converges to 12).  相似文献   

18.
Let o be a complete discrete valuation ring with finite residue field k of odd characteristic, and let G be a symplectic or special orthogonal group scheme over o. For any ?N let G? denote the ?-th principal congruence subgroup of G(o). An irreducible character of the group G(o) is said to be regular if it is trivial on a subgroup G?+1 for some ?, and if its restriction to G?/G?+1?Lie(G)(k) consists of characters of minimal G(kalg)-stabilizer dimension. In the present paper we consider the regular characters of such classical groups over o, and construct and enumerate all regular characters of G(o), when the characteristic of k is greater than two. As a result, we compute the regular part of their representation zeta function.  相似文献   

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

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