定向图的斜Randic能量

图G是一个简单无向图,G~σ是图G在定向σ下的定向图,G被称作G~σ的基础图.定向图G~σ的斜Randi6矩阵是实对称n×n矩阵R_s(G~σ)=[(r_s)_(ij)].如果(v_i,v_j)是G~σ的弧,那么(r_s)_(ij)=(d_id_j)~(-1/2)且(r_s)_(ji)=(d_id_j)~(-1/2),否则(r_s)_(ij)=(r_s)_(ji)=0.定向图G~σ的斜Randi能量RE_s(G~σ)是指R_s(G~σ)的所有特征值的绝对值的和.首先刻画了定向图G~σ的斜Randi矩阵R_s(G~σ)的特征多项式的系数.然后给出了定向图G~σ的斜Randi能量RE_s(G~σ)的积分表达式.之后给出了RE_s(G~σ)的上界.最后计算了定向圈的斜Randi能量RE_s(G~σ).     

厚尾相依序列的均值变点估计

本文研究了厚尾相依序列的均值变点估计. 证明了变点的CUSUM估计的一致性并得到了收敛速度.在方差无穷的情况下推广了H\'{a}jek--R\'{e}nyi不等式.     

Sz\''asz-Kantorovich-B\''{e}zier算子在$L_p[0, \infty)$上的逼近定理

本文利用Ditzian-Totik模得到了Sz\'{a}sz-Kantorovich-B\'{e}zier算子在$L_{p}[0,\infty)$空间逼近的正逆定理及等价定理.     

三角B\''{e}zier曲面和四边B\''{e}zier曲面之间的相互转化

B\'{e}zier曲面有两种不同的形式:三角B\'{e}zier曲面和四边B\'{e}zier曲面,它们有着不同的基底和不同的几何拓扑结构, 但是它们也有很多共同的性质,因此三角B\'{e}zier曲面和四边B\'{e}zier曲面之间的相互转化就成为CAGD 里一个重要研究课题.在本文中, 我们用函数复合的方法实现两者之间的相互转化.被复合的两个函数, 一个用Polar形式表示,另一个用常见的Bernstein基形式表示.     

非广义$\mathcal {H}$-张量的判定准则[英文]

给出判定非广义$\mathcal {H}$-张量的充要条件, 从理论上彻底解决了不可约非广义$\mathcal {H}$-张量的判定问题, 并给出判定不可约非广义$\mathcal {H}$-张量的具体算法. 最后, 利用数值算例表明了结果的有效性.     

论Poincar\''{e}型连续统及其某些基本性质

本文给出了Poincar\'{e}直觉主义连续统的一种超标准模型[PC],并证明了三条基本性质. [PC]是模型(PC)的深化和改进.作为其应用,文中还概述了子模型$\overline{R}$ (非Cantor型连续统)上的一种非标准微积分.     

关于Sz\''{a}sz算子的强逆不等式

本文应用新的$K$-泛函$K_{\lambda}^{\alpha}(f,t^2)=\inf_{g\in C_{\lambda}^2}\{\|f-g\|_0+t^2\|g\|_2\}, ~~0\leq \lambda\leq 1, 0<\alpha<2,$得到了Sz\'{a}sz算子关于$K$-泛函的强逆不等式,其中$\|\cdot\|_{0}, \|\cdot\|_2, C_\lambda^2 $定义在文中给出. 作为其应用, 我们推广了以前的结果.     

与广义Schr\"{o}dinger算子相关的Marcinkiewicz积分[英文]

令$\mathcal{L}=-\Delta+\mu$为$\mathbb{R}^n$上的广义Schr\"{o}dinger算子, $n\geqslant3$, 其中 $\mu\neq0$是满足尺度不变Kato条件和双倍条件的非负Radon测度. 本文使用经典不等式估计, 利用变指标和附加函数的性质, 证明了与广义Schr\"{o}dinger算子相关的Marcinkiewicz积分算子在变指标Herz-Morrey空间上是有界的.     

BMOA空间与Bloch型空间之间的加权Ces\''{a}ro算子

本文研究单位圆盘上的BMOA空间和$\a$-Bloch型空间之间的加权 Ces\'{a}ro 算子,给出了$\tg$是BMOA空间到$\ba$空间的有界算子或紧算子的充分必要条件.     

图的广义Randi Estrada指标的界

受图的Randi Estrada指标和广义Randic能量的启发,定义了图的广义Randi Estrada指标.利用代数方法和初等分析方法给出了n阶简单连通图和r-正则图的广义Randi Estrada指标的上下界,推广了Bozkurt等人有关Randi Estrada指标的结论.     

关于商高数的Je\''{s}manowicz猜想

Let(a, b, c) be a primitive Pythagorean triple. Je′smanowicz conjectured in 1956 that for any positive integer n, the Diophantine equation(an)x+(bn)y=(cn)z has only the positive integer solution(x, y, z) =(2, 2, 2). Let p ≡ 3(mod 4) be a prime and s be some positive integer. In the paper, we show that the conjecture is true when(a, b, c) =(4p2s-1, 4p s, 4p2s+ 1) and certain divisibility conditions are satisfied.     

PA���е�H\'{a}jek-R\'{e}nyi�Ͳ���ʽ��ǿ��������

In this paper, a new H\'{a}jek-R\'{e}nyi-type inequality for mean zero associated random variables is obtained, which generalizes and improves the result of Theorem 2.2 of \ncite{9}. In addition, a Brunk-Prokhorov-type strong law of large numbers is also given.     

伪多元函数的Padé型逼近

给出伪多元函数的Pad\'{e}型逼近,其优点在于:简化了多元函数有理逼近的计算,加速了函数在奇点处的收敛.并讨论其性质以及误差分析.     

General order multivariate Padé approximants for pseudo-multivariate functions

Although general order multivariate Padé approximants were introduced some decades ago, very few explicit formulas for special functions have been given. We explicitly construct some general order multivariate Padé approximants to the class of so-called pseudo-multivariate functions, using the Padé approximants to their univariate versions. We also prove that the constructed approximants inherit the normality and consistency properties of their univariate relatives, which do not hold in general for multivariate Padé approximants. Examples include the multivariate forms of the exponential and the -exponential functions

and

as well as the Appell function

and the multivariate form of the partial theta function

     

二部图形式的Erd\H{O}s-S\''{o}s猜想

二部图形式的Erd\H{O}s-S\''{o}s猜想     

二树的ABC指标

The atom-bond connectivity(ABC) index of a graph G, introduced by Estrada,Torres, Rodr′?guez and Gutman in 1998, is defined as the sum of the weights(1/di+1/dj-2/didj )~(1/2) of all edges vivj of G, where di denotes the degree of the vertex vi in G. In this paper, we give an upper bound of the ABC index of a two-tree G with n vertices, that is, ABC(G) ≤(2n- 4)2~(1/2)/2+(2n-4)~(1/2)/n-1. We also determine the two-trees with the maximum and the second maximum ABC index.     

Bounds of the Estrada index of graphs

Let G be a graph of order n and let λ1,λ2,...,λn be its eigenvalues. The Estrada index[2] of G is defined as EE = EE(G) =∑n i=1 eλi. In this paper, new bounds for EE are established, as well as some relations between EE and graph energy E.