首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
In this article, we prove that the compact simple Lie groups SU(n) for n6, SO(n) for n7, Sp(n) for n3, E6,E7,E8, and F4 admit left-invariant Einstein metrics that are not geodesic orbit. This gives a positive answer to an open problem recently posed by Nikonorov.  相似文献   

2.
In this paper we define odd dimensional unitary groups U2n+1(R,Δ). These groups contain as special cases the odd dimensional general linear groups GL2n+1(R) where R is any ring, the odd dimensional orthogonal and symplectic groups O2n+1(R) and Sp2n+1(R) where R is any commutative ring and further the first author's even dimensional unitary groups U2n(R,Λ) where (R,Λ) is any form ring. We classify the E-normal subgroups of the groups U2n+1(R,Δ) (i.e. the subgroups which are normalized by the elementary subgroup EU2n+1(R,Δ)), under the condition that R is either a semilocal or quasifinite ring with involution and n3. Further we investigate the action of U2n+1(R,Δ) by conjugation on the set of all E-normal subgroups.  相似文献   

3.
4.
5.
6.
This contribution is concerned with Gumbel limiting results for supremum Mn=supt[0,Tn]?|Xn(t)| with Xn,nN2 centered Gaussian random fields with continuous trajectories. We show first the convergence of a related point process to a Poisson point process thereby extending previous results obtained in [8] for Gaussian processes. Furthermore, we derive Gumbel limit results for Mn as n and show a second-order approximation for E{Mnp}1/p for any p1.  相似文献   

7.
Let V be an n-dimensional vector space over the finite field consisting of q elements and let Γk(V) be the Grassmann graph formed by k-dimensional subspaces of V, 1<k<n1. Denote by Γ(n,k)q the restriction of Γk(V) to the set of all non-degenerate linear [n,k]q codes. We show that for any two codes the distance in Γ(n,k)q coincides with the distance in Γk(V) only in the case when n<(q+1)2+k2, i.e. if n is sufficiently large then for some pairs of codes the distances in the graphs Γk(V) and Γ(n,k)q are distinct. We describe one class of such pairs.  相似文献   

8.
9.
10.
The edit distance problem for rooted unordered trees is known to be NP-hard. Based on this fact, this paper studies exponential-time algorithms for the problem. For a general case, an O(min(1.26n1+n2,2b1+b2poly(n1,n2))) time algorithm is presented, where n1 and n2 are the numbers of nodes and b1 and b2 are the numbers of branching nodes in two input trees. This algorithm is obtained by a combination of dynamic programming, exhaustive search, and maximum weighted bipartite matching. For bounded degree trees over a fixed alphabet, it is shown that the problem can be solved in O((1+ϵ)n1+n2) time for any fixed ϵ>0. This result is achieved by avoiding duplicate calculations for identical subsets of small subtrees.  相似文献   

11.
12.
The purpose of this article is to compute the mod 2 cohomology of Γq(K), the mapping class group of the Klein bottle with q marked points. We provide a concrete construction of Eilenberg–MacLane spaces Xq=K(Γq(K),1) and fiber bundles Fq(K)/ΣqXqB(Z2×O(2)), where Fq(K)/Σq denotes the configuration space of unordered q-tuples of distinct points in K and B(Z2×O(2)) is the classifying space of the group Z2×O(2). Moreover, we show the mod 2 Serre spectral sequence of the bundle above collapses.  相似文献   

13.
14.
15.
16.
17.
Let Ω?Rn be a bounded domain satisfying a Hayman-type asymmetry condition, and let D be an arbitrary bounded domain referred to as an “obstacle”. We are interested in the behavior of the first Dirichlet eigenvalue λ1(Ω?(x+D)).First, we prove an upper bound on λ1(Ω?(x+D)) in terms of the distance of the set x+D to the set of maximum points x0 of the first Dirichlet ground state ?λ1>0 of Ω. In short, a direct corollary is that if
(1)μΩ:=maxx?λ1(Ω?(x+D))
is large enough in terms of λ1(Ω), then all maximizer sets x+D of μΩ are close to each maximum point x0 of ?λ1.Second, we discuss the distribution of ?λ1(Ω) and the possibility to inscribe wavelength balls at a given point in Ω.Finally, we specify our observations to convex obstacles D and show that if μΩ is sufficiently large with respect to λ1(Ω), then all maximizers x+D of μΩ contain all maximum points x0 of ?λ1(Ω).  相似文献   

18.
Let n be a sufficiently large natural number and let B be an origin-symmetric convex body in Rnin the ?-position, and such that the space (Rn,6?6B) admits a 1-unconditional basis. Then for any ε(0,1/2], and for random cεlog?n/log?1ε-dimensional subspace E distributed according to the rotation-invariant (Haar) measure, the section BE is (1+ε)-Euclidean with probability close to one. This shows that the “worst-case” dependence on ε in the randomized Dvoretzky theorem in the ?-position is significantly better than in John's position. It is a previously unexplored feature, which has strong connections with the concept of superconcentration introduced by S. Chatterjee. In fact, our main result follows from the next theorem: Let B be as before and assume additionally that B has a smooth boundary and Eγn6?6BncEγn6gradB(?)62 for a small universal constant c>0, where gradB(?) is the gradient of 6?6B and γn is the standard Gaussian measure in Rn. Then for any p[1,clog?n] the p-th power of the norm 6?6Bp is Clog?n-superconcentrated in the Gauss space.  相似文献   

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

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