基于格半群的有限状态自动机的同态

本文研究了格值有限状态自动机(LFSA)的同态和强同态及其性质.利用强同态概念,在格值有限状态自动机的状态集上建立了一种等价关系,得到了格值有限状态自动机的商自动机,证明了商自动机与强同态像自动机同构.     

图模式挖掘中的子图同构算法

图模式挖掘问题在Web挖掘、生物信息学、社会关系等众多领域有广泛的应用,它涉及到子图的搜索以及子图的同构问题.这两个问题都具有相当高的计算复杂度,现有的子图同构问题大多采用最小编码算法,但对无标签图特别是对无标签无向图,该算法效率较底,从而子图的同构成为图模式挖掘问题的一个瓶颈.针对无标签图,以代数理论为基础,分别利用度序列和特征值构造了两种子图同构算法,用于对有向图和无向图的同构判别.最后对2个真实生物网络进行了仿真实验,结果表明,算法的效率优于现有算法.     

求m阶递推数列通项公式的两种方法

利用分析中的解析函数方法和代数中的矩阵方法,得到了m阶常系数齐次线性递推数列通项公式的解析表达式,是对已有结果的完善和推广.     

Some commutativity criteria for prime rings with differential identities on Jordan ideals

In this article, we present some commutativity theorems for a ring R equipped with a generalized derivation satisfying certain differential identities on Jordan ideals of R. Some related results for prime rings are also discussed. Finally; we provide examples to show that the assumed restrictions are not superfluous.     

MEXIT: Maximal un-coupling times for stochastic processes

Classical coupling constructions arrange for copies of the same Markov process started at two different initial states to become equal as soon as possible. In this paper, we consider an alternative coupling framework in which one seeks to arrange for two different Markov (or other stochastic) processes to remain equal for as long as possible, when started in the same state. We refer to this “un-coupling” or “maximal agreement” construction as MEXIT, standing for “maximal exit”. After highlighting the importance of un-coupling arguments in a few key statistical and probabilistic settings, we develop an explicit MEXIT construction for stochastic processes in discrete time with countable state-space. This construction is generalized to random processes on general state-space running in continuous time, and then exemplified by discussion of MEXIT for Brownian motions with two different constant drifts.     

Convex topological algebras via linear vector fields and Cuntz algebras

A realization by linear vector fields is constructed for any Lie algebra which admits a biorthogonal system and for its any suitable representation. The embedding into Lie algebras of linear vector fields is in analogue to the classical Jordan—Schwinger map. A number of examples of such Lie algebras of linear vector fields is computed. In particular, we obtain examples of the twisted Heisenberg-Virasoro Lie algebra and the Schrödinger-Virasoro Lie algebras among others. More generally, we construct an embedding of an arbitrary locally convex topological algebra into the Cuntz algebra.     

Jordan-Algebraic Aspects of Nonconvex Optimization over Symmetric Cones

We illustrate the usefulness of Jordan-algebraic techniques for nonconvex optimization by considering a potential-reduction algorithm for a nonconvex quadratic function over the domain obtained as the intersection of a symmetric cone with an affine subspace.     

Isomorphisms of adjoint Chevalley groups over integral domains

It is shown that every automorphism of an adjoint Chevalley group over an integral domain containing the rational number field is uniquely expressible as the product of a ring automorphism, a graph automorphism and an inner automorphism while every isomorphism between simple adjoint Chevalley groups can be expressed uniquely as the product of a ring isomorphism, a graph isomorphism and an inner automorphism. The isomorphisms between the elementary subgroups are also found having analogous expressions.

     

Function of a square matrix with repeated eigenvalues

An analytical function f(A) of an arbitrary n×n constant matrix A is determined and expressed by the “fundamental formula”, the linear combination of constituent matrices. The constituent matrices Z_kh, which depend on A but not on the function f(s), are computed from the given matrix A, that may have repeated eigenvalues. The associated companion matrix C and Jordan matrix J are then expressed when all the eigenvalues with multiplicities are known. Several other related matrices, such as Vandermonde matrix V, modal matrix W, Krylov matrix K and their inverses, are also derived and depicted as in a 2-D or 3-D mapping diagram. The constituent matrices Z_kh of A are thus obtained by these matrices through similarity matrix transformations. Alternatively, efficient and direct approaches for Z_kh can be found by the linear combination of matrices, that may be further simplified by writing them in “super column matrix” forms. Finally, a typical example is provided to show the merit of several approaches for the constituent matrices of a given matrix A.     

Complexity of some natural problems in automatic structures

We prove that the automatic isomorphism problem for automatic structures, the automatic automorphism problem for an automatic structure, and the automatic embedding problem for automatic structures are $ \overset{\lower0.5em\hbox{$ \overset{\lower0.5em\hbox{ Matematicheski $ \overset{\lower0.5em\hbox{$ \overset{\lower0.5em\hbox{ Zhurnal, Vol. 46, No. 1, pp. 71–78, January–February, 2005.