Differential equations and recursion relations for Laguerre functions on symmetric cones

We obtain the differential equation and recurrence relations satisfied by the Laguerre functions on an arbitrary symmetric cone .

     

具有奇异值分解性质的代数

设F为一个域,R为一个带有对合的F-代数,如果R上每一个矩阵都有奇异值分解(简称SVD),则称R为一个有SVD性质的F-代数.本文指出:R为一个有SVD性质的F-代数的充要条件是:R同构于R~+,或R~+上二次扩域,或R~+上四元数体((-1,-1)/R~+),其中R~+为R的对称元集合,并且R~+为一个Galois序闭域.     

An axiomatic approach to equivariant cohomology theories

This paper presents a translation of a theorem of Cartan into an equivariant setting. This work is largely based on the study of the homotopical algebra in the sense of Quillen of the category of simplicial objects over the category of rationalO _g-vector spaces. The application is a solution to the equivariant commutative cochain problem. This solution is slightly better than the solution obtained earlier by Triantafillou in that the transformation groupG need not be finite.     

Complemented ideals in the Fourier algebra of a locally compact group

In this paper we provide a necessary condition for a closed ideal in the Fourier algebra of a locally compact amenable group to be completely complemented. The classification of completely complemented ideals is completed in the case of an amenable discrete group. We also investigate the ideals possessing a bounded approximate identity.

     

On a supersymmetric nonlinear integrable equation in (2+1) dimensions

A supersymmetric integrable equation in (2+1) dimensions is constructed by means of the approach of the homogenous space of the super Lie algebra, where the super Lie algebra osp(3/2) is considered. For this (2+1) dimensional integrable equation, we also derive its Bäcklund transformation.     

Clifford algebra method for network expression,computation, and algorithm construction

Clifford algebra is introduced as a theoretical foundation for network topology expression and algorithm construction. Network nodes are coded with basis vectors in a vector space , and the edges and k‐walk routes can be expressed by 2‐blades and k‐blades, respectively, in the Clifford algebra Cl(n,0). The topologies among nodes, edges, and routes of networks can be directly calculated, and the network routes can be extended and traversed with oriented join products. The network algorithm construction processes based on Clifford algebra are instantiated by the single source shortest path algorithm. The experimental results on different scale random networks suggest that Clifford algebra is suited for network expression and relation computation. The Clifford algebra‐based shortest path algorithm is vivid and clear in geometric meaning and has great advantage on temporal and spatial complexity. Copyright © 2013 John Wiley & Sons, Ltd.     

Complementarity properties of the Lyapunov transformation over symmetric cones

The well-known Lyapunov's theorem in matrix theory/continuous dynamical systems asserts that a square matrix A is positive stable if and only if there exists a positive definite matrix X such that AX +XA* is positive definite. In this paper, we extend this theorem to the setting of any Euclidean Jordan algebra V . Given any element a ∈ V , we consider the corresponding Lyapunov transformation La and show that the P and S-properties are both equivalent to a being positive. Then we characterize the R0 -property for La and show that La has the R0 -property if and only if a is invertible. Finally, we provide La with some characterizations of the E0 -property and the nondegeneracy property.     

Many associated primes of powers of primes

We construct families of prime ideals in polynomial rings for which the number of associated primes of the second power (or higher powers) is exponential in the number of variables in the ring.     

益智游戏“汉诺塔”中的矩阵运算

汉诺塔(Tower of Hanoi)问题源于印度一个古老传说,据此做成了益智游戏,蕴含大量的数学思想与方法.本文采用矩阵描述汉诺塔状态和圆盘移动过程,将圆盘从一个位置移动到另一个位置转化为矩阵的加法,进而构造由若干可能状态矩阵组成的图的邻接矩阵,计算其幂矩阵,由此很方便地求得完成汉诺塔游戏的所有可能的圆盘移动方案,求解过程简单,含义清晰,易于理解和实现.