Abstract
Let 𝒯X be the full transformation monoid over a finite set X, and fix some a ∈ 𝒯X of rank r. The variant 𝒯aX has underlying set 𝒯X , and operation f * g = fag. We study the
congruences of the subsemigroup P = Reg(𝒯aX) consisting of all regular elements of 𝒯aX, and the lattice Cong(P) of all such congruences. Our main structure theorem ultimately decomposes Cong(P) as a specific subdirect product of
Cong(𝒯r), and the full equivalence relation lattices of certain
combinatorial systems of subsets and partitions. We use this
to give an explicit classification of the congruences themselves,
and we also give a formula for the height of the lattice.
congruences of the subsemigroup P = Reg(𝒯aX) consisting of all regular elements of 𝒯aX, and the lattice Cong(P) of all such congruences. Our main structure theorem ultimately decomposes Cong(P) as a specific subdirect product of
Cong(𝒯r), and the full equivalence relation lattices of certain
combinatorial systems of subsets and partitions. We use this
to give an explicit classification of the congruences themselves,
and we also give a formula for the height of the lattice.
Original language | English |
---|---|
Pages (from-to) | 431-464 |
Journal | Journal of Algebra |
Volume | 662 |
Early online date | 9 Sept 2024 |
DOIs | |
Publication status | Published - 15 Jan 2025 |
Keywords
- Congruence
- Congruence lattice
- Full transformation semigroup
- Variant
- Subdirect product