Construct weak Hopf algebras by using Borcherds matrix

We define a new kind quantized enveloping algebra of a generalized Kac-Moody algebra by adding a new generator J satisfying jm = j for some integer m. We denote this algebra by wUqT（A）. This algebra is a weak Hopf algebra if and only if m = 2,3. In general, it is a bialgebra, and contains a Hopf subalgebra. This Hopf subalgebra is isomorphic to the usual quantum envelope algebra Uq （A） of a generalized Kac-Moody algebra A.     

矩阵因子分解及其应用举例

通过矩阵方程定义了矩阵的左、右因子和双因子,给出了各类因子存在的充要条件,并将其应用到满秩分解和极分解等典型例子中.论证中,采用多种观点和方法,空间映射、矩阵运算并重.     

On non-normal arc-transitive 4-valent dihedrants

Let X be a connected non-normal 4-valent arc-transitive Cayley graph on a dihedral group Dn such that X is bipartite, with the two bipartition sets being the two orbits of the cyclic subgroup within Dn. It is shown that X is isomorphic either to the lexicographic product Cn[2K1] with n 〉 4 even, or to one of the five sporadic graphs on 10, 14, 26, 28 and 30 vertices, respectively.     

Counting isomorphism classes of pointed hyperelliptic curves of genus 4 over finite fields with even characteristic

This paper is devoted to counting the number of isomorphism classes of pointed hyperelliptic curves over finite fields. We deal with the genus 4 case and the finite fields are of even characteristics. The number of isomorphism classes is computed and the explicit formulae are given. This number can be represented as a polynomial in q of degree 7, where q is the order of the finite field. The result can be used in the classification problems and it is useful for further studies of hyperelliptic curve cryptosystems, e.g. it is of interest for research on implementing the arithmetics of curves of low genus for cryptographic purposes. It could also be of interest for point counting problems; both on moduli spaces of curves, and on finding the maximal number of points that a pointed hyperelliptic curve over a given finite field may have.     

模李超代数W(m,n,t)上的左超对称结构

该文讨论了etale超仿射表示的相关性质.对一类具体的Cartan型模李超代数W:=W(m,n,t),通过引入平移同构,诱导出W上的左超对称结构,并且决定出W上的一类左超对称结构.同时通过平移同构推广了混合积定理.     

FI代数的犹豫模糊滤子与犹豫模糊同余关系

将犹豫模糊集概念与FI代数的滤子和同余关系概念相结合,引入了FI代数的犹豫模糊滤子和犹豫模糊同余关系概念并研究它们的性质和相互关系.获得了FI代数在给定犹豫模糊同余关系下的商代数特征并建立了同态基本定理.证明了当分别在CFI代数的全体犹豫模糊滤子集和全体犹豫模糊同余关系集上定义适当的序关系后,二者保序同构.     

因子von Neumann代数中套子代数上的Jordan同构

研究了因子yon Neumann代数中套子代数上的Jordan同构,证明了套子代数algMβ和algMγ之间的每一个Jordan同构φ:要么是同构;要么是反同构.     

Mbius立方体的拓扑结构性质

超立方体网络是目前在超级计算机处理器结构中应用得最广泛的拓扑结构,Mbius立方体是超立方体的一种变形,已经被证明它在某些方面具有优于超立方体的拓扑性质.本文指出了n维Mbius立方体递归结构的一些重要拓扑性质.     

分片代数集合的不可约性和同构

本文利用多元样条函数来定义分片代数集合,讨论了分片代数集合的不可约性和同构问题,给出了分片代数集合不可约的两个等价条件,并把分片代数集合的同构分类问题转化为交换代数的同构分类问题。     

Cayley图的同构分解及弱DCI-子集的充要条件

本文得到了Ｃａｙｌｅｙ图的同构分解定理及弱ＤＣＩ－子集的充要条件．证明了二面体群是弱２－ＤＣＩ－群，同时确定了二面体群上２度Ｃａｙｌｅｙ图的自同构群．