首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
ISOMORPHISMSOFCIRCULANTDIAGAPHSMENGJIXIANGANDHUANGQIONGXIANGAbstract:LetSZn-{0}.ThecirculantdigraphDCn(S)isadirectedgraphwith...  相似文献   

2.
L. F. Escudero  A. Garín  G. Pérez 《TOP》1996,4(2):215-223
Summary In this note we present new properties of cliques induced constraints straintsX(C r + )-X(C r - ) ≤ 1 - |C r - | for λ εS, whereS is the set of cliques that are implied by 0–1 mixed integer programs. These properties allow to further fixing of 0–1 variables, to detect instance's infeasibility and to imply new cliques.  相似文献   

3.
Let X 1, X 2,... be independent identically distributed random variables with distribution function F, S 0 = 0, S n = X 1 + ⋯ + X n , and n = max1⩽kn S k . We obtain large-deviation theorems for S n and n under the condition 1 − F(x) = P{X 1x} = el(x), l(x) = x α L(x), α ∈ (0, 1), where L(x) is a slowly varying function as x → ∞. __________ Translated from Lietuvos Matematikos Rinkinys, Vol. 45, No. 4, pp. 447–456, October–December, 2005.  相似文献   

4.
Let X be a connected finite CW complex and d X : K 0(C(X)) →ℤ be the dimension function. We show that, if A is a unital separable simple nuclear C*-algebra of TR(A) = 0 with the unique tracial state and satisfying the UCT such that K 0(A) = ℚ⊕ kerd x and K 1(A) = K 1(C(X)), then A is isomorphic to an inductive limit of M n !(C(X)). Received April 19, 2001, Accepted April 27, 2001.  相似文献   

5.
A sequence (z 0,z 1,z 2,, ...,z n, z n+1) of points fromp=z 0 toq=z n+1 in a metric spaceX is said to besequentially equidistant ifd(z i−1,z i)=d(z i,z i+1) for 1≦in. If there is path inX fromp toq (or if a certain weaker condition holds), then such a sequence exists, with all points distinct, for every choice ofn, while ifX is compact and connected, then such a sequence exists at least forn=2. An example is given of a dense connected subspaceS ofR m ,m≧2, and an uncountable dense subsetE disjoint fromS for which there is no sequentially equidistant sequence of distinct points (n ≧ 2) inSE between any two points ofE. Techniques of dimension theory are utilized in the construction of these examples, as well as in the proofs of some of the positive results. Supported in part by NSF Grant DMS-8701666.  相似文献   

6.
The circulant graph 〈Sn, where SZn∖{0}, has vertex set Zn and edge set {{x,x+s}|xZn,sS}. It is shown that there is a Hamilton cycle decomposition of every 6-regular circulant graph 〈Sn in which S has an element of order n.  相似文献   

7.
Let S be a connected Dedekind scheme and X an S-scheme provided with a section x. We prove that the morphism between fundamental group schemes π 1(X, x) ab π 1(Alb X/S , 0AlbX/S{0_{{\rm{Al}}{{\rm{b}}_{X/S}}}}) induced by the canonical morphism from X to its Albanese scheme Alb X/S (when the latter exists) fits in an exact sequence of group schemes 0 → (NS X/S τ )π 1(X, x) ab π 1(Alb X/S , 0AlbX/S{0_{{\rm{Al}}{{\rm{b}}_{X/S}}}}) → 0, where the kernel is a finite and flat S-group scheme. Furthermore, we prove that any finite and commutative quotient pointed torsor over the generic fiber X η of X can be extended to a finite and commutative pointed torsor over X.  相似文献   

8.
On the isomorphisms and automorphism groups of circulants   总被引:2,自引:0,他引:2  
Denote byC n(S) the circulant graph (or digraph). LetM be a minimal generating element subset ofZ n, the cyclic group of integers modulon, and In this paper, we discuss the problems about the automorphism group and isomorphisms ofC n(S). When M S , we determine the automorphism group ofC n(S) and prove that for any T if and only ifT = S, where is an integer relatively prime ton. The automorphism groups and isomorphisms of some other types of circulant graphs (or digraphs) are also considered. In the last section of this paper, we give a relation between the isomorphisms and the automorphism groups of circulants.  相似文献   

9.
Let T and S be invertible measure preserving transformations of a probability measure space (X, ℬ, μ). We prove that if the group generated by T and S is nilpotent, then exists in L 2-norm for any u, vL (X, ℬ, μ). We also show that for A∈ℬ with μ(A)>0 one has . By the way of contrast, we bring examples showing that if measure preserving transformations T, S generate a solvable group, then (i) the above limits do not have to exist; (ii) the double recurrence property fails, that is, for some A∈ℬ, μ(A)>0, one may have μ(AT -n AS - n A)=0 for all n∈ℕ. Finally, we show that when T and S generate a nilpotent group of class ≤c, in L 2(X) for all u, vL (X) if and only if T×S is ergodic on X×X and the group generated by T -1 S, T -2 S 2,..., T -c S c acts ergodically on X. Oblatum 19-V-2000 & 5-VII-2001?Published online: 12 October 2001  相似文献   

