一类指数型整函数值算子的逼近性质

设（Ｕσｆ）（ｘ）＝Σ↓ｋ∈Ｚｆ（Ｘｋ）Ａσ（Ｘ－Ｘｋ），Ｘｋ＝２ｋπ／σ，ｋ∈Ｚ，σ〉０，ｆ是Ｒ上的有界函数，而Ａσ（ｙ）＝２／σ∫σ０ｓｉｎ＾ｍ（σ－Ｘ）ｈ／ｓｉｎ＾ｍ（σ－Ｘ）ｈ＋ｓｉｎ＾ｍｘｈｃｏｓｘｙｄｘ，ｍ为奇自然数，０〈ｈ〈π／σ，本文研究了此插值算子的收敛与饱和问题。     

两指标随机积分方程解的唯一性

在正交增量的随机积分基础上，利用Ｌｉｐｓｃｈｉｔｚ条件，讨论了下面一类两参数随机积分方程解的唯一性。Ｘ（ｓ，ｔ）＝Ｚ（ｓ，０）＋Ｚ（０，ｔ）－Ｚ（０，０）＋∫Ｒｓｔα（ｕ，ｖ，Ｘ）ｄＭｕｖ＋∫Ｒｓｔβ（ｕ，ｖ，Ｘ）ｄｍｕｖ＋∫Ｒ＾ｓｔγ１（ｕ，ｖ，ｕ＇，ｖ＇，Ｘ）ｄＭｕｖｄＭｕ＇ｖ＇＋∫Ｒ＾２ｓｔγ２（ｕ，ｖ，ｕ＇，ｖ＇，Ｘ）ｄＭｕｖｄｍｕ＇ｖ＇＋∫Ｒ＾２ｓｔγ３（ｕ，ｖ，ｕ＇，ｖ＇，Ｘ）ｄｍｕｖ     

随机微分方程终值问题的弱解

设｛Ｗｔ．Ｆｔ．ｔ∈［０，Ｔ］｝为概率空间（Ω，Ｆ，Ｐ）上的标准α维Ｂｒｏｗｎｆｃｆｃ，Ｆｔ为由它生成的自然σ－代数流。本文讨论了如下随机微分方程终值问题弱解的存在性：Ｘｔ＝ξ＋∫ｔ＾Ｔｇ（ｓ，Ｘｓ，Ｙｓ）ｄｓ＋∫ｔ＾ＴＹｓｄＷｓ其中ξ∈Ｌ＾２（Ω，ＦＴ，Ｐ；Ｒ＾ｎ），ｇ：［０，Ｔ］×Ｒ＾ｎ×Ｒｎｄ→Ｒ＾ｎ为有界可测函数。此外，还讨论了它在金融市场期权定价问题中的应用。     

鞅差几何级数的重对数律

设｛Ｘｋ，Ｆｋ，ｋ≥０｝是（Ω，Ｆ，Ｐ）上的鞅差序列，在本文中我们讨论了以｛Ｘｋ｝为系数的幂级数Ｓ（β＝Σ∞ｋ＝０βｋＸｋ，当β↑１时的渐近行为，本文证明了：如果│Ｘｋ│≤ｃ，Ｅ（Ｘ＾２ｋ│Ｆｋ－１）＝１，则有下面的重对数律成立ｌｉｍβ↑１√１－β＾２／√２ｌｏｇｌｏｇ（１－β＾２）－１Ｓ（β）＝１ａ．ｓ。     

平均单叶函数的相邻系数

设ｆ（ｚ）＝ｚ＋Σａｎｚ＾ｎ为单位园｜ｚ｜＜１内解析且平均单叶，记其族为Ｍ又设｛ｆ（ｚ）／ｚ｝＾λ＝１＋Σ＾∞ｎ＝１Ｄｎ（λ），λ＞０，本文说明了：定理一 若ｆ∈Ｍ，λ＞０，则：Σ＾∞ｋ＝１｛｜｜Ｄｋ（λ）｜－｜Ｄｋ－１（λ）｜｜／ｄｋ（λ）｝＾２≤Ａｎ，ｎ＝２，３，…其中Ａ为绝对常数。ｄｋ（ｈ）＝ｈ（ｈ＋１）…（ｈ＋ｋ－１）／ｋ！当λ＝１／２，ｆ∈ｓ时为Ｉ．Ｖ．Ｍｉｌｍ所证明。定理二 若ｆ∈Ｍ并     

某类有界拟凸域双全纯不变量的极限

