Commutative nilpotent transformation semigroups

Cameron, et al. determined the maximum size of a null subsemigroup of the full transformation semigroup $\mathcal{T}(X)$ on a finite set $X$ and provided a description of the null semigroups that achieve that size. In this paper we extend the results on null semigroups (which are commutative) to commutative nilpotent semigroups. Using a mixture of algebraic and combinatorial techniques, we show that, when $X$ is finite, the maximum order of a commutative nilpotent subsemigroup of $\mathcal{T}(X)$ is equal to the maximum order of a null subsemigroup of $\mathcal{T}(X)$ and we prove that the largest commutative nilpotent subsemigroups of $\mathcal{T}(X)$ are the null semigroups previoulsy characterized by Cameron, et al..


Introduction
This paper focuses on commutative nilpotent subsemigroups of T (X), the semigroup of full transformations over X.More specifically, when X if finite, we determine the maximum size of a commutative nilpotent subsemigroup of T (X) and we specify which semigroups achieve this maximum size.
A similar result already exists for null subsemigroups of T (X) when X is finite [CEF + 21].Cameron et al. proved that the maximum size of a null subsemigroup of T (X) is given by max{t |X|−t : t ∈ {1, . . ., |X|}} and characterized the null semigroups of maximum order.
Null semigroups are a special case of nilpotent semigroups.Additionally, they are also commutative.For this reason, our main result extends the one about null subsemigroups of T (X).In fact, we prove that the maximum size of a commutative nilpotent semigroup is equal to the maximum size of a null semigroup.Moreover, we show that the commutative nilpotent semigroups of maximum size are actually the null semigroups described in [CEF + 21].
Our results can be compared to the ones obtained by Biggs, Rankin and Reis on nilpotent subsemigroups of T (X), for a finite set X -in [BRR76] they proved that the maximum size of these semigroups is (|X| − 1)!.We show that, when |X| 4, non-commutative nilpotent subsemigroups of T (X) can be much larger than the commutative ones.
Some other authors also tried to find the largest groups and semigroups that satisfy a certain property.For instance, Burns and Goldsmith [BG89] 2020 Mathematics Subject Classification.Primary 20M20, 20M14; Secondary 05C25, 05C05.
This work is funded by national funds through the FCT -Fundação para a Ciência e a Tecnologia, I.P., under the scope of the projects UIDB/00297/2020 and UIDP/00297/2020 (Center for Mathematics and Applications).
The third author is funded by national funds through the FCT -Fundação para a Ciência e a Tecnologia, I.P., under the scope of the studentship 2021.07002.BD.characterized the largest abelian subgroups of the symmetric group and Vdovin [Vdo99] characterized the largest abelian subgroups of the alternating group.Gray and Mitchell [GM08] determined the maximum order of several subsemigroups of the semigroup T n of full transformations over {1, . . ., n}, namely the left and right zero semigroups, the completely simple semigroups and the inverse semigroups.Araújo, Bentz and Janusz [ABJ15] characterized, for a finite set X, the largest commutative inverse subsemigroups of the symmetric inverse semigroup I(X), as well as the largest commutative nilpotent subsemigroups of I(X).
This paper is organized in the following way.We begin with Section 2, where we provide some background needed to understand Section 3.This includes some results regarding null subsemigroups of T (X) of maximum order proved in [CEF + 21].
In Section 3 we describe the largest commutative nilpotent subsemigroups of T (X) and determine its order.In the process we also prove that for each commutative nilpotent subsemigroup of T (X) there is a null subsemigroup of T (X) of the same size.

Preliminaries
Let T (X) be the semigroup of full transformations on the set X. Throughout this paper, X will denote a finite set.
Let S be a semigroup with a zero 0. We say that S is a nilpotent semigroup is there exists m ∈ N such that the product of any m elements of S is equal to the zero 0. This is equivalent to write that S m = {0} for some m ∈ N. If S 2 = {0} then we say that S is a null semigroup.
(2) If the zero of S has rank at least 2, then |X| = 2 and the only transformation of S is the identity.

