两两NQD序列部分和的强大数定律

By using the moment inequality, maximal inequality and the truncated method of random variables, we establish the strong law of large numbers of partial sums for pairwise NQD sequences, which extends the corresponding result of pairwise NQD random variables.     

双曲矩阵分解修正问题的一些结果

This paper considers the updating problem of the hyperbolic matrix factorizations. The sufficient conditions for the existence of the updated hyperbolic matrix factorizations are first provided. Then, some differential inequalities and first order perturbation expansions for the updated hyperbolic factors are derived. These results generalize the corresponding ones for the updating problem of the classical QR factorization obtained by Jiguang SUN.     

具有最小弧数且基指数为3的本原不可幂对称无环带号有向图

Let S be a primitive non-powerful symmetric loop-free signed digraph on even n vertices with base 3 and minimum number of arcs. In [Lihua YOU, Yuhan WU. Primitive non-powerful symmetric loop-free signed digraphs with given base and minimum number of arcs. Linear Algebra Appl., 2011, 434(5), 1215-1227], authors conjectured that D is the underlying digraph of S with exp(D) = 3 if and only if D is isomorphic to ED n,3,3 , where ED n,3,3 = (V, A) is a digraph with V = {1, 2, . . . , n}, A = {(1, i), (i, 1) | 3≤i≤n} ∪ {(2i-1, 2i), (2i, 2i-1) | 2≤i≤ n/2 } ∪ {(2, 3), (3, 2), (2, 4), (4, 2)}). In this paper, we show the conjecture is true and completely characterize the underlying digraphs which have base 3 and the minimum number of arcs.     

一类非自治Brinkman-Forchheimer系统的拉回$\mathcal{D}$-吸引子

The asymptotic behavior of solutions of the three-dimensional nonautonomous Brinkman-Forchheimer equation is investigated. And the existence of pullback global attractors in L2 (Ω) and H01(Ω) is proved, respectively.     

$U({\mathfrak {so}}(7,{\mathbb C}))$的向量表示的范畴化

The aim of this paper is to categorify the n-th tensor power of the vector representation of U (so(7, C)). The main tools are certain singular blocks and projective functors of the BGG category of the complex Lie algebra gl n .     

Cycles Containing a Subset of a Given Set of Elements in Cubic Graphs

The technique of contractions and the known results in the study of cycles in $3$-connected cubic graphs are applied to obtain the following result. Let $G$ be a $3$-connected cubic graph, $X\subseteq V(G)$ with $|X| = 16$ and $e\in E(G)$. Then either for every $8$-subset $A$ of $X$, $A\cup\{e\}$ is cyclable or for some $14$-subset $A$ of $X$, $A\cup\{e\}$ is cyclable.     

由广义微分算子定义的某些解析函数类的优化性质

本文首先引入了由广义微分算子定义的某些$p$叶解析函数新子类$S_{p,q,\lambda}^{m,j,l}[A,B;\gamma]$ 和 $H_{p,q,\lambda}^{m,j,l}(\alpha,\beta)$, 然后研究了该子类的优化性质, 所得结果推广了某些已知结论.     

Characterization of $(c)$-Riordan Arrays, Gegenbauer-Humbert-Type Polynomial Sequences, and $(c)$-Bell Polynomials

Here presented are the definitions of(c)-Riordan arrays and(c)-Bell polynomials which are extensions of the classical Riordan arrays and Bell polynomials.The characterization of(c)-Riordan arrays by means of the A-and Z-sequences is given,which corresponds to a horizontal construction of a(c)-Riordan array rather than its definition approach through column generating functions.There exists a one-to-one correspondence between GegenbauerHumbert-type polynomial sequences and the set of(c)-Riordan arrays,which generates the sequence characterization of Gegenbauer-Humbert-type polynomial sequences.The sequence characterization is applied to construct readily a(c)-Riordan array.In addition,subgrouping of(c)-Riordan arrays by using the characterizations is discussed.The(c)-Bell polynomials and its identities by means of convolution families are also studied.Finally,the characterization of(c)-Riordan arrays in terms of the convolution families and(c)-Bell polynomials is presented.     

一类超混沌系统解的有界性及其应用

本文研究了在保密通信中有着广泛应用的一类超混沌系统解的界,得到了该类超混沌系统解的界估计表达式.然后将所得到的界估计应用到完全同步之中去, 并做出了相应的数值模拟.     

一类高阶周期微分方程解的性质

本文研究了高阶线性微分方程$$f^{(k)}(z)+A_{k-2}(z)f^{(k-2)}(z)+\cdots+A_0(z)f(z)=0,\eqno(*)$$解的线性相关性,其中$A_j(z)(j=0,2,\ldots,k-2)$是常数, $A_1$为非常数的的整周期函数,周期为$2\pi i$,且是$e^z$的有理函数.在一定条件下,我们给出了方程(*)解的表示.