TUHF代数上的Lie导子

证明了TUHF代数丁上的Lie导子L形如D l．其中D是T上的结合导子，l是从T到它的中心Z上的线性映射且零化T中的括积．     

扭的Multi-loop代数的triple导子

设G是三维实李代数so(3)的复化李代数,A=C[T_1~(±1),t_2~(±2)]为复数域上的多项式环.设L(t_1,t_2,1)=G(?)_cA,d_1,d_2为L(t_1,t_2,1)的度导子.最近我们研究了李代数L(t_1,t_2,1)的自同构群结构.研究扭的Multi-loop代数L(t_1,t_2,1)(?)(Cd_1(?)Cd_2)的导子以及triple导子结构.     

JBW-代数上的局部导子

本文证明了JBW-代数上的局部导子是导子,举反例说明了JBW-代数上的局部内导子未必是内导子,并且给出了JBW-代数的一个充要条件使得它上的局部内导子是内导子,     

CSL代数上的Lie导子

证明了不相关的有限宽度CSL代数上的每一个Lie导子都是内导子与作用在交换子上为零的中心值线性映射之和.     

von Neumann代数中套子代数上的Lie导子

本文对因子von Neumann代数中套子代数上的线性映射L:alg_Mβ→M满足L(AB—BA)=L(A)B-BL(A)+AL(B)-L(B)A( A,B∈alg_Mβ)进行了刻划,证明了存在线性函数h:alg_Mβ→C;且对任意A,B∈alg_Mβ,有h(AB—BA)=0和算子T∈M,使得对任意X∈alg_Mβ,都有L(X)=XT-TX+h(X)I.     

一类广义W型李超代数

构造了一类有限维广义Caxtan型模李超代数W,并证明了它是李超代数W(n)的一个扩张,进而决定了它的导子超代数.     

某些算子代数的可加导子

本文主要研究非Ｉｎ型因子ＶｏｎＮｅｕｍａｎｎ代数的Ｎｅｓｔ子代数及两元生成格自反代数的可加导子的自动线性性和连续性问题．通过给出一个含无限维交换ＶｏｎＮｅｕｍａｎｎ子代数的代数上可加导子定理，证明了非Ｉｎ型因子ＶｏｎＮｅｕｍａｎｎ代数的Ｎｅｓｔ子代数上的可加导子是线性的，从而是自动连续的．这推广并简化证明了作者［１］中的主要结果．对于在非自伴算子代数研究中起重要的两元生成格自反代数，给出了所有可加导子是线性导子的充分必要条件．     

M_2(R)上的非线性Lie导子

设R是一个含有单位元的2无扰的交换环,M_2(R)是定义在R上的全矩阵代数,证明了M_2(R)上的每一个非线性Lie导子都可以表示成一个内导子,一个可加诱导导子和一个映所有二次换位子为零的中心映射的和.     

一类广义W型李超代数

构造了一类有限维广义Cartan型模李超代数W,并证明了它是李超代数W(n)的一个扩张,进而决定了它的导子超代数.     

Weyl型单代数

对于任意特征的域F上具有单位元的交换结合代数A和它的交换导子的子空间D的多项式代数F［Ｄ］,在张量空间A［Ｄ］=AÄF［Ｄ］中定义了Weyl型结合代数和Lie代数.证明了A［Ｄ］作为Lie代数(模去中心)或结合代数是单的充要条件是A为D-单的并且A［Ｄ］在A上的作用是忠实的.[KG*2]由此可构造出许多单代数.     

二次曲面和平面位置关系的判式

在解析几何中有二次曲线与直线位置关系的讨论、二次曲面与直线位置关系的讨论,而二次曲面与平面相关位置关系的探讨较少.本文给出二次曲面a11x2+a22y2+a33z2+2a12xy+2a13xz+2a23yz+2a14x+2a24y+2a34z+a44=0(1)和平面Ax+By+Cz+D=0(2)的相对位置的判别式Δ=a11a12a13a14Aa21a22a23a24Ba31a32a33a34Ca41a42a43a44DA B C D0(aij=aji).(3)并证明了:若Δ>0,则二次曲面(1)与平面(2)相交;若Δ=0,则(1)和(2)相切;若Δ<0,则(1)和(2)相离.     

