从$A^{p}_{\alpha}$到$A^{\infty}(\varphi)$的加权复合算子

设$u \in H(D), \ \phi$为$D$上的解析自映射,定义$H(D)$上的加权复合算子为$u C_{\phi}(f)=$$uf\circ\phi$, \ $f\in H(D)$.本文得到了从$A^{p}_{\alpha}$到$A^{\infty}(\varphi)\ (A_{0}^{\infty}(\varphi))$的加权复合算子$u C_{\phi}$的有界性和紧性的充要条件.     

一类复映射$z\leftarrow e^{i\phi}(\bar{z})^\alpha+c~ (\alpha<0)$的广义M集

本文分析了一类复映射$z \leftarrow e^{i\phi }(\bar {z})^\alpha +c\{\alpha < 0,\phi \in [0,2\pi)\}$的临界点的性质,给出了广义Mandelbrot集 (简称广义M集)的定义,并构造出一系列广义M集.利用复变函数理论和计算机制图相结合的实验数学的方法,本文对广义M集的结构和演化进行了研究,结果表明: 1). 广义M集的几何结构依赖于参数$\alpha$, $R$和$\phi$; 2). 整数阶广义M集具有对称性和分形特征; 3). 小     

G_(v_i)~*型图的伴随多项式的因式分解及其色性分析

通过研究图的伴随多项式的因式分解 ,给出了证明非色唯一图的一种新的途径 ,并且得到了色等价图簇的结构特征 .     

$R(G)\ge -1$的图族伴随多项式最小根极值的刻画

本文引入了图族伴随多项式的最小根极值,用它刻画了特征标不小于$-1$的图族伴随多项式的最小根极值,给出了其对应的极图, 并由此得到了一些有关这些图族伴随多项式最小根序关系的新结果.     

一类$L^2(\mathbb{R}^n)$的紧支撑不可分正交小波

本篇文章给出一类$L^{2}(\mathbb{R}^{n})$, $n\geq2$的紧支撑不可分正交小波基的具体构造算法,其中正交小波的伸缩矩阵为$\alpha I_{n}~(\alpha\geq2,\ \alpha \in \mathbb{Z})$, $I_{n}$是$n$阶单位矩阵.最后给出两个不可分正交小波基的构造算例.     

$T_{2}(T)$的几乎可裂序列及几乎$\mathcal {D}$-可裂序列

The AR-quiver and derived equivalence are two important subjects in the representation theory of finite dimensional algebras, and for them there are two important research tools-AR-sequences and D-split sequences. So in order to study the representations of triangular matrix algebra T2 (T ) = T0TT where T is a finite dimensional algebra over a field, it is important to determine its AR-sequences and D-split sequences. The aim of this paper is to construct the right(left) almost split morphisms, irreducible morphisms, almost split sequences and D-split sequences of T2 (T) through the corresponding morphisms and sequences of T. Some interesting results are obtained.     

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

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

从 ${\cal B}^0$ 到 $E(p,q)$ 和 $E_0(p,q)$ 空间的复合算子

设 $\varphi$ 是单位园盘 $D$ 到自身的解析映射, $X$ 是 $D$ 上解析函数的 Banach 空间, 对 $f\in X$, 定义复合算子$C_\varphi $ : $C_\varphi (f)=f\circ \varphi$. 我们利用从 ${\cal B}^0$到 $E(p,q)$ 和 $E_0(p,q)$ 空间的复合算子研究了空间 $E(p,q)$ 和 $E_0(p,q)$, 给出了一个新的特征.     

偶图$K_{n,n+7}-A(|A|\leq3)$的圈长分布唯一性

