Minimum degrees of finite rectangular bands, null semigroups, and variants of full transformation semigroups
Abstract
For a positive integer n, the full transformation semigroup Tn consists of all self maps of the set {1,…,n} under composition. Any finite semigroup S embeds in some Tn, and the least such n is called the (minimum transformation) degree of S and denoted μ(S). We find degrees for various classes of finite semigroups, including rectangular bands, rectangular groups and null semigroups. The formulae we give involve natural parameters associated to integer compositions. Our results on rectangular bands answers a question of Easdown from 1992, and our approach utilises some results of independent interest concerning partitions/colourings of hypergraphs. As an application, we prove some results on the degree of a variant Tna. (The variant Sa = (S,*) of a semigroup S with respect to a fixed element a∈S, has underlying set S and operation x*y = xay.) It has been previously shown that n ≤ μ(Tna) ≤ 2n−r if the sandwich element a has rank r, and the upper bound of 2n−r is known to be sharp if r ≥ n−1. Here we show that μ(Tna) = 2n−r for r ≥ n−6. In stark contrast to this, when r = 1, and the above inequality says n ≤ μ(Tna) ≤ 2n−1, we show that μ(Tna)/n → 1 and μ(Tna)−n → ∞ as n → ∞. Among other results, we also classify the 3-nilpotent subsemigroups of Tn, and calculate the maximum size of such a subsemigroup.
Citation
Cameron , P J , East , J , FtzGerald , D , Mitchell , J D , Pebody , L & Quinn-Gregson , T 2023 , ' Minimum degrees of finite rectangular bands, null semigroups, and variants of full transformation semigroups ' , Combinatorial Theory , vol. 3 , no. 3 , 16 . https://doi.org/10.5070/C63362799
Publication
Combinatorial Theory
Status
Peer reviewed
ISSN
2766-1334Type
Journal article
Rights
Copyright 2023 by the author(s).This work is made available under the terms of a Creative Commons Attribution License, available at https://creativecommons.org/licenses/by/4.0/.
Description
Funding: ARC Future Fellowship FT190100632; German Science Foundation (DFG, project number 622397); and by the European Research Council (Grant Agreement no. 681988, CSP-Infinity).Collections
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Related items
Showing items related by title, author, creator and subject.
-
Generation and presentations of semigroup constructions : Bruck-Reilly extensions and P-semigroups
Carvalho, Catarina A. S. (University of St Andrews, 2006) - ThesisIn this thesis we study problems regarding finite presentability of Bruck-Reilly extensions, finite generation of the underlying monoids, and finite generation of P-unitary inverse semigroups. The first main question we ... -
On generators, relations and D-simplicity of direct products, Byleen extensions, and other semigroup constructions
Baynes, Samuel (University of St Andrews, 2015-11-30) - ThesisIn this thesis we study two different topics, both in the context of semigroup constructions. The first is the investigation of an embedding problem, specifically the problem of whether it is possible to embed any given ... -
Graph automatic semigroups
Carey, Rachael Marie (University of St Andrews, 2016-06-24) - ThesisIn this thesis we examine properties and constructions of graph automatic semigroups, a generalisation of both automatic semigroups and finitely generated FA-presentable semigroups. We consider the properties of graph ...