三角矩阵代数的自同构

本文研究了三角代数的自同构.利用三角代数的基本概念及自同构定义,得到三角代数的自同构形式,并刻画了其内自同构的具体形式.     

自由正交模格FMOk(n)的自同构群

文章先利用自同构映射保有限并的性质研究了一般正交模格的次直积的自同构群与自同构群的次直积的关系,再用块置换的方法研究了MOk的自同构群的生成元集,由此得到自由正交模格FMOk(n)的自同构群的直积分解式,从而完全解决了FMOk(n)的自同构群的结构问题.     

一类圈积的自同构群的矩阵描述

使用Bidwell和Curran在2006年引入的描述半直积的自同构的矩阵方法,结合作者等人在2010年证明的关于稳定自同构群的矩阵公式,得到了一类正则圈积的自同构群的矩阵描述,并求出了自同构群的阶.     

Heisenberg李(超)代数的自同构群

本文研究了Heisenberg李(超)代数的自同构群.利用Heisenberg李(超)代数与线性李(超)代数之间的同构,获得了Heisenberg李(超)代数的自同构群的子群,包括内自同构群、中心自同构群、对合自同构群.     

一类有界对称域上的Hartogs型域的自同构群

本文研究了稍微广泛的一类Hartogs型域的自同构群.利用华域的自同构群,获得了一类有界对称域上的Hartogs型域的自同构群的具体形式,推广了有界对称域上的Hartogs型域的自同构群这一结果.     

p~3阶群的自同构群的构造和性质

本文解决 p~3阶群的自同构群的构造问题,并证明 p~3阶群的自同构群存在 p 阶外自同构元.     

拟极小外p-自同构不动点子群为p阶的p-群

阶为某素数p的方幂的自同构如果不是内自同构,则称其为外p-自同构.如果φ是群G的外p-自同构且o(φ)=p,其中φ是φ在Out(G)=Aut(G)/Inn(G)中的自然同态像,则称φ为群G的拟极小外p-自同构.设φ是有限p-群G的任意拟极小外p-自同构,给出了|C_G(φ)|≤p时G的结构.     

Laurent多项式代数C[x_1~(±1),x_2~(±1)]上的李三系

设A为交换变元x_1,x_2的罗朗多项式代数,记A的导子代数Der A为M.本文确定了A,M的对合自同构.利用M的对合自同构给出了一类无限维单李三系,并且通过讨论M的自同构与对合自同构的关系,确定这些单李三系的自同构.     

本原群的p-中心自同构及其应用

设$G$是一个本原群,证明了存在某个素数$p$使得$G$的每个$p$-中心自同构是内自同构. 作为应用,证明了$G$的全形的每个Coleman自同构均为内自同构. 特别地,正规化子性质对对所讨论的这些群都成立. 另外也得到了其他一些相关结果.     

一类中心循环的有限p-群的自同构群的研究

本文研究了一类中心循环的有限p-群G的自同构群.利用在G的导群上作用平凡的自同构以及环上的辛群和正交群,确定了G的自同构群的结构,这推广了Bornand的相应结果.     

Unimodality of independence polynomials of the incidence product of graphs

Given two graphs $G$ and $H$, assume that $V\left(G\right)=\{v_1,v_2,\dots ,v_n\}$ and $U$ is a subset of $V\left(H\right)$. We introduce a new graph operation called the incidence product, denoted by $G\odot H^U$, as follows: insert a new vertex into each edge of $G$, then join with edges those pairs of new vertices on adjacent edges of $G$. Finally, for every vertex $v_i\in V\left(G\right)$, replace it by a copy of the graph $H$ and join every new vertex being adjacent to $v_i$ to every vertex of $U$. It generalizes the line graph operation. We prove that the independence polynomial

$I\left(G\odot H^U;x\right)=I^n(H;x)M\left(G;\frac{x{I}^2(H?U;x)}{I^2(H;x)}\right),$

where $M(G;x)$ is its matching polynomial. Based on this formula, we show that the incidence product of some graphs preserves symmetry, unimodality, reality of zeros of independence polynomials. As applications, we obtain some graphs so-formed having symmetric and unimodal independence polynomials. In particular, the graph $Q\left(G\right)$ introduced by Cvetkovi?, Doob and Sachs has a symmetric and unimodal independence polynomial.     

有资格限制的指派问题的求解方法

在实际的指派工作中，常会遇到某个人有没有资格去承担某项工作的问题，因此，本建立了有资格限制的指派问题的数学模型。在此数学模型中，将效益矩阵转化为判定矩阵，由此给出了判定此种指派问题是否有解的方法；在有解的情况下，进一步将效益矩阵转化为求解矩阵，从而将有资格限制的指派问题化为传统的指派问题来求解。最后给出了一个数值例子来说明这样的处理方法是有效的。     

Partial cohomology of groups and extensions of semilattices of abelian groups

We extend the notion of a partial cohomology group $H^n(G,A)$ to the case of non-unital A and find interpretations of $H^1(G,A)$ and $H^2(G,A)$ in the theory of extensions of semilattices of abelian groups by groups.     

Spectra and Laplacian spectra of arbitrary powers of lexicographic products of graphs

Consider two graphs $G$ and $H$. Let $H^k\left[G\right]$ be the lexicographic product of $H^k$ and $G$, where $H^k$ is the lexicographic product of the graph $H$ by itself $k$ times. In this paper, we determine the spectrum of $H^k\left[G\right]$ and $H^k$ when $G$ and $H$ are regular and the Laplacian spectrum of $H^k\left[G\right]$ and $H^k$ for $G$ and $H$ arbitrary. Particular emphasis is given to the least eigenvalue of the adjacency matrix in the case of lexicographic powers of regular graphs, and to the algebraic connectivity and the largest Laplacian eigenvalues in the case of lexicographic powers of arbitrary graphs. This approach allows the determination of the spectrum (in case of regular graphs) and Laplacian spectrum (for arbitrary graphs) of huge graphs. As an example, the spectrum of the lexicographic power of the Petersen graph with the googol number (that is, 10¹⁰⁰ ) of vertices is determined. The paper finishes with the extension of some well known spectral and combinatorial invariant properties of graphs to its lexicographic powers.     

22号初等元胞自动机的极限语言复杂性

§1Introduction Thetaskofthispaperistosolvetheproblemproposedin[1],i.e.,toexplorethe complexityoflimitset,orequivalently,limitlanguageoftheelementarycellularautomaton ofrule22bythetoolsofformallanguagetheory.Cellularautomata(abbreviatedasCA),asmathematicalmodelsforcomplexnatural systemscontaininglargenumbersofsimpleidenticalcomponentswithlocalinteractions,havebeenwidelyusedinphysical,biological,chemicalandcomputationalsystems[2].Despitetheirsimpleconstruction,someCAcandisplayveryrichandcompl…     

On estimating of the number of constituents of a finite mixture of continuous distributions

Summary Suppose thatH is a mixture of distributions for a given familyF A necessary and sufficient condition is obtained under whichH is, in fact, a finite mixture. An estimator of the number of distributions constituting the mixture is proposed assuming that the mixture is finite and its asymptotic properties are investigated.