最小费用k度限制树对策

本在Glover—Klingman算法及最小费用支撑树对策的基础上，讨论了最小费用k度限制树对策问题．利用威胁、旁支付理论制订了两种规则，并利用优超、策略等价理论分别给出了在这两种规则下最小费用k度限制树对策核心中的解，从而证明了在这两种规则下其核心非空．     

New characterizations of Hajlasz-Sobolev spaces on metric spaces

This paper introduces the fractional Sobolev spaces on spaces of homogeneous type,includingmetric spaces and fractals. These Sobolev spaces include the well-known Hajfasz-Sobolev spaces as specialmodels.The author establishes varions chaaracterizations of(sharp)maximal functions for these spaces.Asapplications,the author identifies the fractional Sobolev spaces with some Lipscitz-type spaces.Moreover;some embedding theorems are also given.     

齐次~Morrey-Herz 空间上分数次积分算子高阶交换子的有界性

在齐次Morrey-Herz空间上建立了高阶交换子~$T^{m}_{b,l}$ 和 ~$M^{m}_{b,l}$的有界性，其中~$T^{m}_{b,l}$ 和 ~$M^{m}_{b,l}$ 是由分数次积分算子和分数次极大算子分别与~BMO($R^{n}$)函数生成的高阶交换子.     

THE GLOBAL THEOREM OF A.N.BERLINSKII

ＳｏｃａｌｔｈｅＢｅｒｌｉｎｓｋｉｔｈｅｏｒｅｍｆｏｒｐｌａｎａｒｑｕａｄｒａｔｉｃＳｙｓｔｅｍ（ＱＳ）ｉｓ：ＴｈｅｏｒｅｍＡ［１］ＳｕｐｐｏｓｅｔｈａｔａＱＳｈａｓ４ｆｉｎｉｔｅｃｒｉｔｉｃａｌｐｏｉｎｔｓ（ＣＰｓ），Ｉｆｔｈｅｑｕａｄｒｉｌａ...     

关于多项式系数微分方程复振荡理论的两个结果

本文证明了：如果ａ_ｋ－ｊ（ｊ＝１，…，ｋ）为多项式，ｄｅｇａ_ｋ－ｊ＝ｎ_ｋ－ｊ，存在某个ａ_ｋ－s（１≤ｓ≤ｋ）满足：当１≤ｊ＜ｓ时，ｎ_ｋ－ｊ／ｊ≤ｎ_ｋ－s／ｓ；当ｓ＜ｊ≤ｋ时，ｎ_ｋ－ｊ＜ｎ_ｋ－s－（ｊ－ｓ）．如果Ｆ≠０是整函数且满足σ（Ｆ）＝β＜（ｎ_ｋ－s＋ｓ）／ｓ，那么微分方程ｆ^（ｋ）＋ａ     

Locally minimal uniformly oriented shortest networks

The Steiner problem in a λ-plane is the problem of constructing a minimum length network interconnecting a given set of nodes (called terminals), with the constraint that all line segments in the network have slopes chosen from λ uniform orientations in the plane. This network is referred to as a minimum λ-tree. The problem is a generalization of the classical Euclidean and rectilinear Steiner tree problems, with important applications to VLSI wiring design.A λ-tree is said to be locally minimal if its length cannot be reduced by small perturbations of its Steiner points. In this paper we prove that a λ-tree is locally minimal if and only if the length of each path in the tree cannot be reduced under a special parallel perturbation on paths known as a shift. This proves a conjecture on necessary and sufficient conditions for locally minimal λ-trees raised in [M. Brazil, D.A. Thomas, J.F. Weng, Forbidden subpaths for Steiner minimum networks in uniform orientation metrics, Networks 39 (2002) 186-222]. For any path P in a λ-tree T, we then find a simple condition, based on the sum of all angles on one side of P, to determine whether a shift on P reduces, preserves, or increases the length of T. This result improves on our previous forbidden paths results in [M. Brazil, D.A. Thomas, J.F. Weng, Forbidden subpaths for Steiner minimum networks in uniform orientation metrics, Networks 39 (2002) 186-222].     

Commutators of singular integrals on spaces of homogeneous type

In this work we prove some sharp weighted inequalities on spaces of homogeneous type for the higher order commutators of singular integrals introduced by R. Coifman, R. Rochberg and G. Weiss in Factorization theorems for Hardy spaces in several variables, Ann. Math. 103 (1976), 611–635. As a corollary, we obtain that these operators are bounded on L ^p (w) when w belongs to the Muckenhoupt’s class A _p , p > 1. In addition, as an important tool in order to get our main result, we prove a weighted Fefferman-Stein type inequality on spaces of homogeneous type, which we have not found previously in the literature.     

STRONG LAW OF LARGE NUMBERS AND ASYMPTOTIC EQUIPARTITION PROPERTY FOR NONSYMMETRIC MARKOV CHAIN FIELDS ON CAYLEY TREES

Some strong laws of large numbers for the frequcncies of occurrence of states and ordered couples of states for nonsymmetric Markov chain fields(NSMC)on Cayley trees are studied.In the proof,a new technique for the study of strong liinit theorems of Markov chains is extended to the case of Markov chain fields.The asymptotic equiparti- tion properties with almost everywhere(a.e.)convergence for NSMC on Cayley trees are obtained.     

LIMITING BEHAVIOR OF UNIFORM RECURSIVE TREES

The authors consider the limiting behavior of various branches in a uniform recursive tree with size growing to infinity.The limiting distribution ofζ_(n,m),the number of branches with size m in a uniform recursive tree of order n,converges weakly to a Poisson distribution with parameter 1/m with convergence of all moments.The size of any large branch tends to infinity almost surely.