首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
In 1979, Bousfield defined an equivalence relation on the stable homotopy category. The set of Bousfield classes has some important subsets such as the distributive lattice DL of all classes E which are smash idempotent and the complete Boolean algebra cBA of closed classes. We provide examples of spectra that are in DL, but not in cBA; in particular, for every prime p, the Bousfield class of the Eilenberg–MacLane spectrum HFp is in DL?cBA.  相似文献   

2.
3.
4.
5.
We show that the quantized coordinate ring A:=kq[SL(N)] satisfies van den Bergh's analogue of Poincaré duality for Hochschild (co)homology with dualizing bimodule being Aσ, the A-bimodule which is A as k-vector space with right multiplication twisted by the modular automorphism σ of the Haar functional. This implies that HN2?1(A,Aσ)?k, generalizing our previous result for kq[SL(2)]. To cite this article: T. Hadfield, U. Krähmer, C. R. Acad. Sci. Paris, Ser. I 343 (2006).  相似文献   

6.
In this paper, we give sufficient conditions for a graph to have degree bounded trees. Let G be a connected graph and AV(G). We denote by σk(A) the minimum value of the degree sum in G of any k pairwise nonadjacent vertices of A, and by w(GA) the number of components of the subgraph GA of G induced by V(G)A. Our main results are the following: (i) If σk(A)|G|1, then G contains a tree T with maximum degree ⩽k and AV(T). (ii) If σkw(GA)(A)|A|1, then G contains a spanning tree T with dT(x)k for any xA. These are generalizations of the result by S. Win [S. Win, Existenz von Gerüsten mit Vorgeschriebenem Maximalgrad in Graphen, Abh. Math. Seminar Univ. Humburg 43 (1975) 263–267] and degree conditions are sharp.  相似文献   

7.
8.
9.
《Comptes Rendus Mathematique》2005,340(12):885-888
This Note presents a randomized method to approximate any vector v from some set TRn. The data one is given is the set T, and k scalar products (Xi,v)i=1k, where (Xi)i=1k are i.i.d. isotropic subgaussian random vectors in Rn, and kn. We show that with high probability any yT for which (Xi,y)i=1k is close to the data vector (Xi,v)i=1k will be a good approximation of v, and that the degree of approximation is determined by a natural geometric parameter associated with the set T. This extends and improves recent results by Candes and Tao. To cite this article: S. Mendelson et al., C. R. Acad. Sci. Paris, Ser. I 340 (2005).  相似文献   

10.
Let k be a non-Archimedean field, X a k-affinoid space and f an analytic function over X. We describe precisely how the geometric connected components of the spaces {xX||f(x)|?ε} behave with regards to ε. We also obtain a result concerning privileged neighbourhoods and adapt a theorem from complex analytic geometry about Noetherianity for germs of analytic functions. To cite this article: J. Poineau, C. R. Acad. Sci. Paris, Ser. I 343 (2006).  相似文献   

11.
For a smooth geometrically integral algebraic variety X over a field k of characteristic 0, we define the extended Picard complex UPic(X¯). It is a complex of length 2 which combines the Picard group Pic(X¯) and the group U(X¯):=k¯[X¯]×/k¯×, where k¯ is a fixed algebraic closure of k and X¯=X×kk¯. For a connected linear k-group G we compute the complex UPic(G¯) (up to a quasi-isomorphism) in terms of the algebraic fundamental group π1(G¯). We obtain similar results for a homogeneous space X of a connected k-group G. To cite this article: M. Borovoi, J. van Hamel, C. R. Acad. Sci. Paris, Ser. I 342 (2006).  相似文献   

12.
13.
In this work we present an enumeration algorithm for the generation of all Steiner trees containing a given set W of terminals of an unweighted graph G such that |W|=k, for a fixed positive integer k. The enumeration is performed within O(n) delay, where n=|V(G)| consequence of the algorithm is that the Steiner interval and the strong Steiner interval of a subset WV(G) can be computed in polynomial time, provided that the size of W is bounded by a constant.  相似文献   

14.
15.
Let N+(k)=2k/2k3/2f(k) and N?(k)=2k/2k1/2g(k) where f(k) and g(k)0 arbitrarily slowly as k. We show that the probability of a random 2-coloring of {1,2,,N+(k)} containing a monochromatic k-term arithmetic progression approaches 1, and the probability of a random 2-coloring of {1,2,,N?(k)} containing a monochromatic k-term arithmetic progression approaches 0, as k. This improves an upper bound due to Brown, who had established an analogous result for N+(k)=2klogkf(k).  相似文献   

16.
The main purpose of this Note is to show how a ‘nonlinear Korn's inequality on a surface’ can be established. This inequality implies in particular the following interesting per se sequential continuity property for a sequence of surfaces. Let ω be a domain in R2, let θ:ω¯R3 be a smooth immersion, and let θk:ω¯R3, k?1, be mappings with the following properties: They belong to the space H1(ω); the vector fields normal to the surfaces θk(ω), k?1, are well defined a.e. in ω and they also belong to the space H1(ω); the principal radii of curvature of the surfaces θk(ω) stay uniformly away from zero; and finally, the three fundamental forms of the surfaces θk(ω) converge in L1(ω) toward the three fundamental forms of the surface θ(ω) as k. Then, up to proper isometries of R3, the surfaces θk(ω) converge in H1(ω) toward the surface θ(ω) as k. To cite this article: P.G. Ciarlet et al., C. R. Acad. Sci. Paris, Ser. I 341 (2005).  相似文献   

17.
18.
19.
20.
Let A be an Abelian variety defined over a number field k. Let P be a point in A(k) and let X be a subgroup of A(k). Gajda and Kowalski asked in 2002 whether it is true that the point P belongs to X if and only if the point (Pmodp) belongs to (Xmodp) for all but finitely many primes p of k. We provide a counterexample.  相似文献   

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

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