半群代数

词组短语

semigroup algebra

与半群代数相关的网络例句 [注：此内容来源于网络，仅供参考]

Suppose G is a finite group, then QG is a semisimple Q-algera, obviously ZG is a Z-order of QG,we denote the maximal Z-order by ?.If G is not abelian, it is not an easy thing to determine г; if G is an abelian group, then QG is isomorphic to the direct sum of a finite number of number fields, and r is the direct sum of these rings of algebraic integers of those number fields, but which elements of QG belong to r is not clear.

设G是一个有限群，那么QG是一个半单代数，ZG是QG的一个Z-序，设Γ是QG的一个极大Z-序，当G是一个非交换群时，Γ的求解是困难的问题；当G是一个交换群时，QG同构于有限多个数域的直和，Γ相应的就是各数域代数整数环的直和，但Γ具体是QG中那些元素不清楚。

Now that the L-valued fuzzy state automata has such powerful computation capacity, it is necessary to traverse the algebraic properties such as transformation semigroups,products and covering relations in L-valued fuzzy automata in order to show the close correspondence between the algebraic properties and the latticeordered monoid.

既然格值自动机具有如此强大的计算能力，有必要对其从代数角度出发较详细地，较深入地研究此类自动机的变换半群，乘积和覆盖关系，揭示此类自动机的代数性质和格半群间的紧密联系。

The course contains four sections as follows: mathematical logic (including basic concepts of propositional logic and predicate logic, propositional calculuses and inference theories), set theory (including set algebras, relations, functions and cardinal numbers), algebraic structure (including algebraic systems, semigroups and groups, rings and fields, lattices and Boolean algebras), graph theory (including basic concepts of graph, Euler graphs and Hamiltonian graphs, trees, planar graphs and coloring graphs, some special vertex subsets and edge subsets).

本课程包含四部分内容：数理逻辑（包含命题逻辑与一阶逻辑的基本概念、等值演算以及推理理论），集合论（包含集合代数、二元关系、函数和基数），代数结构（包含代数系统、半群与群、环与域、格与布尔代数），图论（包含图的基本概念、欧拉图与哈密顿图、树、平面图及图的着色、图的某些特殊的顶点子集与边子集）。

Explicitly, they are consist of three classes: If H is semisimple, then H k* for some finite group; If H is not semisimple and the characteristic of k is zero, then H is isomorphic the dual of the cross product between one so called Andruskiewitsch-Schneider algebra and a group algebra; If H is not semisimple and the characteristic of k is not zero, then H is isomorphic the dual of the cross product between one special algebra and a group algebra.

具体地讲，它们共分三类：①如果H是半单的，则H同构与一个群代数的对偶；②如果H是非半单的并且基础域的特征是0的话，则H同构一个所谓Andruskiewitsch-Schneider代数与一个群代数交差积的对偶；③如果H是非半单的并且基础域的特征不是0的话，则H同构于某个特定代数与一个群代数交差积的对偶。

Eigenvalue matrix for resolving sparse polynomial equations is constructed by deploying well arranged basis in semigroup algebra k.

本文利用半群代数k中良序基，构造了求稀疏多项式方程组解的特征值矩阵，并给出了可以构造方阵的条件。

The semigroup algebra theory,which has a huge development under interior and exterior double Mathematical conditions form 1950"s to 1960"s,is a new branch of algebra theory.In 1990,R.Biswas gave definition of anti-fuzzy subgroup.In 1995,Shen gave definitions of anti-fuzzy subgroup and normal anti-fiizzy subgroup of group.

半群的代数理论是在数学内部和外部双重条件下，从20世纪50年代到60年代发展起来的一个崭新的代数分支。1990年，Biswas R提出了反Fuzzy子群的定义；1995年沈正维提出了一个群的反Fuzzy子群和正规反Fuzzy子群的定义。

In the study of semigroup, the regular semigroups research occupies the dominant position.

在半群的研究中，正则半群一直占半群代数理论研究的主导地位。

The derived group series of p - semisimple BCI - algebras and the derived semigroup series of generalized a - associative BCI - algebras are given.

并给出了p-半单BCI-代数的一个导群列和广义a-结合BCI-代数的导半群列。

Explicitly, they are consist of three classes: If H is semisimple, then H k* for some finite group; If H is not semisimple and the characteristic of k is zero, then H is isomorphic the dual of the cross product between one so called Andruskiewitsch-Schneider algebra and a group algebra; If H is not semisimple and the characteristic of k is not zero, then H is isomorphic the dual of the cross product between one special algebra and a group algebra.

具体地讲，它们共(来源：5fbfA02BC论文网www.abclunwen.com)分三类：①如果H是半单的，则H同构与一个群代数的对偶；②如果H是非半单的并且基础域的特征是0的话，则H同构一个所谓Andruskiewitsch-Schneider代数与一个群代数交差积的对偶；③如果H是非半单的并且基础域的特征不是0的话，则H同构于某个特定代数与一个群代数交差积的对偶。

Secondly, in a more generalized framestructrue--lattice-ordered monoids,the notion of lattice-valued Mealy-type automata is introduced,we traverse some algebraic properties of this automata and investigate the congruences and homomorphisms of this type automata.Our main results indicate that the algebraic properties of lattice-valued Mealy-type automata have Close links to the algebraic properties of lattice-ordered monoids which automata take values in.Futhermore we study the minimization of lattice-valued Mealy-type automata and provide an algorithm to achieve the minimal lattice-valued Mealy-type automata within finite steps.

其次，在更一般的框架—格半群意义下，提出具有输入和输出字符的自动机——格值Mealy自动机的概念，从代数角度出发较详细地研究了此类自动机具有的性质，同时研究了此类自动机的同余和同态，揭示了此类自动机的代数性质和格半群的紧密联系，最终研究了格值Mealy自动机的极小化问题，并给出了在有限步可实现此极小化的算法。

与半群代数相关的网络解释 [注：此内容来源于网络，仅供参考]

absolutely semisimple algebra：绝对半单代数

absolutely prime ideal 绝对素理想 | absolutely semisimple algebra 绝对半单代数 | absolutely simple group 绝对单群

absolutely simple group：绝对单群

absolutely semisimple algebra 绝对半单代数 | absolutely simple group 绝对单群 | absolutely summable sequence 绝对可和序列

semisimple direct sum：半单纯直和

半单纯代数 semisimple algebras | 半单纯直和 semisimple direct sum | 半单纯群 semisimple group

semigroup algebra：半群代数

semigroup 半群 | semigroup algebra 半群代数 | semigroup of operators 算子半群

semigroup of operators：算子半群

semigroup algebra 半群代数 | semigroup of operators 算子半群 | semihereditary ring 半遗传环

semigroup：半群

到此为止,我们的分析就要结束了,我的叶子(leaf)是一个代数结构,说得再具体些是一个半群(semigroup),但不是一个群. 最后想告诉大家的是,大家可以定义自己的代数结构,然后来看一下,自己所定义的代数结构是一个群(group)呢,

semisimple algebra：半单代数

semiscalar product 半纯量积 | semisimple algebra 半单代数 | semisimple group 半单群

semisimple group：半单群

semisimple algebra 半单代数 | semisimple group 半单群 | semisimple module 半单模

Wedderburn：确定半单代数

1904:Schur建立无限群表示 | 1905:Wedderburn确定半单代数 | 1911:Steinitz奠基域论