首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 93 毫秒
1.
1. IntroductionLet G = (V, E) be an undirected graph. The open neighborhood N(v) of vertex v E Vis given by N(v) = {u E V: tv E E}. A total dominating function (TDF) of G is afunction f: V - [0, 11 such that Z f(u) 2 1 for each vertex v. A TDF f is minimaladN(~)(MTDF) if no function g < f is also a TDF of G. The illteger valued TDFs are preciselythe characteristic functions of total dominating sets of G (i.e., subset X G V such that anyv is adjacellt to at leajst one x E X). T…  相似文献   

2.
李建湘 《东北数学》2004,20(4):435-440
Let G be an (mg, mf)-graph, where g and f are integer-valued functions defined on V(G) and such that 0≤g(x)≤f(x) for each x ∈ V(G). It is proved that(1) If Z ≠ , both g and f may be not even, G has a (g, f)-factorization, where Z = {x ∈ V(G): mf(x)-dG(x)≤t(x) or dG(x)-mg(x)≤ t(x), t(x)= f(x)-g(x)>0}.(2) Let G be an m-regular graph with 2n vertices, m≥n. If (P1, P2,..., Pr) is a partition of m, P1 ≡ m (mod 2), Pi ≡ 0 (mod 2), i = 2,..., r, then the edge set E(G) of G can be parted into r parts E1 , E2,...,Er of E(G) such that G[Ei] is a Pi-factor of G.  相似文献   

3.
THE GROWTH OF RANDOM DIRICHLET SERIES (I)   总被引:1,自引:0,他引:1  
We consider random Dirichlet serieswhere an C C, 0 5 A. T co, Zn(w) is a sequence of random variables defined in the probabilityspace (fi, F, P), s = a it(a, t E R).Conveniently we consider Dirichlet seriesThe convex regularized sequence of {-- In la. l} is noted as {-- In la; I}, set a.(w) = a.Zn(w),the convex regularized sequence of {-- In la.(w)l} is noted as {-- In la;(w) l} where a.(a.(w)) isthe abscissa of convergence about f(s)(f(s, w)).Lemma 1 (i) If Z.(w) satisfiesthen a.s.…  相似文献   

4.
In this paper, the robustness of the orbit structure is investigated for a partially hyperbolic endomorphism f on a compact manifold M. It is first proved that the dynamical structure of its orbit space(the inverse limit space) M~f of f is topologically quasi-stable under C~0-small perturbations in the following sense: For any covering endomorphism g C~0-close to f, there is a continuous map φ from M~g to Multiply form -∞ to ∞ M such that for any {y_i }_(i∈Z) ∈φ(M~g), y_(i+1) and f(y_i) differ only by a motion along the center direction. It is then proved that f has quasi-shadowing property in the following sense: For any pseudo-orbit {x_i }_(i∈Z),there is a sequence of points {y_i }_(i∈Z) tracing it, in which y_(i+1) is obtained from f(y_i) by a motion along the center direction.  相似文献   

5.
A restricted signed r-set is a pair (A, f), where A lohtain in [n] = {1, 2,…, n} is an r-set and f is a map from A to [n] with f(i) ≠ i for all i ∈ A. For two restricted signed sets (A, f) and (B, g), we define an order as (A, f) ≤ (B, g) if A C B and g|A : f A family .A of restricted signed sets on [n] is an intersecting antiehain if for any (A, f), (B, g) ∈ A, they are incomparable and there exists x ∈ A ∩ B such that f(x) = g(x). In this paper, we first give a LYM-type inequality for any intersecting antichain A of restricted signed sets, from which we then obtain |A|≤ (r-1^n-1)(n-1)^r-1 if A. consists of restricted signed r-sets on [n]. Unless r = n = 3, equality holds if and only if A consists of all restricted signed r-sets (A, f) such that x0∈ A and f(x0) =ε0 for some fixed x0 ∈ [n], ε0 ∈ [n] / {x0}.  相似文献   

6.
Suppose that H is a Hopf algebra,and g is a generalized Kac-Moody algebra with Cartan matrix A =(aij)I×I,where I is an index set and is equal to either {1,2,...,n} or the natural number set N.Let f,g be two mappings from I to G(H),the set of group-like elements of H,such that the multiplication of elements in the set {f(i),g(i)|i ∈I} is commutative.Then we define a Hopf algebra Hgf Uq(g),where Uq(g) is the quantized enveloping algebra of g.  相似文献   

7.
A THEOREM ON THE CONVERGENCE OF SUMS OF INDEPENDENT RANDOM VARIABLES   总被引:1,自引:1,他引:0  
1 IntroductionThroughout this paperl {X., n 2 1} is assumed to be a sequence of independent randomvariables. Fn denotes the distribution function of the partial surns S. = Z Xk. As is known,k = 1oothe series Z X. is said to be essentially convergent (a.s.) if there exists a sequence of constantsn = 1oo{b., n 2 1} such that Z (X. -- 6.) a.s. converges. When this happens we writeClearlyFn(x) = G.(x -- B.). (l.2)Our problem stems from an old conjecture in Probabilistic Number Theory sugges…  相似文献   

8.
We assume T1,...,Tn are i.i.d.data sampled from distribution function F with density function f and C1,...,Cn are i.i.d.data sampled from distribution function G.Observed data consists of pairs(Xi,δi),i=1,...,n,where Xi=min{Ti,Ci},δi=I(Ti Ci),I(A)denotes the indicator function of the set A.Based on the right censored data{Xi,δi},i=1,...,n,we consider the problem of estimating the level set{f c}of an unknown one-dimensional density function f and study the asymptotic behavior of the plug-in level set estimators.Under some regularity conditions,we establish the asymptotic normality and the exact convergence rate of theλg-measure of the symmetric difference between the level set{f c}and its plug-in estimator{fn c},where f is the density function of F,and fn is a kernel-type density estimator of f.Simulation studies demonstrate that the proposed method is feasible.Illustration with a real data example is also provided.  相似文献   

9.
In this paper, we give some characterizations of almost completely regular spaces and c-semistratifiable spaces(CSS) by semi-continuous functions. We mainly show that:(1)Let X be a space. Then the following statements are equivalent:(i) X is almost completely regular.(ii) Every two disjoint subsets of X, one of which is compact and the other is regular closed, are completely separated.(iii) If g, h : X → I, g is compact-like, h is normal lower semicontinuous, and g ≤ h, then there exists a continuous function f : X → I such that g ≤ f ≤ h;and(2) Let X be a space. Then the following statements are equivalent:(a) X is CSS;(b) There is an operator U assigning to a decreasing sequence of compact sets(Fj)j∈N,a decreasing sequence of open sets(U(n,(Fj)))n∈N such that(b1) Fn■U(n,(Fj)) for each n ∈ N;(b2)∩n∈NU(n,(Fj)) =∩n∈NFn;(b3) Given two decreasing sequences of compact sets(Fj)j∈N and(Ej)j∈N such that Fn■Enfor each n ∈ N, then U(n,(Fj))■U(n,(Ej)) for each n ∈ N;(c) There is an operator Φ : LCL(X, I) → USC(X, I) such that, for any h ∈ LCL(X, I),0 Φ(h) h, and 0 Φ(h)(x) h(x) whenever h(x) 0.  相似文献   

10.
Suppose that {X_n(ω)} are independent random complex variable sequence, E(X_n)-0 and Then the circle {|Z|=ρ} is almost surely a natural boundary of the random series sum from n=1 to ∞ X_n(ω)Z~(n-1)  相似文献   

11.
本文给出并论证了当 n阶实方阵 A具有 r( 1≤ r≤n)个模最大的特征值及其相应特征向量的方法 .实施规范化措施 ,使得行范数等于 1 ,在电子计算机上不会产生溢出停机 ,这是一种有实用价值的算法  相似文献   

12.
This work shows that, in a two-period framework, prudence has a positive effect on optimal prevention. This conclusion is the opposite to that obtained in a one-period framework [Eeckhoudt L., Gollier C., 2005. The impact of prudence on optimal prevention. Economic Theory 26, 989–994]. This is due to the opposite effect of prevention on wealth in the period where the risk occurs.  相似文献   

13.
14.
本文设计了一种混合区组试验,这种试验是在试验环境的一个方向上采用随机区组设计,在另一个方向上采用平衡不完全区组设计,从而可以控制两个方向上的环境差异,适用于不能安排拉丁方设计和3义向随机区组设计的试验,其精确度相当于拉丁方试验的精确度。本文通过实例分析说明了混合区组试验设计具有较高的实用价值。  相似文献   

15.
This paper proposes a reduction technique for the generalized Riccati difference equation arising in optimal control and optimal filtering. This technique relies on a study on the generalized discrete algebraic Riccati equation. In particular, an analysis on the eigenstructure of the corresponding extended symplectic pencil enables to identify a subspace in which all the solutions of the generalized discrete algebraic Riccati equation are coincident. This subspace is the key to derive a decomposition technique for the generalized Riccati difference equation. This decomposition isolates a “nilpotent” part, which converges to a steady-state solution in a finite number of steps, from another part that can be computed by iterating a reduced-order generalized Riccati difference equation.  相似文献   

16.
Wille  Rudolf 《Order》2003,20(3):229-238
Logical relationships in everyday human thought are predominantly inferences with one-element premises. This becomes apparent in the practice of Formal Concept Analysis by the frequent occurrence of truncated distributive lattices as concept lattices. This paper gives a mathematization of the underlying everyday theories of logical relationships and elaborates useful mathematical results, in particular about algorithmically drawing concept lattices which correspond to the everyday logical theories. This revised version was published online in June 2006 with corrections to the Cover Date.  相似文献   

17.
Stochastic decomposition for retrial queues   总被引:4,自引:0,他引:4  
J. R. Artalejo  J. I. Falin 《TOP》1994,2(2):329-342
Summary This paper deals with the stochastic decomposition property for retrial queues. This property is connected with similar results for vacation models. As applications, the moments of the number of customers in orbit and the rate of convergence under high retrial intensity can be obtained. This work was supported under Grant PR161/93-4777  相似文献   

18.
A block version of the Shake method for heavy atom simulation in biological systems is presented in this paper. The method solves successively, independent blocks of constraints of small size by a Newton method. This algorithm is implemented in TAKAKAW, an efficient parallel molecular dynamics code. This method has been tested on a small system and on an ionic canal of 67671 atoms. This revised version was published online in June 2006 with corrections to the Cover Date.  相似文献   

19.
This paper gives the optimal order l of smoothness in the Mihlin and Hörmander conditions for operator-valued Fourier multiplier theorems. This optimal order l is determined by the geometry of the underlying Banach spaces (e.g. Fourier type). This requires a new approach to such multiplier theorems, which in turn leads to rather weak assumptions formulated in terms of Besov norms.  相似文献   

20.
本文不仅给出一种构造局部性好的正交小波基的方法,并且给出了构造各种优良性质的正交小波基的一般思想方法。其特点:使构造的小波母函数有具体的表达式,既有较好的光滑性,又有很好的局部性,并且其收敛速度与│t│~(-(3k 1))同阶,其中k为任意自然数。这种方法不需要每次重新构造函数,只要改变k的值,就能满足不同实际问题的需要。  相似文献   

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

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