拉格朗日中值定理在方程有根证明题中的应用

对微分中值定理证明方程有根的题型作了分类,分析并讨论了证明中的技巧,及证明中所采用的方法,并对不同例子进行了相应的拓展.     

Distribution function estimates by Wasserstein metric and Bernstein approximation for C-1 functions

The aim of the paper is to estimate the density functions or distribution functions measured by Wasserstein metric, a typical kind of statistical distances, which is usually required in the statistical learningBased on the classical Bernstein approximation, a scheme is presented.To get the error estimates of the scheme, the problem turns to estimating the L1 norm of the Bernstein approximation for monotone C-1functions, which was rarely discussed in the classical approximation theoryFinally, we get a probability estimate by the statistical distance.     

生态平衡制约下离散尺度结构种群的最优收获

研究基于扩展Leslie投影矩阵的离散尺度结构种群模型的最优收获问题,约束条件包括生态平衡和开发成本等.运用凸优化理论证明了最优收获策略的存在性,导出了最优收获模式,应用模型参数给出了收获比率.结论显示:最优策略具有两阶段结构.     

带连续变利率风险模型最终破产概率上界

考虑了带二元连续变利息力的Sparre Andersen风险模型.研究了积累值盈余过程的表达式与性质;在利率递增环境下,利用推广后的调节系数方程组与递归技术推导了最终破产概率的上界,结论表明得到的破产概率上界是更为一般的Lundberg指数上界.     

多项式环中单项式理想的分解

利用单项式理想生成元的性质,给出了一类特殊单项式理想(生成元是变量的纯幂)的幂的分解表达式,这不仅拓宽了我们对多项式理论内容的认识,而且这样的分解表达式提供了这类单项式理想正则度(Castelnuovo-Mumford regularity)计算的方法.     

3阶幂图的广义导出匹配可扩性

A graph G is induced matching extendable if every induced matching of G is included in a perfect matching of G. A graph G is generalized induced matching extendable if every induced matching of G is included in a maximum matching of G. A graph G is claw-free, if G dose not contain any induced subgraph isomorphic to K1,3. The k-th power of G, denoted by Gu, is the graph with vertex set V（G） in which two vertices are adjacent if and only if the distance between them is at most k in G. In this paper we show that, if the maximum matchings of G and G3 have the same cardinality, then G3 is generalized induced matching extendable. We also show that this result is best possible. As a result, we show that if G is a connected claw-flee graph, then G3 is generalized induced matching extendable.     

带负顾客和非空竭服务随机休假的M~([x])/G/1可修排队系统

研究了带负顾客和非空竭服务随机休假的M~([X])/G/1可修排队系统.负顾客不仅仅移除一个正在接受服务的正顾客,而且还使得服务器损坏而立即进行修理.通过构造一个具有吸收态的马尔可夫链求得了系统稳态存在的充分必要条件.利用补充变量法求得了系统的排队指标和可靠性指标.最后我们还给出了一个数值实例.     

ND阵列加权乘积和的完全收敛性

设（Xni：1≤i≤n,n≥1）为行间ND阵列,g（x）是R^＋上指数为α的正则变化函数,{αni：1≤i≤n,n≥1}为满足条件max1≤i≤n｜ani｜=0（（g（n））^-1）的实数阵列．本文采用截尾的方法,得到了使ND随机变量阵列加权乘积和完全收敛的条件,并推广了以前学者的结论．     

Deleting Vertices and Interlacing Laplacian Eigenvalues

The authors obtain an interlacing relation between the Laplacian spectra of a graph G and its subgraph G - U, which is obtained from G by deleting all the vertices in the vertex subset U together with their incident edges. Also, some applications of this interlacing property are explored and this interlacing property is extended to the edge weighted graphs.     

Twisted analytic torsion

We review the Reidemeister, Ray-Singer’s analytic torsion and the Cheeger-Mller theorem. We describe the analytic torsion of the de Rham complex twisted by a flux form introduced by the current authors and recall its properties. We define a new twisted analytic torsion for the complex of invariant differential forms on the total space of a principal circle bundle twisted by an invariant flux form. We show that when the dimension is even, such a torsion is invariant under certain deformation of the metric and the flux form. Under T-duality which exchanges the topology of the bundle and the flux form and the radius of the circular fiber with its inverse, the twisted torsion of invariant forms are inverse to each other for any dimension.