Back to search

University of York

Combinatorial Questions for $S\wr_{n} \mathcal{T}_n$ for a semigroup

Abstract

dc:description.abstract

We study combinatorial questions for the wreath product S\wrn\mathcal{T}n (properly, S\wr\underline{n}\mathcal{T}n) and related semigroups, where $S$ is a monoid and \mathcal{T}n is the full transformation monoid on $\underline{n}=\{ 1,2,\hdots, n\}$. It is well known that S\wrn\mathcal{T}n is isomorphic to the endomorphism monoid of a free $S$-act Fn(S) on $n$ generators and if $S$ is a group, Fn(S) is an example of an independence algebra. We determine the number of idempotents of S\wrn\mathcal{T}n, first in the more straightforward case where $S$ is a group. We investigate the monoid of partial endomorphisms \mathcal{PT}{\bf A} of an independence algebra ${\bf A}$, focussing on the special case where $\bf A$ is \bf{Fn(G)}. We determine Green's relations and Green's pre-orders on \mathcal{PT}{\bf Fn(G)}. We also obtain formulae for the number of idempotents and the number of nilpotents in \mathcal{PT}{\bf Fn(G)}. We specialise Lavers' technique in order to construct a presentation for Mn\rtimes \mathcal{T}n from presentations of Mn and \mathcal{T}n.

Degree

thesis:*
Name dc:type.qualificationname
Ph.D
Level dc:type.qualificationlevel
doctoral
Grantor dc:publisher.institution
University of York
Year dc:date.issued
2017

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Al-aadhami, Asawer
Advisor dc:contributor.advisor
  • Gould, Victoria

Rights

Language dc:language.dcterms_iso639_2
eng

Identifiers

dc:identifier.*
Identifier
uk.bl.ethos.736596

Chain of custody

source
Harvested from
White Rose University Consortium
Base URL
etheses.whiterose.ac.uk/cgi/oai2
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
related terms
citation

Al-aadhami, Asawer. Combinatorial Questions for $S\wr_{n} \mathcal{T}_n$ for a semigroup. doctoral thesis, University of York, 2017.