Ｅ＝Ｅ（ｍ，ｎ，ｋ）＝｛（ｚ，ω）∈Ｃ＾ｎ＋ｍ：│ｚ│＾２＋│ω│＾２ｋ〈１，ｚ∈Ｃ＾ｎ，ω∈Ｃ＾ｍ，ｋ〉０｝是Ｃ＾ｍ＋ｍ中的一类有界拟凸域。该文证明了在δＥ的强拟凸点上，当ｍ〉１时，ｌｉｍ（ｚ，ω）→δＥＪＥ（（ｚ，ω））＝π＾ｎ＋ｍ（ｎ＋ｍ＋１）＾ｎ／（ｎ＋ｍ）！．ｍ＝１时，ｌｉｎ（ｚ，ω）→δＥＪＥ（ｚ，ω））＝π＾ｎ＋１（ｎ＝）＾ｎ＋１／（ｎ＋１）！，在δＥ的弱拟凸点上，上述极限不存在。     

关于非线性偏微分方程的特征曲面

设ｕ∈Ｈｌｏｃ＾ｓ＋ｍ（Ω）（Ω∈Ｒ＾ｎ＋１，ｓ〉ｎ／２＋２），为ｍ阶非线性偏微分方程Ｆ（ｘ，ｕ，…，Ｄ＾αｕ，…）＝（／α／≤ｍ）的实解，本文通过独裁春特征曲面，并应用Ｂｏｎｙ的奇性传播定理证明了特征曲面的正则性，从而获得对Ａｌｉｎｈａｃ中条件的一个注记。     

不等式x~3 y~3 z~3≥3xyz的几何证法

我们先证ｘ２＋ｙ２≥２ｘｙ（ｘ、ｙ∈Ｒ＋,当ｘ＝ｙ时,等号成立）证明　如图１,设正方形ＡＢＣＤ的边长为ｘ,正方形ＢＥＦＪ的边长为ｙ,在ＡＢ上取ＡＨ＝ｙ,则ＨＢ＝ｘ－ｙ,故ＨＥ＝ＨＢ＋ＢＥ＝ｘ－ｙ＋ｙ＝ｘ,∴　Ｓ矩ＡＨＰＤ＝Ｓ矩ＨＥＦＫ＝ｘｙ．由图１显然有　Ｓ正ＡＢＣＤ＋Ｓ正ＢＥＦＪ≥Ｓ矩ＡＨＰＤ＋Ｓ矩ＨＥＦＫ,即　　　ｘ２＋ｙ２≥２ｘｙ（当且仅当ｘ＝ｙ时,等号成立）再证　ｘ３＋ｙ３＋ｚ３≥３ｘｙｚ（ｘ、ｙ、ｚ∈Ｒ＋,当且仅当ｘ＝ｙ＝ｚ时,等号成立）证明　如图２,设三个正方体ＶＡＢ、ＶＣＤ、ＶＥＦ…     

相依线性回归方程组的一种“朴实”两步估计的有效性

对于相依线性回归方程组Ｙｉ＝Ｘｉβｉ＋εｉ（ｉ＝１，２），我们提出了系数向量βｉ的一种较为简便的“朴实”的两步估计量，例如β１的估计量为β１（Ｔ）＝（Ｘ’１，Ｘ１）＾－１Ｘ‘１Ｙ１－σ１２σ２２（Ｘ’１Ｘ１）＾－１Ｘ‘１ＴＹ２。其中Σ＝（σｉｊ）的一种估计量，本文给出了Σ的一种新取法，通过均方误差矩阵的大小我们证明了这种简便两种估计有有限样本量下可优效于ＬＳ估计。     

Fourier-Jacobi展开的Riesz平均

对ｆ∈Ｌｐ（Ｒ＋，Δ（ｔ）ｄｔ），Δ（ｔ）＝（２ｓｉｎｈｔ）２α＋１（２ｃｏｓｈｔ）２β＋１，１ｐ２，本文证明了当Ｒｅｚ＞（２／ｐ－１）（α＋１／２）时，ｆ的Ｆｏｕｒｉｅｒ－Ｊａｃｏｂｉ展开的ｚ－阶Ｒｉｅｓｚ平均几乎处处收敛于ｆ．该结果推广了Ｇｉｕｌｉｎｉ和Ｍａｕｃｅｒｉ在实秩为１的对称空间上的相应结果     

Scrambling index set of primitive digraphs

