首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 46 毫秒
1.
A hypersurface (not necessarily compact) of a hypersphereS n+1 of a Euclidean spaceE n+2 is of 2-type if and only if it has constant nonzero mean curvature inS n+1 and constant scalar curvature, unless it is a portion of a small hypersphere inS n+1. This shows that the 2-type compact hypersurfaces of a hypersphere are mass-symmetric.  相似文献   

2.
It is shown that the n-dimensional Klein bottle admits a Lagrangian embedding into \mathbbR2n{\mathbb{R}^{2n}} if and only if n is odd.  相似文献   

3.
In this paper, we show that a Cayley graph for an abelian group has an independent perfect domination set if and only if it is a covering graph of a complete graph. As an application, we show that the hypercube Qn has an independent perfect domination set if and only if Qn is a regular covering of the complete graph Kn+1 if and only if n = 2m ? 1 for some natural number m. © 2001 John Wiley & Sons, Inc. J Graph Theory 37: 213–219, 2001  相似文献   

4.
Shuang Zhang 《K-Theory》2001,24(3):203-225
We completely determine the homotopy groups n (.) of the unitary group and the space of projections of purely infinite simple C *-algebras in terms of K-theory. We also prove that the unitary group of a purely infinite simple C *-algebra A is a contractible topological space if and only if K0(A) = K1(A) = {0}, and again if and only if the unitary group of the associated generalized Calkin algebra L(HA) / K(HA) is contractible. The well-known Kuiper's theorem is extended to a new class of C *-algebras.  相似文献   

5.
We prove that C2,α(Ω ) solutions of problem (1.2) below are in Hm+2(Ω) for all m ∈ ?, if f and the coefficients are in Hm (Ω) n C0,α (Ω ) Previously, this result was explicitly known only if m> n/2 (or if m = 0). A similar result holds for the quasi-linear equation (1.11) below.  相似文献   

6.
Summary Let (R 2, 1) denote the graph withR 2 as the vertex set and two vertices adjacent if and only if their Euclidean distance is 1. The problem of determining the chromatic number(R 2, 1) is still open; however,(R 2, 1) is known to be between 4 and 7. By a theorem of de Bruijn and Erdös, it is enough to consider only finite subgraphs of (R 2, 1). By a recent theorem of Chilakamarri, it is enough to consider certain graphs on the integer lattice. More precisely, forr > 0, let (Z 2,r, ) denote a graph with vertex setZ 2 and two vertices adjacent if and only if their Euclidean distance is in the closed interval [r – ,r + ]. A simple graph is faithfully -recurring inZ 2 if there exists a real numberd > 0 such that, for arbitrarily larger, G is isomorphic to a subgraph of (Z 2,r, ) in which every pair of vertices are at least distancedr apart. Chilakamarri has shown that, ifG is a finite simple graph, thenG is isomorphic to a subgraph of (R 2, 1) if and only ifG is faithfully -recurring inZ 2. In this paper we prove that(Z 2,r, ) 5 for integersr 1. We also prove a Ramsey type result which states that for any integerr > 1, and any coloring ofZ 2 either there exists a monochromatic pair of vertices with their distance in the closed interval [r – ,r + ] or there exists a set of three vertices closest to each other with three distinct colors.  相似文献   

7.
We study the existence of a submanifoldF n of Euclidean spaceE n+p with prescribed Grassmannian image that degenerates into a line. We prove that is the Grassmannian image of a regular submanifoldF n of Euclidean spaceE n+p if and only if the curve in the Grassmann manifoldG + (p, n+p) is asymptoticallyC r -regular,r>1. HereG + (n, n+p) is embedded into the sphereS N ,N=C n+p p =( p n+p ), by the Plücker coordinates.Translated fromMatematicheskie Zametki, Vol. 59, No. 5, pp. 681–691, May, 1996.  相似文献   

8.
We show that a graph G on n ? q + 1 vertices (where q ? 2) has the chromatic polynomial P(G;λ) = λ(λ ? 1) … (λ ? q + 2) (λ ? q + 1)2 (λ ? q)n?q?1 if and only if G can be obtained from a q-tree Ton n vertices by deleting an edge contained in exactly q ? 1 triangles of T. Furthermore, we prove that these graphs are triangulated.  相似文献   

9.
The graphs called 2-trees are defined by recursion. The smallest 2-tree is the complete graph on 2 vertices. A 2-tree on n + 1 vertices (where n ≥ 2) is obtained by adding a new vertex adjacent to each of 2 arbitrarily selected adjacent vertices in a 2-tree on n vertices. A graph G is a 2-tree on n(≥2) vertices if and only if its chromatic polynomial is equal to γ(γ - 1)(γ - 2)n—2.  相似文献   

10.
The generalized Petersen graph GP (n, k), n ≤ 3, 1 ≥ k < n/2 is a cubic graph with vertex-set {uj; i ? Zn} ∪ {vj; i ? Zn}, and edge-set {uiui, uivi, vivi+k, i?Zn}. In the paper we prove that (i) GP(n, k) is a Cayley graph if and only if k2 ? 1 (mod n); and (ii) GP(n, k) is a vertex-transitive graph that is not a Cayley graph if and only if k2 ? -1 (mod n) or (n, k) = (10, 2), the exceptional graph being isomorphic to the 1-skeleton of the dodecahedon. The proof of (i) is based on the classification of orientable regular embeddings of the n-dipole, the graph consisting of two vertices and n parallel edges, while (ii) follows immediately from (i) and a result of R. Frucht, J.E. Graver, and M.E. Watkins [“The Groups of the Generalized Petersen Graphs,” Proceedings of the Cambridge Philosophical Society, Vol. 70 (1971), pp. 211-218]. © 1995 John Wiley & Sons, Inc.  相似文献   

