Duality for Finite Hopf Algebras Explained by Corings

We give a coring version for the duality theorem for actions and coactions of a finitely generated projective Hopf algebra. We also provide a coring analogue for a theorem of H.-J. Schneider, which generalizes and unifies the duality theorem for finite Hopf algebras and its refinements. This paper was written while the first author visited the Mathematics Departments of Syracuse University and California State University Dominguez Hills. He would like to thank both departments for their hospitality.     

A computer-assisted proof of Saari's conjecture for the planar three-body problem

The five relative equilibria of the three-body problem give rise to solutions where the bodies rotate rigidly around their center of mass. For these solutions, the moment of inertia of the bodies with respect to the center of mass is clearly constant. Saari conjectured that these rigid motions are the only solutions with constant moment of inertia. This result will be proved here for the planar problem with three nonzero masses with the help of some computational algebra and geometry.

     

Extensions of Modules over Schur Algebras, Symmetric Groups and Hecke Algebras

We study the relation between the cohomology of general linear and symmetric groups and their respective quantizations, using Schur algebras and standard homological techniques to build appropriate spectral sequences. As our methods fit inside a much more general context within the theory of finite-dimensional algebras, we develop our results first in that general setting, and then specialize to the above situations. From this we obtain new proofs of several known results in modular representation theory of symmetric groups. Moreover, we reduce certain questions about computing extensions for symmetric groups and Hecke algebras to questions about extensions for general linear groups and their quantizations.     

Gorenstein代数上的Hopf代数作用

令H是有限维Hopf代数，A是左H-模代数。本文证明了A是Gorenstein代数的充分必要条件。A^H也是Gorenstein代数的条件。它是Enochs EE,GarciaJJ和del RioA关于群作用相应的理论的推广，同时给出A/A^H是Frobenius扩张的条件。     

On many‐sorted algebraic closure operators

A theorem of Birkhoff‐Frink asserts that every algebraic closure operator on an ordinary set arises, from some algebraic structure on the set, as the corresponding generated subalgebra operator. However, for many‐sorted sets, i.e., indexed families of sets, such a theorem is not longer true without qualification. We characterize the corresponding many‐sorted closure operators as precisely the uniform algebraic operators. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Topological Simplicity of a Certain LF-Algebra

We show that the LF-algebra considered by Akkar and Nacir in [1] is topologically simple.     

The universal nilpotent group compactification of a semigroup

The purpose of this paper is to introduce an algebra of functions on a semitopological semigroup and to study these functions from the point of view of universal semigroup compactification. We show that the corresponding semigroup compactification of this algebra is universal with respect to the property of being a nilpotent group.

     

Interpolation of positive operators

We study problems of interpolation of positive linear operators in couples of ordered Banach spaces. From this viewpoint, we study couples of noncommutative spaces L ₁, L _∞ associated with weights and traces on von Neumann algebras.     

A parametric representation of linguistic hedges in Zadeh’s fuzzy logic

This paper proposes a model for the parametric representation of linguistic hedges in Zadeh’s fuzzy logic. In this model each linguistic truth-value, which is generated from a primary term of the linguistic truth variable, is identified by a real number r depending on the primary term. It is shown that the model yields a method of efficiently computing linguistic truth expressions accompanied with a rich algebraic structure of the linguistic truth domain, namely De Morgan algebra. Also, a fuzzy logic based on the parametric representation of linguistic truth-values is introduced.     

求解通信网节点间全部路由的逻辑代数化算法

经典的D IJKSTRA和BELLM AN-F LOYD通信网络路由算法,只能根据特定网络参数得到最佳路由,却无法获得网络存在的全部可用路由,而通信网理论研究及网络管理等方面,往往需要获得节点之间的全部可用路由.研究出一种路由新算法,遵循逻辑代数运算规则、采用关联矩阵中行与行之间整合与删除方式计算,N个节点的网络只需N-1次整合及删除运算,就能得到源节点到任意节点两点之间全部路由结果.详细论证了算法的正确性与合理性,简介了算法的并行运算可行性及与经典路由算法的兼容性等问题.通过算例详细说明算法的计算过程,并验证其正确性.