极大代数上线性系统的3维最小实现

研究了极大代数上线性系统的单输入单输出的最小实现问题.根据无穷序列{gi}∞0的特征方程将3-阶周期序列{gi}∞0分为4类,分别讨论了序列{gi}∞0存在3维最小实现的充要条件.     

一类极大代数上线性系统的3维最小实现

讨论了极大代数上线性系统的3维最小实现问题.给出了特征方程为λ~3⊕c_0λ~0=c_2λ~2⊕c_1λ的一类无穷序列{gi}_0~∞存在3维最小实现的充要条件,彻底解决了存在3维最小实现的充要条件问题.     

极大代数上多输入多输出线性系统的最小实现

研究了极大代数上无穷阵序列{Gi}0∞的实现问题.首先给出了周期阵序列的概念,得到了1-阶和2-阶周期阵序列{Gi}0∞元素之间的关系,并得到多输入多输出情况下线性系统存在1维和2维最小实现的充要条件.     

极大代数上有限生成模的几何形态

本文研究了极大代数上有限生成模的几何形态，并得到了一般规律．     

极大加代数的对称代数S上互补基本矩阵

主要研究了极大加代数的对称代数S上互补基本矩阵,给出本征积的概念,证明了S上的Laplace定理,由此推出所有互补基本矩阵的行列式相等,且任意两个互补基本矩阵的行列式中的非零项均一一对应相等.在一个互补基本矩阵的行列式中,对于确定非零项的任一置换,给出了在另一个互补基本矩阵的行列式中找到置换使其确定相同非零项的方法.     

极大三角代数的交换子和上同调

设M为闭极大三角代数S的σ-弱闭双边模且满足M(∩)S,证明了模M交换子C(A,M)=M.进而,如果M(∩)AlgLat S,得到Hn(S,AlgLat S)=Hn(S,M)(n≥1);若dim H(⊥-)≤1,则Hn(S,M)=0.     

极大三角代数的交换子和上同调

设M为闭极大三角代数S的σ-弱闭双边模且满足MS,证明了模M交换子C(A,M)= M．进而,如果MAlgLat S,得到H~n(S,AlgLat S)=H~n(S,M)(n≥1)；若dimH〧≤1,则H~n(S,M)=0．     

强可约极大三角代数的检测问题

对强可约极大三角代数的酉等价和代数同构回答了检测问题     

交换环上特殊线性李代数的极大子代数

文章利用有单位元且2,3是单位的交换环的极大理想刻画了其上特殊线性李代数包含典范环面的极大子代数.确定了特殊线性李代数极大子代数的个数,并证明了每个极大子代数均可通过置换矩阵共轭于标准的极大子代数.     

（n-3）-Filiform李代数的极大环面

求出了（n-3）-filiform李代数的极大环面，并证明了（n-3）-filiform李代数是可完备化的．     

The Realization of 4-dimensional 3-Lie Algebras

In this paper, we mainly investigate the realization of 3-Lie algebras from a family of Lie algebras. We prove the realization theorem, offer a concrete example realizing all type of 4-dimensional 3-Lie algebras, and also give some properties about semi-simple n-Lie algebras.     

4维3-Lie代数的实现

In this paper, we mainly investigate the realization of 3-Lie algebras from a family of Lie algebras. We prove the realization theorem, offer a concrete example realizing all type of 4-dimensional 3-Lie algebras, and also give some properties about semi-simple n-Lie algebras.     

On an Alternative Parameterization of the Solutions of the Partial Realization Problem

The solutions of the partial realization problem have to satisfy a finite number of interpolation conditions at . The minimal degree of an interpolating deterministic system is called the algebraic degree or McMillan degree of the partial covariance sequence and is easy to compute. The solutions of the partial stochastic realization problem have to satisfy the same interpolation conditions and have to fulfill a positive realness constraint. The minimal degree of a stochastic realization is called the positive degree. In the literature, solutions of the partial realization problem are parameterized by the Kimura–Georgiou parameterization. Solutions of the partial stochastic realization problem are then obtained by checking the positive realness constraint for the interpolating solutions of the corresponding partial realization problem. In this paper, an alternative parameterization is developed for the solutions of the partial realization problems. Both the solutions of the partial and partial stochastic realization problem are analyzed in this parameterization, while the main concerns are the minimality and the uniqueness of the solutions. Based on the structure of the parameterization, a lower bound for the positive degree is derived.     

极小非PNN-群

有限群G称作PNN-群,如果G的每一个极小子群X要么正规于G,要么是自正规化的.本文将讨论PNN-群的性质,并给出极小非PNN-群,也就是本身不是PNN-群,每个真子群都是PNN-群的有限群的完全分类.     

具有2n线性复杂度的2n周期二元序列的3错线性复杂度

线性复杂度和k错线性复杂度是度量密钥流序列的密码强度的重要指标.通过研究周期为2n的二元序列线性复杂度,提出将k错线性复杂度的计算转化为求Hamming重量最小的错误序列.基于Games-Chan算法,讨论了线性复杂度为2n的2n周期二元序列的3错线性复杂度分布情况;给出了对应k错线性复杂度序列的完整计数公式, k=3,4.对于一般的线性复杂度为2n-m的2n周期二元序列,也可以使用该方法给出对应k错线性复杂度序列的计数公式.     

On Minimal Realization Over a Finite Chain Ring

Let R be a finite chain ring, e.g. a Galois ring. We give a compact recursive formula for a minimal realization of a finite R-sequence. In particular, we show how to obtain a monic minimal polynomial and a rational approximation of a finite R-sequence. We also show how to solve the classical key equation of Algebraic Coding Theory over R.     

无最小正周期的周期函数的构造及其性质

从群论的角度给出周期函数的等价定义.对任意给定的非循环群GR),构造出以G为周期集的无最小正周期的周期函数.讨论无最小正周期的周期函数的性质.