Additive Hermitian idempotent preservers between operator algebras

Let L be an additive map between (real or complex) matrix algebras sending $n\times n$ Hermitian idempotent matrices to $m\times m$ Hermitian idempotent matrices. We show that there are nonnegative integers $p,q$ with $n(p+q)=r\le m$ and an $m\times m$ unitary matrix U such that$L(A)=U[(I_p?A)\oplus (I_q?A^t)\oplus 0_{m?r}]U^{?},\text{for any}n\times n\text{Hermitian}A\text{with rational trace}.$ We also extend this result to the (complex) von Neumann algebra setting, and provide a supplement to the Dye-Bunce-Wright Theorem asserting that every additive map of Hermitian idempotents extends to a Jordan ?-homomorphism.     

Classification problems for shifts on modules over a principal ideal domain

In this paper we study symbolic dynamics over alphabets which are modules over a principal ideal domain, considering topological shifts which are also submodules. Our main result is the classification, up to algebraic and topological conjugacy, of the torsion-free, transitive, finite memory shifts.

     

FINITE GROUPS WHOSE AUTOMORPHISM GROUP HAS ORDER CUBEFREE

ＦＩＮＩＴＥＧＲＯＵＰＳＷＨＯＳＥＡＵＴＯＭＯＲＰＨＩＳＭＧＲＯＵＰＨＡＳＯＲＤＥＲＣＵＢＥＦＲＥＥＬＩＳＨＩＲＯＮＧＡｂｓｔｒａｃｔＬｅｔＧｄｅｎｏｔｅａｆｉｎｉｔｅｇｒｏｕｐ．Ｉｔｉｓｓｈｏｗｎｔｈａｔｉｆ｜Ａｕｔ（Ｇ）｜ｉｓｃｕｂｅｆｒｅ...     

一类非线性Schr(o)dinger方程的守恒差分法与Fourier谱方法

考察了一类带导数项的非线性Schrodinger方程的周期边值问题，提出了一种守恒的差分格式，在空间方向上采用Fourier谱方法，证明了格式的稳定性和收敛性．数值试验得到了与理论分析一致的结果．     

Sparse polynomials, redundant bases, gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields

Gauss periods give an exponentiation algorithm that is fast for many finite fields but slow for many other fields. The current paper presents a different method for construction of elements that yield a fast exponentiation algorithm for finite fields where the Gauss period method is slow or does not work. The basic idea is to use elements of low multiplicative order and search for primitive elements that are binomial or trinomial of these elements. Computational experiments indicate that such primitive elements exist, and it is shown that they can be exponentiated fast.