Mathematical modeling of nilpotent subsemigroups of semigroups of contracting transformations of a Boolean
- 24 Downloads
We study mathematical models of the structure of nilpotent subsemigroups of the semigroup PTD(B n ) of partial contracting transformations of a Boolean, the semigroup TD(B n ) of full contracting transformations of a Boolean, and the inverse semigroup ISD(B n ) of contracting transformations of a Boolean. We propose a convenient graphical representation of the semigroups considered. For each of these semigroups, the uniqueness of its maximal nilpotent subsemigroup is proved. For PTD(B n ) and TD(B n ) , the capacity of a maximal nilpotent subsemigroup is calculated. For ISD(B n ), we construct estimates for the capacity of a maximal nilpotent subsemigroup and calculate this capacity for small n. For all indicated semigroups, we describe the structure of nilelements and maximal nilpotent subsemigroups of nilpotency degree k and determine the number of elements and subsemigroups for some special cases.
KeywordsLinear Order Zero Level Zero Element Finite Semigroup Green Relation
- 2.N. V. Selezneva, “Relationship between the nilpotency in B N and acyclic graphs,” in: Proceedings of the 12 th International Scientific Conference devoted to Academician M. Kravchuk (May 15–17, 2008, Kiev) [in Ukrainian], Kiev (2008), Part. 1, p. 783.Google Scholar
- 3.O. Ganyushkin and V. Mazorchuk, On Classification of Maximal Nilpotent Subsemigroups, Preprint No. 37, Uppsala University, Uppsala (2005).Google Scholar