概率有限自动机的代数性质

研究了概率有限自动机的同态(弱同态)、有效划分等代数性质.首先,提出了完全的、不可约的概率有限自动机,概率有限自动机的并积等概念.然后,讨论了两个概率有限自动机的级联积、圈积、并积的有效划分与其因子的有效划分之间的关系,证明了在一定条件下两个概率有限自动机的级联积(并积)的商概率有限自动机与其因子的商概率有限自动机的级联积(并积)是相等的.最后,得到了概率有限自动机的极大有效划分的一个刻画.     

幺半环上模糊有限状态自动机积的覆盖关系

提出了幺半环上模糊有限状态自动机的各种乘积以及覆盖的定义,并得到了一些性质.证明了直积、级联积、圈积三种乘积以及和之间的覆盖关系,得到了乘积自动机、和自动机覆盖关系的一些代数性质.     

模糊有限自动机的乘积覆盖性

推广模糊有限自动机的有限积,包括direct infinite乘积、cascade infinite乘积和wreath infinite 来积.进而讨论它们之间的关系,得到乘积覆盖性等代数性质.     

模糊自动机的强连通性及群自动机

为了更好地研究模糊自动机的结构和性质,采用代数的方法,在传统的模糊有限状态自动机的基础上,通过定义状态集合为代数群的自动机,讨论了这一类自动机的连通性和正则性,这丰富了模糊自动机理论．     

直觉模糊有限自动机的乘积

给出了直觉模糊有限自动机的广义直积、级联积和圈积及覆盖的定义,讨论了直觉模糊有限自动机在同构意义下级联积和圈积满足结合性以及各种乘积之间的覆盖关系。     

格值Mealy自动机的同余和同态

提出格值Mealy自动机的概念,从代数角度出发详细研究此类自动机的性质,同时研究此类自动机的同余和同态,揭示此类自动机的代数性质和取值格半群的紧密联系,最终研究格值Mealy自动机的极小化,给出可在有限步实现极小化的算法.     

基于模糊乘积有限自动机的覆盖关系

对Mealy-型模糊有限自动机乘积结构作了进一步的研究,并且对覆盖关系作了细致的刻画,推广了原有的覆盖概念.针对Mealy-型这类模糊有限自动机,通过性质考察了此覆盖概念的合理有效性,新的覆盖概念在乘积自动机间建立了更多的联系.特别证明了直积、级联积、圈积三种乘积之间的覆盖关系.得到了一些乘积自动机覆盖关系的传递性质.     

模糊有限自动机的kronecker积

在矩阵理论框架下,引入了模糊有限自动机转移矩阵,变换矩阵半群以及覆盖概念.定义了模糊有限自动机Kronecker积,讨论了其转移矩阵性质及变换矩阵半群间的覆盖关系.     

加权有限自动机及其商变换半群

加权有限自动机是处理不确定环境下的计算的一种通用数学模型.文章对加权有限自动机及其乘积的结构作了进一步的研究.引入了加权变换半群和商变换半群的概念,并依据半环自身的结构,给出了加权有限自动机诱导的商变换半群有限的条件.讨论了加权有限自动机在各种乘积情形下的状态转移函数的性质,并建立了加权有限自动机的乘积(级联积)与其对应的商变换半群之间的关系,为进一步研究加权有限自动机的结构奠定了基础.     

模糊有限状态机的积的代数性质

文章利用代数的方法讨论了模糊有限状态机的全直积、级联积、圈积、模糊有限状态机的和的代数性质。证明了模糊有限状态机的和与其因子在子系统(强子系统)、交换性、连通性、可恢复性等方面的相似的结构性质;给出了模糊有限状态机的全直积、级联积、圈积与其因子之间的关系;获得了模糊有限状态机的各种积的容许划分与其因子的容许划分之间的关系、以及模糊有限状态机的积的商与模糊有限状态机的商的积之间的联系。     

The Automata that Define Representations of Monomial Algebras

It is well known that the sets of strings that define all representations of string algebras and many representations of other quotients of path algebras form a regular set, and hence are defined by finite state automata. This short article aims to explain this connection between representation theory and automata theory in elementary terms; no technical background in either representation theory or automata theory is assumed. The article describes the structure of the set of strings of a monomial algebra as a locally testable and hence regular set, and describes explicitly the construction of the automaton, illustrating the construction with an elementary example. Hence it explains how the sets of strings and bands of a monomial algebra correspond to the sets of paths and closed (non-powered) circuits in a finite graph, and how the growth rate of the set of bands is immediately visible from that graph. Presented by C. Ringel.     

Realizing ultragraph Leavitt path algebras as Steinberg algebras

