1. Varieties of Boolean inverse semigroups
- Author
-
Friedrich Wehrung, Laboratoire de Mathématiques Nicolas Oresme (LMNO), Centre National de la Recherche Scientifique (CNRS)-Université de Caen Normandie (UNICAEN), and Normandie Université (NU)-Normandie Université (NU)
- Subjects
index ,Monoid ,generalized rook matrix ,bias ,refinement monoid ,Group Theory (math.GR) ,wreath product ,01 natural sciences ,[MATH.MATH-GR]Mathematics [math]/Group Theory [math.GR] ,Combinatorics ,fully group-matricial ,Symmetric group ,0103 physical sciences ,FOS: Mathematics ,type monoid ,group ,conical ,0101 mathematics ,residually finite ,Mathematics ,monoid ,Krohn–Rhodes theory ,radical ,Algebra and Number Theory ,inverse ,Semigroup ,congruence ,010102 general mathematics ,additive homomorphism ,Symmetric inverse semigroup ,variety ,Wreath product ,semigroup ,Boolean ,010307 mathematical physics ,Word problem (mathematics) ,Variety (universal algebra) ,Mathematics - Group Theory ,20M18 ,08B10 ,08B15 ,06F05 ,08A30 ,08A55 ,08B05 ,08B20 ,20E22 ,20M14 - Abstract
In an earlier work, the author observed that Boolean inverse semi-groups, with semigroup homomorphisms preserving finite orthogonal joins, form a congruence-permutable variety of algebras, called biases. We give a full description of varieties of biases in terms of varieties of groups: (1) Every free bias is residually finite. In particular, the word problem for free biases is decidable. (2) Every proper variety of biases contains a largest finite symmetric inverse semigroup, and it is generated by its members that are generalized rook matrices over groups with zero. (3) There is an order-preserving, one-to-one correspondence between proper varieties of biases and certain finite sequences of varieties of groups, descending in a strong sense defined in terms of wreath products by finite symmetric groups., 27 pages
- Published
- 2018
- Full Text
- View/download PDF