Commutative nilpotent subsemigroups of T (X) of maximum order
In this section we investigate commutative nilpotent subsemigroups of T (X).More specifically, we demonstrate that the maximum order of these semigroups is (|X|)ξ -the maximum order of a null subsemigroup of T (X).Additionally, we prove that the largest commutative nilpotent subsemigroups of T (X) are null semigroups -the ones described in Theorem 2.3.Furthermore, we show that given a commutative nilpotent subsemigroup of T (X) we can always find a null subsemigroup of T (X) of the same size.
We have βe = eβ = e because e is the zero of S. Also, since x ∈ Im e, there exists z ∈ X such that ze = x.Hence xβ = zeβ = ze = x, which proves (1).
Proof.Let e be the zero of S and let x ∈ X be such that Im e = {x}.Since S is nilpotent, there exists m ∈ N such that S m = {e}.
Suppose, with the aim of obtaining a contradiction, that β∈S Im β = X.Let x 1 ∈ X \{x}.There exist β 1 ∈ S and x 2 ∈ X such that x 1 = x 2 β 1 .By Proposition 3.1(1), Continuing in this way, construct a sequence (x n ) n∈N of elements of X \ {x} and a sequence (β n ) n∈N of elements of S that verify x n = x n+1 β n for all n ∈ N. Since X is finite, then there exist i < j such that x i = x j and which is a contradiction.
Definition 3.3.Let S be a nilpotent subsemigroup of T (X) whose zero has rank 1.Let e be the zero of S. Given a partition {A j } k j=0 of X, we say that {A j } k j=0 is an S-partition of X if A l for all β ∈ S , j = 1, . . ., k.
Note that, from construction, given a nilpotent subsemigroup S of T (X) whose zero has rank 1, there is at most one S-partition of X.We will prove in Proposition 3.5 below that an S-partition always exists, but first we illustrate the definition with an example.
Notice that the first transformation is the zero of the semigroup and has rank 1.Furthermore, the product of any three transformations is equal to the zero of S. It is straightforward to verify that S is a commutative semigroup.Hence S is a commutative nilpotent semigroup.
Proposition 3.5.Let S be a nilpotent subsemigroup of T (X) whose zero has rank 1.Then there exists an S-partition of X.
Proof.Let e be the zero of S and i ∈ X be such that Im e = {i}.
Let n = |X|.We are going to prove the result by induction on n.
Suppose that n = 1.Then S = i i = {e} and X = {i} = Im e.
Thus {Im e} is an S-partition of X. Suppose that n 2 and assume that the result is valid for n − 1.Since S is a nilpotent semigroup then, by Proposition 3.2, there exists t ∈ X \ β∈S Im β, which implies that β| X\{t} ∈ T (X \ {t}) for all β ∈ S. It is easy to see that S ′ = {β| X\{t} : β ∈ S} is a nilpotent subsemigroup of T (X \ {t}) whose zero is e| X\{t} .The rank of e| X\{t} is also 1 and Im e| X\{t} = {i} = Im e.By the induction hypothesis, X \ {t} admits an S ′partition {A j } k j=0 , where A 0 = Im e| X\{t} = Im e and, for all j ∈ {1, . . ., k}, From the definition of t, we have t = i and tβ = t for all β ∈ S. Let A l for all β ∈ S .
We want to construct an S-partition of X from the S ′ -partition {A j } k j=0 of X \ {t}.We will either create a new set A k+1 formed exclusively by t, or add t to one of the existing sets of {A j } k j=0 .The way we extend the partition of X \ {t} depends on the value of r defined above and is chosen so that the new partition is an S-partition of X.
We consider two cases.First, suppose that r = k + 1.This implies that there exists β ∈ S such that tβ / ∈ k−1 l=0 A l .Consequently, A l for all β ∈ S for all j ∈ {1, . . ., k}.Let A k+1 = {t}.Hence A l for all β ∈ S and {A j } k+1 j=0 is an S-partition of X. Suppose that r k.Let A ′ r = A r ∪{t} and A ′ j = A j for all j ∈ {0, . . ., k}\ {r}.We also have tβ / ∈ r−2 l=0 A ′ l for some β ∈ S. Then for all j ∈ {1, . . ., k}.Thus {A ′ j } k j=0 is an S-partition of X.The concept of S-partition plays a key role in the proof of Lemma 3.6, which explains how commutativity restricts the structure of the maps of S. This result is the key idea used to determine the maximum size of a commutative nilpotent subsemigroup of T (X).
Lemma 3.6.Let S be a commutative nilpotent subsemigroup of T (X) whose zero has rank 1, and {A j } k j=0 be the S-partition of X.Let i ∈ {1, . . ., k} and define A = i−1 j=0 A j .Let x ∈ A i and β 1 , . . ., β m ∈ S be such that Theorem 3.7.Let S be a commutative nilpotent subsemigroup of T (X) whose zero has rank 1, and let {A j } k j=0 be the S-partition of X.Then there exists a null subsemigroup N of T (X) such that |S| = |N |.
Proof.The idea of the proof is to construct a labelled tree using the semigroup S, modify the tree and obtain a new one which will be the labelled tree of a null semigroup of size |S|.In order to obtain a labelled tree from S, we first associate each transformation of S to a word of length |X| over X, and then use these words to create a tree.Lemma 3.6 is what assures that we can modify the tree the way we do.Finally, we can obtain a new set of words from the new tree and see that the transformations associated to those words form a null semigroup.(For an illustration of how the proof applies to a particular semigroup, see Example 3.10.) Let n = |X|.
For simplicity, we start by reordering the elements of X in a way such that the elements of A j appear before the elements of A j+1 for all j ∈ {0, . . ., k − 1}.Assume that, after reordering, the elements of X are sequenced in the following way: x 1 , . . ., x n .
Using the order x 1 , . . ., x n and the semigroup S, we are going to create a set of words over X.Each transformation β ∈ S determines the word w β of length n over X whose i-th letter is x i β.Let W = {w β : β ∈ S} be the set of words determined by S. Note that |W | = |S|.
We are going to construct a labelled tree using the set of words W .The set of vertices of the tree is the set of prefixes of the words belonging to W , that is, the set of vertices is {u ∈ X * : uv ∈ W for some v ∈ X * }.Each arc is labelled with a letter from the alphabet X and, given two vertices u and v, we have an arc from u to v labelled by the letter x if and only if ux = v.
Observe that, as a consequence of the way we defined the tree, the vertex ε is the only one whose indegree is zero, which means that the vertex ε is the root of the tree.
Let β ∈ S and assume that w β = w 1 • • • w n , where w 1 , . . ., w n ∈ {x 1 , . . ., x n }.If we start at the vertex ε and we follow the path formed by the arcs labelled by w 1 , . . ., w n , we end up at the vertex w β = w 1 • • • w n , which corresponds to a leaf of the tree.Hence each one of the leaves is associated with a unique word of W (and, consequently, a unique transformation of S).Therefore the tree has |S| leaves.
Since (A 0 ∪A 1 )β = {x 1 } for all β ∈ S, then x 1 , x 2 1 , . . ., x are prefixes of all the words in W and, consequently, for each i ∈ {1, . . ., |A 0 ∪ A 1 |} x i 1 is the only vertex of length i.In the tree, this translates into a path of length |A 0 ∪ A 1 | that begins at the vertex ε (the root of the tree) and ends at the vertex x , and where all the arcs have label x 1 .We call this path the trunk of the tree.Since |A 0 | = 1, the length of the trunk is at least 1.All the paths labelled by some word w β ∈ W starting at the root (vertex ε) and ending at a leaf (the one associated with β) contain the trunk of the tree.
Assume that we have at least two transformations β 1 , β 2 of S that are equal in {x 1 , . . ., x i } and different in {x i+1 } (meaning that x i+1 β 1 = x i+1 β 2 ) for some i ∈ {1, . . ., n − 1}.Then the words w β 1 , w β 2 determined by β 1 , β 2 share the same prefixes of length between 0 and i, and the prefix of length i + 1 is different for each one of the words.Hence, in the tree of S, the paths labelled by w β 1 , w β 2 starting at the root and ending at the leaves w β 1 , w β 2 coincide on the first i arcs and diverge on the (i + 1)-th arc.This means that the starting vertex of the (i + 1)-th arcs of these paths has outdegree at least 2. In cases like this one, where we have a vertex with outdegree at least 2, that is, a vertex that has at least 2 arcs starting in it, we say that a branching occurs.
Let i ∈ {1, . . ., n}.Consider all the arcs of the tree whose starting vertex is a word of length i − 1 and ending vertex is a word of length i.We say that those arcs form the level x i of the tree.If there is at least one branching at level x i (which happens if there exists a vertex that is a word of length i − 1 whose outdegree is at least 2), then we call it a branching level.If no branching occurs at level x i (that is, if all the vertices that are words of length i − 1 have outdegree 1), then we call it a linear level.
Note that the levels of the trunk of the tree (the first |A 0 ∪ A 1 | levels) are all linear and contain exactly one arc.
Given an arc of the level x i , its label corresponds to the i-th letter of some word w β of W , which is equal to x i β.Notice that if i > 1 then, because of the way we ordered the elements of X, the labels of the arcs of the level x i belong to {x 1 , . . ., x i−1 }.
The next two lemmata are a consequence of Lemma 3.6 and provide some properties of the tree of S that relate the notions of branching and linear level.Lemma 3.8 allow us to modify the tree of S and Lemma 3.9 guarantees that the new tree can be that of a null semigroup.
Lemma 3.8.Suppose that we have a branching at level x i for some i ∈ {2, . . ., n}.Let s 2 be the number of arcs in that branching, and x i 1 , . . ., x is be the labels of those arcs (where i 1 < i 2 < • • • < i s ).Then i s < i and the levels x i 2 , . . ., x is are linear.
Proof.The labels of the arcs of the level x i belong to {x 1 , . . ., x i−1 }.Hence x is ∈ {x 1 , . . ., x i−1 } and, consequently, i s < i.
The existence of a branching at level x i with s arcs, whose labels are x i 1 , . . ., x is , implies the existence of s transformations of S, β 1 , . . ., β s , that are equal in {x 1 , . . ., x i−1 } and such that x i β 1 , . . ., x i β s ∈ {x i 1 , . . ., x is } and are pairwise distinct.Assume, without loss of generality, that x i β j = x i j for all j ∈ {1, . . ., s}.
Let l ∈ {1, . . ., k} be such that x i ∈ A l .Because of the way we ordered the elements of X, l−1 j=0 A j ⊆ {x 1 , . . ., x i−1 }.Hence β 1 , . . ., β s are equal in l−1 j=0 A j .We want to see that the levels x i 2 , . . ., x is are linear.Let j ∈ {2, . . ., s}.Let u be a vertex that is a word of length i j − 1.Then u is the starting vertex of some arc of the level x i j .Choose one of the arcs whose starting vertex is u and let γ ∈ S be a transformation whose path starting at the root, ending at a leaf and labelled by w γ contains the chosen arc.Then the label of that arc is equal to x i j γ and the label of the arc of the level x i 1 belonging to that path is equal to x i 1 γ.By Lemma 3.6, x i β 1 γ = x i β j γ and, consequently, x i 1 γ = x i j γ.Therefore the only arc with starting vertex u is the one with label x i 1 γ.Thus u has outdegree 1.
We just proved that all the starting vertices of the arcs of the level x i j have outdegree 1.Thus the level x i j is linear.Since j is an arbitrary element of {2, . . ., s}, then the levels x i 2 , . . ., x is are all linear.
As a consequence of Lemma 3.8, we have that a branching with s arcs is associated to s levels that precede it: the first one can either be a linear or a branching level and the last s − 1 are all linear levels.Lemma 3.9.A branching with s arcs is preceded by at least s linear levels.
Proof.Assume that we have a branching at level x i whose arcs have labels x i 1 , . . ., x is (where i 1 < i 2 < • • • < i s < i).By Lemma 3.8, the levels x i 2 , . . ., x is are all linear and precede the branching.Thus the branching is preceded by at least s − 1 linear levels.Suppose that the levels x i 2 , . . ., x is are all outside of the trunk of the tree.Since the trunk of the tree has at least one level, and all the levels of the trunk are linear and antecede the branching, then the branching is preceded by at least s linear levels.
Suppose that there is at least one level, among the levels x i 2 , . . ., x is , that belongs to the trunk of the tree.Then the level x i 1 is also part of the trunk, which implies that the level x i 1 contains only one arc whose label is x 1 .
Let u be an arc of the level x is .There exists γ ∈ S such that the path labelled by w γ , starting at the root and ending at a leaf, contains u, which has label x is γ.This path also contains the only arc from the level x i 1 whose label is x 1 .Since the level x i 1 is a part of the trunk, then Let l ∈ {1, . . ., k} be such that x i ∈ A l .Let β 1 , β s ∈ S be such that β 1 and β s are equal in {x 1 , . . ., x i−1 }, x i β 1 = x i 1 and x i β s = x is .These transformations exist because x i 1 and x is are labels of arcs that are part of a branching at level x i .We have l−1 j=0 A l ⊆ {x 1 , . . ., x i−1 } because of the way we rearranged the elements of X and, as a consequence, β 1 and β s are equal in l−1 j=0 A l .Then, by Lemma 3.6, x is γ and u has label x 1 .Since u is an arbitrary arc of the level x is , then all the arcs of the level x is are labelled by x 1 .Hence x is β = x 1 for all β ∈ S and, consequently, x is ∈ A 0 ∪ A 1 .Thus the level x is is part of the trunk and, since the levels x i 2 , . . ., x i s−1 precede the level x is , they are also part of the trunk.Therefore the trunk has at least s linear levels and the branching is preceded by at least s linear levels.
With the aim of finding a null semigroup of size |S|, we are going to modify the tree of S and obtain a new tree.We will then see that this tree is that of a null semigroup of size |S|.In order to guarantee that the new semigroup has size |S|, we make sure that the modifications we apply to the tree of S do not change its number of leaves (which is equal to |S|).
We start by deleting the labels of the arcs.Then we consider all the linear levels that do not correspond to the trunk of the tree.Assume that there are m linear levels in the tree, m ′ of which are the linear levels outside of the trunk.Then m is equal to the sum of m ′ and the number of arcs in the trunk.We are going to move those m ′ linear levels to the trunk of the tree, that is, we are going to eliminate all the arcs that correspond to those levels, and we are going to add m ′ arcs to the trunk of the tree (that is, we are adding m ′ linear levels to the trunk).Of course, if the tree of S has all its linear levels in the trunk, then we do not need to perform any changes in the tree.Note that, since all the starting vertices of the arcs belonging to the linear levels have outdegree 1, then eliminating linear levels does not cause any problems in the tree.This entire process does not change neither the number of leaves of the tree, neither the number of linear and branching levels of the tree.Furthermore, these transformations do not create new branchings and maintain the number of arcs of the existing ones.This means that each branching of the new tree was also a branching of the tree of S (and it has the same number of arcs).Now we just need to add labels to the arcs and rename the vertices of the new tree, in a way that guarantees that this is a tree of a semigroup.We start by labelling the arcs.All the m arcs belonging to the trunk of the tree are labelled by x 1 .We now consider the starting vertices of the arcs that do not belong to the trunk of the new tree.We want to label these arcs using exclusively elements from {x 1 , . . ., x m }.If we have a vertex with outdegree 1 then we label the corresponding arc by x 1 .Assume now that we have a vertex with outdegree s 2. Then we have a branching at that vertex.According to Lemma 3.9, in the tree of S this branching was preceded by s linear levels, which are all part of the trunk of the new tree.Hence s m and we label the arcs of this branching by x 1 , . . ., x s .
Finally, we rename the vertices.We want the vertices to be the prefixes of the words associated with the leaves, which should be words of length n.Hence the root of the tree needs to be the word ε.We also want to guarantee that, given two vertices u and v, there is an arc labelled by x from u to v if and only if v = ux.Hence the vertices that are not the root must be given by wx, where x is the label of the only arc that ends at the vertex we are considering and w is the starting vertex of that arc.
Let Z be the set of words formed by the labels of the leaves of the new tree.Note that we have |S| words, all of which have length n.Using again the order x 1 , . . ., x n of the elements of X, we are going to obtain from each word of Z a transformation of T (X).Let w = w 1 • • • w n ∈ Z (where w 1 , . . ., w n ∈ {x 1 , . . ., x n }).Then w determines the transformation β ∈ T (X) such that x i β = w i .Let N be the set formed by the transformations obtained from Z.We want to prove that N is a null semigroup.First, we notice that x n 1 ∈ Z. Hence the constant map e with image {x 1 } belongs to N .Let β, γ ∈ N and x ∈ X.Since the labels of the arcs of the new tree belong to {x 1 , . . ., x m }, then Z ⊆ {x 1 , . . ., x m } * and, consequently, xβ ∈ {x 1 , . . ., x m }.However, at the trunk of the new tree, the arcs are all labelled x 1 , which implies that x m 1 is a prefix of all the words in Z. Therefore {x 1 , . . ., x m }γ = {x 1 } and, as a consequence, xβγ = x 1 .Thus βγ = e.
Therefore N is a null subsemigroup of T (X) such that According to Theorem 3.7, given a commutative nilpotent subsemigroup S of T (X) whose zero has rank 1, there exists a null subsemigroup N of T (X) that has size |S|.However, by Theorem 2.2, N has at most (|X|)ξ transformations, which means that S also has at most (|X|)ξ transformations.Thus the maximum size of a commutative nilpotent subsemigroup of T (X) is (|X|)ξ.
Example 3.10.The present example serves as a way to show how the proof of Theorem 3.7 works.In order to do that, we consider again the semigroup S from Example 3.4.We saw that {A j } 3 j=0 is the S-partition of {1, 2, 3, 4, 5, 6}, where We want to choose an order of the elements of {1, 2, 3, 4, 5, 6} such that the element of A 0 is the first one in that order, the second one is the element of A 1 , followed by the three elements of A 2 (in any order) and the last element is the one belonging to A 3 .A possible way of ordering the elements is 5, 1, 2, 4, 6, 3.
The set of words we obtain from the transformations of S (using the order 5, 1, 2, 4, 6, 3) is W = {555555, 555551, 551112, 551114, 551116} ⊆ {1, 2, 3, 4, 5, 6} * , which allow us to construct the tree in Figure 1.In Figure 1, the image on the left is the tree of S with the arcs and vertices labelled.The trunk and branchings of the tree are also identified.The trunk of the tree corresponds to the path from the root (vertex ε) to the vertex 55.The branchings of the tree are the ones associated with the vertices 55, 55555 and 55111, and are marked by dashed rectangles.
Also in Figure 1, in the image on the right the levels of the tree of S are indicated at the top of the tree, and at the bottom are distinguished the linear and branching levels of the tree.Now we are going to perform some transformations in tree of S in order to obtain a new tree.We consider the two linear levels that are not a part of the trunk of the tree of S, namely the levels 4 and 6.The idea is to remove those linear levels from the tree (that is, we are going to delete the arcs belonging to levels 4 and 6 -the ones in bold in the tree on the left in Figure 2), and then add two linear levels to the trunk of the tree (that is, we are going to add two arcs to the trunk -the ones in bold in the tree on the right in Figure 2).Finally, we just need to relabel the arcs and vertices of the tree we obtained in Figure 2. Figure 3 shows the new labelled tree.Using the words from Z and the order 5, 1, 2, 4, 6, 3, we obtain the transformations 1 2 3 4 5 6 5 5 5 5 5 5 , 1 2 3 4 5 6 5 5 1 5 5 5 , 1 2 3 4 5 6 5 5 5 5 5 1 1 2 3 4 5 6 5 5 1 5 5 1 , 1 2 3 4 5 6 5 5 2 5 5 1 .
We can easily check that the product of any two transformations is equal to the first transformation, which is the zero of this new semigroup.Hence we obtained a null subsemigroup of T 6 with as many elements as S.
As a consequence of Theorem 3.7 we know that the maximum size of a commutative nilpotent subsemigroup of T (X) whose zero has rank 1 is (|X|)ξ.Theorem 3.11 complements this result by examining the size of these semigroups when the zero has rank at least 2. Theorem 3.11.Let S be a commutative nilpotent subsemigroup of T (X) whose zero has rank at least 2. Then Let ϕ : S −→ x∈Im e S x be the map which sends β ∈ S to the tuple whose x-th component is β| Ix .We are going to prove that ϕ is injective.Let β, γ ∈ S be such that (β)ϕ = (γ)ϕ.This implies that β| Ix = (x)(β)ϕ = (x)(γ)ϕ = γ| Ix for all x ∈ Im e and, consequently, β = γ (because {I x } x∈Im e is a partition of X).
We have Theorem 3.7 guarantees that, for each commutative nilpotent subsemigroup of T (X) whose zero has rank 1, there exists a null subsemigroup of T (X) of the same size.Note that, as a consequence of Theorem 3.11, this is also true when the zero of the semigroup has rank at least 2.