10.
Let {X n ;n≥1} be a sequence of i.i.d. random variables and let X (r) n = X j if |X j | is the r-th maximum of |X 1|, ..., |X n |. Let S n = X 1+⋯+X n and (r) S n = S n −(X (1) n +⋯+X (r) n ). Sufficient and necessary conditions for (r) S n approximating to sums of independent normal random variables are obtained. Via approximation results, the convergence rates of the strong law of large numbers for (r) S n are studied. Received March 22, 1999, Revised November 6, 2000, Accepted March 16, 2001  相似文献   

11.
A set W of the vertices of a connected graph G is called a resolving set for G if for every two distinct vertices u, v ∈ V (G) there is a vertex w ∈ W such that d(u, w) ≠ d(v, w). A resolving set of minimum cardinality is called a metric basis for G and the number of vertices in a metric basis is called the metric dimension of G, denoted by dim(G). For a vertex u of G and a subset S of V (G), the distance between u and S is the number min s∈S d(u, s). A k-partition Π = {S 1 , S 2 , . . . , S k } of V (G) is called a resolving partition if for every two distinct vertices u, v ∈ V (G) there is a set S i in Π such that d(u, Si )≠ d(v, Si ). The minimum k for which there is a resolving k-partition of V (G) is called the partition dimension of G, denoted by pd(G). The circulant graph is a graph with vertex set Zn , an additive group of integers modulo n, and two vertices labeled i and j adjacent if and only if i-j (mod n) ∈ C , where CZn has the property that C =-C and 0 ■ C. The circulant graph is denoted by Xn, Δ where Δ = |C|. In this paper, we study the metric dimension of a family of circulant graphs Xn, 3 with connection set C = {1, n/2 , n-1} and prove that dim(Xn, 3 ) is independent of choice of n by showing that dim(Xn, 3 ) ={3 for all n ≡ 0 (mod 4), 4 for all n ≡ 2 (mod 4). We also study the partition dimension of a family of circulant graphs Xn,4 with connection set C = {±1, ±2} and prove that pd(Xn, 4 ) is independent of choice of n and show that pd(X5,4 ) = 5 and pd(Xn,4 ) ={3 for all odd n ≥ 9, 4 for all even n ≥ 6 and n = 7.  相似文献   

12.
We prove that ifC is a bounded closed convex subset of a uniformly convex Banach space,T:C→C is a nonlinear contraction, andS n =(I+T+…+T n−1 )/n, then lim n ‖S n (x)−TS n (x)‖=0 uniformly inx inC. T also satisfies an inequality analogous to Zarantonello’s Hilbert space inequality. which permits the study of the structure of the weak ω-limit set of an orbit. These results are valid forB-convex spaces if some additional condition is imposed on the mapping. Partially supported by NSF Grant MCS-7802305A01.  相似文献   

13.
Suppose thtS is a semigroup with a finite presentation (X; R). John Remmers has proved that the word problem for the presentation (X; R) is solvable if the presentation satisfies a certain small overlap hypothesis,C(n), forn≥3. Here we prove that, with trivial but numerous exceptions, if (X 1;R 1) and (X 2;R 2) are both finite presentations forS which satisfyC(2), then forn≥2, (X 1;R 1) satisfiesC(n) if and only if (X 2;R 2) satisfiesC(n).  相似文献   

14.
Denote by T(X) the semigroup of full transformations on a set X. For εT(X), the centralizer of ε is a subsemigroup of T(X) defined by C(ε)={αT(X):αε=εα}. It is well known that C(id X )=T(X) is a regular semigroup. By a theorem proved by J.M. Howie in 1966, we know that if X is finite, then the subsemigroup generated by the idempotents of C(id X ) contains all non-invertible transformations in C(id X ).  相似文献   

15.
Let (Ω,A,μ) be a probability space, K the scalar field R of real numbers or C of complex numbers,and (S,X) a random normed space over K with base (ω,A,μ). Denote the support of (S,X) by E, namely E is the essential supremum of the set {AA: there exists an element p in S such that X p (ω) > 0 for almost all ω in A}. In this paper, Banach-Alaoglu theorem in a random normed space is first established as follows: The random closed unit ball S *(1) = {fS *: X * f ⩽ 1} of the random conjugate space (S *,X *) of (S,X) is compact under the random weak star topology on (S *,X *) iff EA=: {EA | AA} is essentially purely μ-atomic (namely, there exists a disjoint family {A n : nN} of at most countably many μ-atoms from EA such that E = ∪ n=1 A n and for each element F in EA, there is an H in the σ-algebra generated by {A n : nN} satisfying μ(FΔH) = 0), whose proof forces us to provide a key topological skill, and thus is much more involved than the corresponding classical case. Further, Banach-Bourbaki-Kakutani-Šmulian (briefly, BBKS) theorem in a complete random normed module is established as follows: If (S,X) is a complete random normed module, then the random closed unit ball S(1) = {pS: X p ⩽ 1} of (S,X) is compact under the random weak topology on (S,X) iff both (S,X) is random reflexive and EA is essentially purely μ-atomic. Our recent work shows that the famous classical James theorem still holds for an arbitrary complete random normed module, namely a complete random normed module is random reflexive iff the random norm of an arbitrary almost surely bounded random linear functional on it is attainable on its random closed unit ball, but this paper shows that the classical Banach-Alaoglu theorem and BBKS theorem do not hold universally for complete random normed modules unless they possess extremely simple stratification structure, namely their supports are essentially purely μ-atomic. Combining the James theorem and BBKS theorem in complete random normed modules leads directly to an interesting phenomenum: there exist many famous classical propositions that are mutually equivalent in the case of Banach spaces, some of which remain to be mutually equivalent in the context of arbitrary complete random normed modules, whereas the other of which are no longer equivalent to another in the context of arbitrary complete random normed modules unless the random normed modules in question possess extremely simple stratification structure. Such a phenomenum is, for the first time, discovered in the course of the development of random metric theory.  相似文献   

16.
Let {X n ; n ≥ 1} be a sequence of independent and identically distributed random vectors in ℜ p with Euclidean norm |·|, and let X n (r) = X m if |X m | is the r-th maximum of {|X k |; kn}. Define S n = Σ kn X k and (r) S n − (X n (1) + ... + X n (r)). In this paper a generalized strong invariance principle for the trimmed sums (r) S n is derived.  相似文献   

17.
We prove a variant of a theorem of N. Alon and V. D. Milman. Using it we construct for everyn-dimensional Banach spacesX andY a measure space Ω and two operator-valued functionsT: Ω→L(X, Y),S: Ω→L(Y, X) so that ∫Ω S(ω)oT(ω) is the identity operator inX and ∫Ω||S(ω)||·||T(ω)||dω=O(n α ) for some absolute constantα<1. We prove also that any subset of the unitn-cube which is convex, symmetric with respect to the origin and has a sufficiently large volume possesses a section of big dimension isomorphic to ak-cube. Research supported in part by a grant of the Israel Academy of Sciences.  相似文献   

18.
Let X 1, X 2, … be a sequence of independent identically distributed real-valued random variables, S n be the nth partial sum process S n (t) ≔ X 1 + ⋯ X tn, t ∈ [0, 1], W be the standard Wiener process on [0, 1], and 2 < p < ∞. It is proved that n −1/2 S n converges in law to σW as n → ∞ in p-variation norm if and only if EX 1 = 0 and σ 2 = EX 12 < ∞. The result is applied to test the stability of a regression model. The research was partially supported by the Lithuanian State Science and Studies Foundation, grant No. T-21/07  相似文献   

19.
We provide new estimates on character values of symmetric groups which hold for all characters and which are in some sense best possible. It follows from our general bound that if a permutation σ∈S n has at most n o(1) cycles of length <m, then |χ(σ)|≤χ(1)1/m+o(1) for all irreducible characters χ of S n . This is a far reaching generalization of a result of Fomin and Lulov. We then use our various character bounds to solve a wide range of open problems regarding mixing times of random walks, covering by powers of conjugacy classes, as well as probabilistic and combinatorial properties of word maps. In particular we prove a conjecture of Rudvalis and of Vishne on covering numbers, and a conjecture of Lulov and Pak on mixing times of certain random walks on S n . Our character-theoretic methods also yield best possible solutions to Waring type problems for alternating groups A n , showing that if w is a non-trivial word, and n≫0, then every element of A n is a product of two values of w.  相似文献   

20.
A characteristic property of spheres   总被引:1,自引:1,他引:0  
Summary We prove: Let S be a closed n-dimensional surface in an(n+1)-space of constant curvature (n ≥ 2); k1 ≥ ... ≥ kn denote its principle curvatures. Let φ(ξ1, ..., ξn) be such that . Then if φ(k1, ..., kn)=const on S and S is subject to some additional general conditions (those(II 0) or(II) no 1), S is a sphere. To Enrico Bompiani on his scientific Jubilee  相似文献   

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

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