St Andrews Research Repository

St Andrews University Home
View Item 
  •   St Andrews Research Repository
  • Mathematics & Statistics (School of)
  • Pure Mathematics
  • Pure Mathematics Theses
  • View Item
  •   St Andrews Research Repository
  • Mathematics & Statistics (School of)
  • Pure Mathematics
  • Pure Mathematics Theses
  • View Item
  •   St Andrews Research Repository
  • Mathematics & Statistics (School of)
  • Pure Mathematics
  • Pure Mathematics Theses
  • View Item
  • Register / Login
JavaScript is disabled for your browser. Some features of this site may not work without it.

Presentations and efficiency of semigroups

Thumbnail
View/Open
HayrullahAyikPhDThesis.pdf (22.48Mb)
Date
1998
Author
Ayik, Hayrullah
Supervisor
Campbell, C. M. (Colin Matthew)
O'Connor, John J. (John Joseph)
Metadata
Show full item record
Abstract
In this thesis we consider in detail the following two problems for semigroups: (i) When are semigroups finitely generated and presented? (ii) Which families of semigroups can be efficiently presented? We also consider some other finiteness conditions for semigroups, homology of semigroups and wreath product of groups. In Chapter 2 we investigate finite presentability and some other finiteness conditions for the O-direct union of semigroups with zero. In Chapter 3 we investigate finite generation and presentability of Rees matrix semigroups over semigroups. We find necessary and sufficient conditions for finite generation and presentability. In Chapter 4 we investigate some other finiteness conditions for Rees matrix semigroups. In Chapter 5 we consider groups as semigroups and investigate their semigroup efficiency. In Chapter 6 we look at "proper" semigroups, that is semigroups that are not groups. We first give examples of efficient and inefficient "proper" semigroups by computing their homology and finding their minimal presentations. In Chapter 7 we compute the second homology of finite simple semigroups and find a "small" presentation for them. If that "small" presentation has a special relation, we prove that finite simple semigroups are efficient. Finally, in Chapter 8, we investigate the efficiency of wreath products of finite groups as groups and as semigroups. We give more examples of efficient groups and inefficient groups.
Type
Thesis, PhD Doctor of Philosophy
Collections
  • Pure Mathematics Theses
URI
http://hdl.handle.net/10023/2843

Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

Advanced Search

Browse

All of RepositoryCommunities & CollectionsBy Issue DateNamesTitlesSubjectsClassificationTypeFunderThis CollectionBy Issue DateNamesTitlesSubjectsClassificationTypeFunder

My Account

Login

Open Access

To find out how you can benefit from open access to research, see our library web pages and Open Access blog. For open access help contact: openaccess@st-andrews.ac.uk.

Accessibility

Read our Accessibility statement.

How to submit research papers

The full text of research papers can be submitted to the repository via Pure, the University's research information system. For help see our guide: How to deposit in Pure.

Electronic thesis deposit

Help with deposit.

Repository help

For repository help contact: Digital-Repository@st-andrews.ac.uk.

Give Feedback

Cookie policy

This site may use cookies. Please see Terms and Conditions.

Usage statistics

COUNTER-compliant statistics on downloads from the repository are available from the IRUS-UK Service. Contact us for information.

© University of St Andrews Library

University of St Andrews is a charity registered in Scotland, No SC013532.

  • Facebook
  • Twitter