|S|
Theorems 3.7 and 3.11 assert that the maximum size of a commutative nilpotent subsemigroup of T (X) is (|X|)ξ.The next theorem describes these semigroups of size (|X|)ξ and shows that they are precisely the null semigroups described in Theorem 2.3.Theorem 3.12.Let S be a commutative nilpotent subsemigroup of T (X) of maximum size.Then S is a null semigroup.
Suppose that the zero of S has rank at least 2.Then, by Theorem 3.11, n = 2 and S is a null semigroup.
Suppose now that the zero of S has rank 1.We are going to use the proof of Theorem 3.7 to prove the result.Let {A i } k j=0 be the S-partition of X and consider the order x 1 , . . ., x n of the elements of X used to construct the tree of S.
Thus T N has a trunk with (n)α arcs and the starting vertices of the arcs of the levels x (n)α+1 , . . ., x n have outdegree (n)α (which means that a branching with (n)α arcs occurs at those vertices).Also, all the linear levels of T N are in the trunk, which means T N has (n)α linear levels (the levels x 1 , . . ., x (n)α ) and n − (n)α branching levels (the levels x (n)α+1 , . . ., x n ).
In order to obtain T N from T S , the only thing we do (besides changing the labels of the arcs and renaming the vertices) is move the linear levels of T S , that are not in the trunk, to the trunk of the tree (assuming that there are any linear levels outside the trunk of T S ).This means that, in the process of transforming the tree T S into the tree of T N , we do not change the number of linear levels.Therefore T S and T N have the same number of linear levels, which is equal to (n)α.
Assume, with the aim of obtaining a contradiction, that there is at least one linear level outside the trunk of T S .This implies that the number of arcs of the trunk of T S is less than (n)α.Consider the branching closest to the root of the tree, that is, the branching at the end of the trunk.By Lemma 3.9 the number of linear levels that occur before a branching is not smaller than the number of arcs of that branching.Hence the number of arcs of the branching at the end of the trunk of T S is at most (n)α − 1.When we transform T S into T N , we do not change the number of arcs of that branching (we just move linear levels to the trunk).This implies that the branching closest to the root of the tree T N has less than (n)α arcs, which is a contradiction.Thus, all the linear levels of T S are associated with its trunk.Consequently, we do not need to move any of the linear levels of T S , which means that the structure of T S is equal to the structure of T N (that is, T S and T N are equal except, possibly, the labels of the arcs and vertices).
We now know that the trunk of T S has (n)α arcs, all the linear levels of T S correspond to its trunk, and a branching with (n)α arcs occurs in all vertices that are words of length between (n)α and n − 1.The arcs of the trunk are associated with the elements of A 0 ∪A 1 and are all labelled x 1 (the linear levels associated with the trunk are the levels x 1 , . . ., x (n)α ).Every branching has (n)α arcs and their labels correspond to the levels with which they are associated with.According to Lemma 3.8, (n)α − 1 of those levels are linear and there is an extra level that precedes them.The only linear levels in T S are the levels x 1 , . . ., x (n)α , which means that the (n)α arcs of each branching are labelled with x 1 , . . ., x (n)α .Hence S = β ∈ T (X) : {x 1 , . . ., x (n)α }β = {x 1 } and Im β ⊆ {x 1 , . . ., x (n)α } = N and, consequently, S is a null semigroup.

Figure 2 .
Figure 2. Transforming the tree of S.

Figure 3 .
Figure 3. New tree obtained from the tree of S.