11.
Summary The paper extends the ergodic theorems of information theory (Shannon-MacMillan-Breiman theorems) to spaces with an infinite invariant measure. An L 1 difference theorem and a pointwisa ratio theorem are proved, for the information of spreading partitions. For the validity of the theorems it is assumed that the supremum f * of the conditional information given the increasing past is integrable. Simple necessary and sufficient conditions for the integrability of f * are obtained in special cases: If the initial partition is composed of one state of a null-recurrent Markov chain, then f * is integrable if and only if the partition of this state according to the first return times has finite entropy.Research of both authors was supported by the National Science Foundation (U. S. A.), under Grant GP 7693.  相似文献   

12.
《代数通讯》2013,41(9):3685-3701
Abstract

We prove that a tame weakly shod algebra A which is not quasi-tilted is simply connected if and only if the orbit graph of its pip-bounded component is a tree, or if and only if its first Hochschild cohomology group H1(A) with coefficients in A A A vanishes. We also show that it is strongly simply connected if and only if the orbit graph of each of its directed components is a tree, or if and only if H1(A) = 0 and it contains no full convex subcategory which is hereditary of type 𝔸?, or if and only if it is separated and contains no full convex subcategory which is hereditary of type 𝔸?.  相似文献   

13.
An SOLS (self-orthogonal latin square) of order n with n1 missing sub-SOLS (holes) of order hi (1 ? i ? k), which are disjoint and spanning (i.e., Σ 1?i?knihi = n), is called a frame SOLS and denoted by FSOLS(h1n1 h2n2 …hknk). In this article, it is shown that for u ? 2, an FSOLS(2nu1) exists if and only if n ? 1 + u. © 1995 John Wiley & Sons, Inc.  相似文献   

14.
Summary We give an elementary proof of the fact that a finite Borel measure on n is absolutely continuous with a C 1 density if and only if it has directional derivatives which are continuous almost everywhere. The Radon-Nikodym derivative of a differentiable measure is given in terms of the directional derivatives.  相似文献   

15.
Let G be a group and let n be a positive integer. A polynomial function in G is a function from G n to G of the form , where f(x 1, . . . , x n ) is an element of the free product of G and the free group of rank n freely generated by x 1, . . . , x n . There is a natural definition for the product of two polynomial functions; equipped with this operation, the set of polynomial functions is a group. We prove that this group is polycyclic if and only if G is finitely generated, soluble, and nilpotent-by-finite. In particular, if the group of polynomial functions is polycyclic, then necessarily it is nilpotent-by-finite. Furthermore, we prove that G itself is polycyclic if and only if the subgroup of polynomial functions which send (1, . . . , 1) to 1 is finitely generated and soluble.   相似文献   

16.
In this note we show that a separable C*-algebra is nuclear and has a quasidiagonal extension by (the ideal of compact operators on an infinite-dimensional separable Hilbert space) if and only if it is anuclear finite algebra (NF-algebra) in the sense of Blackadar and Kirchberg, and deduce that every nuclear C*-subalgebra of aNF-algebra isNF. We show that strongNF-algebras satisfy a Følner type condition.  相似文献   

17.
Noncharacteristic Cauchy problems for parabolic equations arc frequently encountered in many areas of heat transfer. These problems are well known to be severely ill-posed. In this paper a solvability criterion for a class of such problems is established. It is proved that a weak solution of a noncharacteristic Cauchy problem for linear parabolic equations in divergence form with coefficients in a Holmgren class 2 in time exists if and only if the Cauchy data arc functions of a Holmgren class 2! A function g(t) defined on (α, β) is said to be of a Holmgren class 2, if g ?C (α, β) and for all nonnegative integers n there exist positive constants c and s such that |g(n)| < csn(2n)!.  相似文献   

18.
In this paper we ``measure' the size of the set of n -transversals of a family F of convex sets in R n+k according to its homological complexity inside the corresponding Grassmannian manifold. Our main result states that the ``measure' μ of the set of n -transversals of F is greater than or equal to k if and only if every k+1 members of F have a common point and also if and only if for some integer m , 1≤ m≤ n , and every subfamily F \prime of F with k+2 members, the ``measure' μ of the set of m -transversals of F \prime is greater than or equal to k . Received October 25, 2000, and in revised form September 27, 2001, and October 17, 2001. Online publication March 1, 2002.  相似文献   

19.
We investigate the problem that at least how many edges must a maximal triangle-free graph on n vertices have if the maximal valency is ≤D. Denote this minimum value by F(n, D). For large enough n, we determine the exact value of F(n, D) if D ≥ (n ? 2)/2 and we prove that lim F(n, cn)/n = K(c) exists for all 0 < c with the possible exception of a sequence ck → 0. The determination of K(c) is a finite problem on all intervals [γ, ∞). For D = cn?, 1/2 < ? < 1, we give upper and lower bounds for F(n, D) differing only in a constant factor. (Clearly, D < (n - 1)1/2 is impossible in a maximal triangle-free graph.)  相似文献   

20.
Summary Applications of some well-known theorems of Jackson and Young lead to the sharp inequalities -1<nk-1Σ(cos(kx)+sin(kx))/k (n ≥1; 1<x<π) and -1/2Si(π)<nk-1Σ(cos(kx)·sin(kx))/k (n ≥1; xЄR) We prove that the following counterpart is valid for all integers n ≥1 and real numbers xЄ (0, π): -3/2≤nk-1Σ(cos(kx)-sin(kx))/k where the sign of equality holds if and only if n =2 and x = π /2.  相似文献   

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

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