𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithm of decomposition in finite symmetric semigroups

✍ Scribed by V. G. Bondarev

Publisher
Springer US
Year
1973
Tongue
English
Weight
345 KB
Volume
6
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Endomorphisms of Finite Symmetric Invers
Endomorphisms of Finite Symmetric Inverse Semigroups
✍ Boris M. Schein; Beimnet Teclezghi πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 256 KB

We describe the endomorphisms of the inverse semigroup of all one-to-one partial transformations of a finite set and count the number of the endomorphisms.

Algorithmic Problems for Amalgams of Fin
Algorithmic Problems for Amalgams of Finite Semigroups
✍ Mark V. Sapir πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 118 KB

We prove that there exists an amalgam of two finite 4-nilpotent semigroups such that the corresponding amalgamated product has an undecidable word problem. We also show that the problem of embeddability of finite semigroup amalgams in any semigroups and the problem of embeddability of finite semigro

Reciprocity in character theory of finit
Reciprocity in character theory of finite semigroups
✍ Mohan S. Putcha πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 117 KB

This paper concerns the complex characters of ΓΏnite semigroups. We begin by reducing the general problem to the study of local monoids M = G βˆͺ J βˆͺ {0}, where G is the unit group and J is a regular J-class. Let H be a maximal subgroup of J . For a CH -module U with character Γ‚, let Ε¨ be the associate