阶为$n$的图$G$的圈长分布是序列($c_1,c_2,\ldots,c_n$), 其中$c_i$是图$G$中长为$i$的圈数.本文得到如下结果: 设$A\subseteq E(K_{n,n+7})$,在以下情况, 图 $G$ 由其圈长分布唯一确定.(1) $G=K_{n,n+7}$(n\geq10)$;(2) $G=K_{n,n+7}-A$ $(|A|=1,n\geq12)$;(3)$G=K_{n,n+7}-A$(|A|=2,n\geq14)$;(4)$G=K_{n,n+7}-A$ $(|A|=3     

由圈长分布确定的二部图~$K_{n,n r}-A\ (|A|\leq 3)$

The cycle length distribution of a graph G of order n is a sequence （c1 （G）,…, cn （G））, where ci （G） is the number of cycles of length i in G. In general, the graphs with cycle length distribution （c1（G） ,…,cn（G）） are not unique. A graph G is determined by its cycle length distribution if the graph with cycle length distribution （c1 （G）,…, cn （G）） is unique. Let Kn,n＋r be a complete bipartite graph and A lohtaib in E（Kn,n＋r）. In this paper, we obtain： Let s 〉 1 be an integer. （1） If r = 2s, n 〉 s（s - 1） ＋ 2｜A｜, then Kn,n＋r - A （A lohtain in E（Kn,n＋r）,｜A｜ ≤ 3） is determined by its cycle length distribution; （2） If r = 2s ＋ 1,n 〉 s^2 ＋ 2｜A｜, Kn,n＋r - A （A lohtain in E（Kn,n＋r）, ｜A｜ ≤3） is determined by its cycle length distribution.     

两类图色唯一的充分必要条件

利用图的伴随多项式的性质,给出了两类图色唯一的充分必要条件     

Navigating in the Cayley Graphs of {\rm SL}_{N}(\mathbb{Z}) and {\rm SL}_{N}(\mathbb{F}_{p})

We give a nondeterministic algorithm that expresses elements of , for N ≥ 3, as words in a finite set of generators, with the length of these words at most a constant times the word metric. We show that the nondeterministic time-complexity of the subtractive version of Euclid’s algorithm for finding the greatest common divisor of N ≥ 3 integers a₁, ..., a_N is at most a constant times . This leads to an elementary proof that for N ≥ 3 the word metric in is biLipschitz equivalent to the logarithm of the matrix norm – an instance of a theorem of Mozes, Lubotzky and Raghunathan. And we show constructively that there exists K>0 such that for all N ≥ 3 and primes p, the diameter of the Cayley graph of with respect to the generating set is at most .Mathematics Subject Classification: 20F05     

完全解决图$\overline{B_{n-8,1,4}}$的色等价类

Two graphs are defined to be adjointly equivalent if and only if their complements are chromatically equivalent.Using the properties of the adjoint polynomials and the fourth character R₄（G）,the adjoint equivalence class of graph B_n-8,1,4 is determined.According to the relations between adjoint polynomial and chromatic polynomial,we also simultaneously determine the chromatic equivalence class of B_n-8,1,4 that is the complement of B_n-8,1,4.     

关于一类实二次域的类数与基本单位的上界

设素数P≡1(mod4),k,ε分别表示实二次域Q(p~(1/2))类数和基本单位．本文改进了类数h和基本单位ε的上界,证明了:hlogeε<1/4(p~(1/2) 6)log(2ep~(1/2)),并得到了几个重要的推论．     

一类T形树匹配唯一的充要条件

证明：若m∈Ze^ ,则T形树T(1,m,n）匹配唯一当且仅当n≠m,m 3,2m 5.     

The Boundedness of Littlewood-Paley Operators with Rough Kernels on Weighted $(L^q,L^p)^{\alpha}(\mathbf{R}^n)$ Spaces

In this paper, we shall deal with the boundedness of the Littlewood-Paley operators with rough kernel. We prove the boundedness of the Lusin-area integral $\mu_{\Omega,s}$ and Littlewood-Paley functions $\mu_{\Omega}$ and $\mu^{*}_{\lambda}$ on the weighted amalgam spaces $(L^{q}_\omega,L^{p})^{\alpha}(\mathbf{R}^{n})$ as $1 < q\leq \alpha < p\leq \infty$.     

不同分布的卷积的局部封闭性及局部渐近性的充分条件和必要条件

得到了支撑在[O,∞)上的不同分布的卷积(包括卷积根)的局部封闭性及局部渐近性的充分条件和必要条件,它揭示了不同分布的卷积及两两卷积之间的内在关系.这一结果的充分性部分推广了Geluk等非局部的相应结果,并且两者使用的方法是不同的;而这一结果的必要性部分是Geluk等人的结果中所没有的.最后,讨论了(-∞,∞)上不同分布卷积的局部封闭性及局部渐近性.     

A Version of the {\cal G} \rm{-conditional Bipolar Theorem in} {L^0 (\mathbb{R}^{d}_{+};\Omega}, {\cal F},\mathbb{P})

Motivated by applications in financial mathematics, Ref. 3 showed that, although fails to be locally convex, an analogue to the classical bipolar theorem can be obtained for subsets of : if we place this space in polarity with itself, the bipolar of a set of non-negative random variables is equal to its closed (in probability), solid, convex hull. This result was extended by Ref. 1 in the multidimensional case, replacing by a closed convex cone K of [0, )^d, and by Ref. 12 who provided a conditional version in the unidimensional case. In this paper, we show that the conditional bipolar theorem of Ref. 12 can be extended to the multidimensional case. Using a decomposition result obtained in Ref. 3 and Ref. 1, we also remove the boundedness assumption of Ref. 12 in the one dimensional case and provide less restrictive assumptions in the multidimensional case. These assumptions are completely removed in the case of polyhedral cones K.     

A Necessary and Sufficient Condition for the Existence of a Heterochromatic Spanning Tree in a Graph

We prove the following theorem. An edge-colored (not necessary to be proper) connected graph G of order n has a heterochromatic spanning tree if and only if for any r colors (1≤r≤n−2), the removal of all the edges colored with these r colors from G results in a graph having at most r+1 components, where a heterochromatic spanning tree is a spanning tree whose edges have distinct colors.