The scrambling index k(D)$k(D)$ of a primitive digraph D is the smallest positive integer k such that for every pair of vertices x and y, there exists a vertex v such that there exist directed walks of length k from x to v and from y to v. In this paper, we study the scrambling index set of primitive digraphs.     

k-分支星状树的第二几何算术指标

数学化学中,第二几何算术指标是新近提出的一个图的拓扑指标,它与Szeged指标和点PI指标具有紧密关系.如果树的一个顶点υ的度大于等于3,则称顶点υ是其一个分支点.通过树的第二几何算术指标的一个增加或减少的变换,刻画了k-分支星状树的第二几何算术指标的最值,同时确定了相应的极图.     

图的Hyper-Wiener指数的综述(英文)

设G是一个图.G的顶点u和v的距离是u和v之间最短路的长度.Wiener指数是G中所有无序顶点对之间距离之和,而Hyper-Wiener指数定义为WW(G)=?∑u,v∈V(G)d(u,v)+?∑u,v∈V(G)d2(u,v),式中的和取遍G的所有顶点对.本文总结了图的Hyper-Wiener指数的最近结论.     

Structural satisfaction in simple games

A fundamental maxim for any theory of social behavior is that knowledge of the theory should not cause behavior that contradicts the theory's assertions. Although this maxim consistently has been heeded in the theory of noncooperative games, it largely has been ignored in solution theory for cooperative games. Solution theory, the central concern of this paper, seeks to identify a subset of the feasible outcomes of a cooperative game that are ‘stable’ results of competition among participants, each of whom attempts to bring about an outcome he favors, rather than to prescribe ‘fair’ outcomes that accord with a standard of equity. We show that learning by participants about the solution theory can cause the outcomes identified as stable by certain solution concepts to become unstable, and discover that an important distinction in this regard is whether the solution concept requires each element of the solution set to defend itself against alternatives rather than relying on other elements for its defense. Finally, we develop a concept of ‘solid’ solutions which have a special claim for stability.The unifying theme of this paper concerns the sense in which certain outcomes of a cooperative game may be regarded as stable, and the extent to which this stability requires that the players are ignorant of the theory. Although the issues raised here have implications for the theory of cooperative games in general, Section 1 establishes the focus of the analysis on collective decision games. Section 2 develops some general perspectives on solution theory which are used in Sections 3 and 4 to evaluate the Condorcet solution, the core, the robust proposals set, von Neumann- Morgenstern solutions and competitive solutions. Section 5 presents the concept of a solid solution and relates this idea to the solution concepts reviewed earlier. We demonstrate that in general a solution concept has a strong claim to stability only if it is solid. Finally, Section 6 concludes by indicating that the basic argument also can be applied to Aumann and Maschler's bargaining sets and, more generally, to solution theory for any cooperative game.     

On the differences between Szeged and Wiener indices of graphs

Let G be a connected graph and η(G)=Sz(G)−W(G), where W(G) and Sz(G) are the Wiener and Szeged indices of G, respectively. A well-known result of Klav?ar, Rajapakse, and Gutman states that η(G)≥0, and by a result of Dobrynin and Gutman η(G)=0 if and only if each block of G is complete. In this paper, a path-edge matrix for the graph G is presented by which it is possible to classify the graphs in which η(G)=2. It is also proved that there is no graph G with the property that η(G)=1 or η(G)=3. Finally, it is proved that, for a given positive integer k,k≠1,3, there exists a graph G with η(G)=k.     

Hyper- and reverse-Wiener indices of F-sums of graphs

The Wiener index W(G)=∑_{u,v}⊂V(G)d(u,v), the hyper-Wiener index and the reverse-Wiener index , where d(u,v) is the distance of two vertices u,v in G, d²(u,v)=d(u,v)², n=|V(G)| and D is the diameter of G. In [M. Eliasi, B. Taeri, Four new sums of graphs and their Wiener indices, Discrete Appl. Math. 157 (2009) 794-803], Eliasi and Taeri introduced the F-sums of two connected graphs. In this paper, we determine the hyper- and reverse-Wiener indices of the F-sum graphs and, subject to some condition, we present some exact expressions of the reverse-Wiener indices of the F-sum graphs.     

Calculating the edge Wiener and edge Szeged indices of graphs

The edge Szeged and edge Wiener indices of graphs are new topological indices presented very recently. It is not difficult to apply a modification of the well-known cut method to compute the edge Szeged and edge Wiener indices of hexagonal systems. The aim of this paper is to propose a method for computing these indices for general graphs under some additional assumptions.