Combinatorial semigroup theory and its applications

点击翻译按钮获取中文摘要

(1) There is no solution of the problem whether or not there exists an algorithm to decide if a finite semigroup is an amalgamation base for all semigroups. On the other hand, it is known that a semigroup which is an amalgamation base for all semigroups always has the representation extension property. In this project, we prove that there exists an algorithm to decide if a finite semigroup has the representation extension property. Also, it is known that a completely 0-simplesemigroup with the representation extension property is an amalgamation base for all semigroups. However, we can construct by the software "Mathematic" an example of a finite regular semigroup with the representation extension property and without being an amalgamation base for all semigroups. Moreover, we prove that there exists an algorithm to decide if a finite semigroup is left absolutely flat. The result will appear in a forthcoming paper. (2) We prove that a finite semigroup which is an amalgamation for all finite semigroups has the representation extension property. As a consequence, we decide the structure of finite bands which is an amalgamation for all finite semigroups. (3) We give another proof of Okininski and Putcha's theorem on finite inverse semigroup, which is a natural extension of B.Neumann's result on group. (4) We show that the construction of λ μ-models can be given by the use of a fixed point operator and the Godel-Gentzen translation. (5) We study the fibrewise homotopy, fibrewise fibration and fibrewise cofibration. (6) Let p be an odd prime number. By using Iwasawa theory we construct cyclotopic fields whose maximal real subfields have class group with arbitrarily large p-rank and a conductor with only four prime factors.