Subspaces and quotients of Banach spaces with shrinking unconditional bases

The main result is that a separable Banach space with the weak* unconditional tree property is isomorphic to a subspace as well as a quotient of a Banach space with a shrinking unconditional basis. A consequence of this is that a Banach space is isomorphic to a subspace of a space with a shrinking unconditional basis if and only if it is isomorphic to a quotient of a space with a shrinking unconditional basis, which solves a problem dating to the 1970s. The proof of the main result also yields that a uniformly convex space with the unconditional tree property is isomorphic to a subspace as well as a quotient of a uniformly convex space with an unconditional finite dimensional decomposition.     

Scalarization of Henig Proper Efficient Points in a Normed Space

In a general normed space equipped with the order induced by a closed convex cone with a base, using a family of continuous monotone Minkowski functionals and a family of continuous norms, we obtain scalar characterizations of Henig proper efficient points of a general set and a bounded set, respectively. Moreover, we give a scalar characterization of a superefficient point of a set in a normed space equipped with the order induced by a closed convex cone with a bounded base.     

Two questions on semi-clean group rings

It was proved in [4] that every group ring of a torsion abelian group over a commutative local ring is a semi-clean ring. It was asked in [4] whether every group ring of a torsion abelian group over a commutative clean ring is a semi-clean ring and whether every group ring of a torsion abelian group over a commutative semi-clean ring is a semi-clean ring. In this paper, we give a positive answer to question 1 and a negative answer to question 2.     

A generalized duality and applications

The aim of this paper is to present a nonconvex duality with a zero gap and its connection with convex duality. Since a convex program can be regarded as a particular case of convex maximization over a convex set, a nonconvex duality can be regarded as a generalization of convex duality. The generalized duality can be obtained on the basis of convex duality and minimax theorems. The duality with a zero gap can be extended to a more general nonconvex problems such as a quasiconvex maximization over a general nonconvex set or a general minimization over the complement of a convex set. Several applications are given.On leave from the Institute of Mathematics, Hanoi, Vietnam.     

图的分数k-因子

给定图G=(V,E).设a和b是两个非负整数.fE→［0,1］是一个函数.如果     

Inventory replenishment model: lot sizing versus just-in-time delivery

Motivated by a practical industrial problem where a manufacturer stipulates a minimum order from each buyer but where a local dealer promises the buyer a just-in-time delivery with a slightly higher unit cost, this paper uses a dynamic lot-sizing model with a stepwise cargo cost function and a minimum order amount constraint to help the buyer select the supplier with minimum total cost.     

A recognition algorithm for the intersection graphs of directed paths in directed trees

Consider a finite family of non-empty sets. The intersection graph of this family is obtained by representing each set by a vertex, two vertices being connected by an edge if and only if the corresponding sets intersect. The intersection graph of a family of directed paths in a directed tree is called a directed path graph. In this paper we present an efficient algorithm which constructs to a given graph a representation by a family of directed paths on a directed tree, if one exists. Also, we prove that a graph is a proper directed path graph if and only if it is a directed path graph.     

Topological representation of posets

There is a canonical imbedding of a poset into a complete Boolean lattice and hence into a Boolean lattice. This gives it a representation as a collection of clopen sets of a Boolean space. There are reflective functions from a category of distributive posets to the subcategories of distributive and Boolean lattices and consequently a topological dual equivalence that extends the Stone duality of Boolean lattices.Presented by B. Jonsson.     

A splitting theorem for groups acting on quasi-trees

It is well known that a group is free if and only if it acts freely without inversions on a tree. We prove a generalisation of this fact by defining a quasi-tree to be a graph with a bound on the size of its simple loops. It is shown that a finitely generated group acting freely on such a graph is isomorphic to a free product of free groups and finite groups.