In this article, we realize the finite range ultragraph Leavitt path algebras as Steinberg algebras. This realization allows us to use the groupoid approach to obtain structural results about these algebras. Using the skew product of groupoids, we show that ultragraph Leavitt path algebras are graded von Neumann regular rings. We characterize strongly graded ultragraph Leavitt path algebras and show that every ultragraph Leavitt path algebra is semiprimitive. Moreover, we characterize irreducible representations of ultragraph Leavitt path algebras. We also show that ultragraph Leavitt path algebras can be realized as Cuntz-Pimsner rings.     

并素元有限生成格的弱直积分解

本文建立了并素元有限生成格的弱直积分解,并给出一个解决并素元生成的完全Heyting代数的直积分解问题的新方法;作为弱直积分解的应用,证明了并素元有限生成的完全Heyting代数必然同构于有限个既约的完全Heyting代数的直积,证明了并素元有限生成格是Boole代数的充要条件是它同构于某有限集的幂集格.     

Derivations of Tensor Product Algebras

It is known that under certain finite dimensionality condition the derivation algebra of tensor product of two algebras can be obtained in terms of the derivation algebras and the centroids of the involved algebras. We extend this theorem to infinite dimensional case and as an application, we determine the derivation algebra of the fixed point algebra of the tensor product of two algebras, with respect to the tensor product of two finite order automorphisms. These provide the framework for calculating the derivations of some infinite dimensional Lie algebras.     

可积代数正规类中半素代数类及半素一致代数类确定的上根

利用代数正规类中的理想乘积公理，引入可积代数正规类及可积代数正规类中素代数、半素代数类及一致代数类概念，讨论了可积代数正规类中半素代数类及半素一致代数类确定的上根性质。     

弱Hopf代数上的ω-交叉积

在弱Hopf代数上,定义了ω-交叉积概念,并给出了ω-交叉积是弱Hopf代数的充要条件,推广了弱Hopf代数的相应结论.     

On the Hochschild cohomology ring of tensor products of algebras

We prove that, as Gerstenhaber algebras, the Hochschild cohomology ring of the tensor product of two algebras is isomorphic to the tensor product of the respective Hochschild cohomology rings of these two algebras, when at least one of them is finite dimensional. In case of finite dimensional symmetric algebras, this isomorphism is an isomorphism of Batalin–Vilkovisky algebras. As an application, we explain by examples how to compute the Batalin–Vilkovisky structure, in particular, the Gerstenhaber Lie bracket, over the Hochschild cohomology ring of the group algebra of a finite abelian group.     

The graded structure of Leavitt path algebras

A Leavitt path algebra associates to a directed graph a ?-graded algebra and in its simplest form it recovers the Leavitt algebra L(1, k). In this note, we first study this ?-grading and characterize the (?-graded) structure of Leavitt path algebras, associated to finite acyclic graphs, C _n -comet, multi-headed graphs and a mixture of these graphs (i.e., polycephaly graphs). The last two types are examples of graphs whose Leavitt path algebras are strongly graded. We give a criterion when a Leavitt path algebra is strongly graded and in particular characterize unital Leavitt path algebras which are strongly graded completely, along the way obtaining classes of algebras which are group rings or crossed-products. In an attempt to generalize the grading, we introduce weighted Leavitt path algebras associated to directed weighted graphs which have natural ⊕?-grading and in their simplest form recover the Leavitt algebras L(n, k). We then show that the basic properties of Leavitt path algebras can be naturally carried over to weighted Leavitt path algebras.     

The structure of Leavitt path algebras and the Invariant Basis Number property

In this paper, we provide the structure of the Leavitt path algebra of a finite graph via some step-by-step process of source eliminations, and restate Kanuni and Özaydin's nice criterion for Leavitt path algebras of finite graphs having Invariant Basis Number via matrix-theoretic language. Consequently, we give a matrix-theoretic criterion for the Leavitt path algebra of a finite graph having Invariant Basis Number in terms of a sequence of source eliminations. Using these results, we show certain classes of finite graphs for which Leavitt path algebras have Invariant Basis Number, as well as investigate the Invariant Basis Number property of Leavitt path algebras of certain Cayley graphs of finite groups.     

Bases of Leavitt path algebras with only strongly regular elements

Recent articles consider invertible and locally invertible algebras (respectively, those having a basis consisting solely of invertible or solely of strongly regular elements). Previous contributions to the subject include the study of when Leavitt path algebras are invertible. This article investigates the local invertibility property in Leavitt path algebras. A complete classification of strongly regular monomials in Leavitt path algebras is given. Additionally, it is show that all directly finite and (von Neumann) regular Leavitt path algebras are locally invertible. It is also shown that a Leavitt path algebra has a basis consisting solely of strongly regular monomials if and only if it is commutative.