Finite regular semigroups with permutations that map elements to inverses

We give an account on what is known on the subject of permutation matchings, which are bijections of a finite regular semigroup that map each element to one of its inverses. This includes partial solutions to some open questions, including a related novel combinatorial problem.


Introduction and background
The author published three papers [3], [4], and [5] in Semigroup Forum relating to the question of when a finite regular semigroup S has a bijection φ such that φ(a) ∈ V (a), which is to say that φ maps elements to their inverses.Some simple observations will natually occur to the reader: if S is an inverse semigroup, then there is a unique such permutation φ, and if S is a union of groups, the mapping a → a −1 , where a −1 denotes the group inverse of a in S, defines a permutation matching, (we shall sometimes abbreviate the term to matching) as these bijections are called.Rectangular bands are exactly the semigroups where every bijection of S is a matching, as they are characterised by the identity x = xyx, while the identity mapping is a matching if and only if S satisfies the identity x = x 3 .
It does not take long however to locate examples of finite regular semigroups that have no matching.A minimal example is given by the 7-element orthodox 0-rectangular band B = {(i, j) : 1 ≤ i ≤ 2, 1 ≤ j ≤ 3} ∪ {0}, where E(B) = {(1, 2), (1,3), (2, 1)} ∪ {0}.The pairs (2, 2) and (2, 3) have only one inverse element between them, that being (1, 1), and so no permutation matching exists for B. Proposition 1.5 of [3] gives an example of an orthodox 0-rectangular band, with an involution matching, but which has B as a retract.It follows from this that the class of semigroups that possess a permutation matching is not closed under the taking of regular subsemigroups, nor the taking of homomorphic images.The class is closed however under the taking of direct products.The nature of the example represented by B suggests that the existence of permutation matchings will correspond to the satisfaction of Hall's condition in the bipartite graph featuring two copies of S with edges joining mutually inverse pairs.Indeed we see this as part (iii) of the following theorem.This theorem was applied to show that the full transformation semigroup T n has a matching [3,Theorem 2.12].The argument also extends to the partial transformation semigroup, P T n .
The proof shows that each D-class D of T n has a matching, and this was done by partitioning D into so-called Q classes, which are themselves unions of R-classes.To each R-class R ⊆ D, (remembering that α R β in T n if and only if kerα = kerβ), we associate an increasing sequence of positive integers where the k i run over the cardinalities of the kernel classes of the members of R, so that t is the rank of the members of D. The Q-class defined by R is then the union of all R-classes R ′ such that s R ′ = s R .
We then show the existence of a permutation matching for each Q-class of T n .To do this, we consider the bipartite graph G consisting of two copies, Q and Q ′ , of the members of Q, where ab ′ is an edge in G if (and only if) a and b are mutual inverses in T n .It is then proved that G is a regular graph, which is to say each vertex is of a common degree m ≥ 1, whence each member of Q has exactly m inverses in Q.It then follows by a standard result from graph theory that G has a perfect matching, which is a set of disjoint edges covering all vertices of G.
This perfect matching may then be used to generate a permutation matching of Q as follows.Begin with any vertex a 1 of Q and consider the sequence of vertices a • , which will eventually yields a cycle a 1 , a 2 , • • • , a r say, where a i and a i+1 are mutual inverses (and where we take r + 1 = 1).Since the edges of G form a perfect matching, no vertex a i of Q can be followed in the Q-sequence by a previous vertex of Q, other than a 1 , as that would result in the contradiction of two edges of the perfect matching having a common vertex in Q ′ .We then repeat the process for a new vertex not contained in any of the previous cycles of inverses, culminating in a permutation matching of Q.
However the following question remains open.
Question 1.Does the semigroup O n of all order-preserving mappings on a finite n-chain have a permutation matching?

Involution matchings
The unique matching of an inverse semigroup is not just a permutation but an involution, and likewise may be said for completely regular semigroups through the matching of elements to their group inverses.Another example type with a natural involution matching as we shall call them is the class OP n of all semigroups of orientation-preserving mappings (Example 2.6 of [3]), and the technique extends to the class P n of all semigroups of orientation-preserving and orientation-reversing mappings (Section 3.2 of [4]).For background on these classes of semigroups see [2], [6], and [7].A natural question is then: Question 2. Does T n have an involution matching?By a result of Schein [8], T n is covered by its inverse subsemigroups.If T n possessed an inverse cover with the additional property that the non-empty intersection of any pair of subsemigroups in the cover were regular (and hence inverse), it would be possible to use that cover to construct an involution matching.However, it was shown in [5, Theorem 4.2.3 ] that for n ≥ 4, no such cover exists.Moreover for n ≥ 8, T n does not have a permutation matching in which each element is mapped to a strong inverse a ′ , by which we mean an inverse with the property that a, a ′ is an inverse subsemigroup of T n .
The case of T n is however only a particular instance of the general question, which has not been resolved.Question 3. Does every finite regular semigroup with a permutation matching possess an involution matching?
In [4, Theorems 3.7 and 3.1] it was proved that any (finite) orthodox semigroup with a permutation matching has an involution matching.Moreover an orthodox semigroup possesses a permutation matching if and only if each 0-rectangular band B = (D a ∪ {0})/H (a ∈ S) has the property that the maximal rectangular subbands of B are pairwise similar, meaning that the ratio of their number of L -to R -classes is a constant throughout D a .A wider class of regular semigroups is defined by the condition on the arrangement of idempotents within D-classes: for all idempotents e, f, g ∈ E(S), e L f Rg ⇒ ∃h ∈ E(S) such that e R h L g, giving an egg-box picture where the four idempotents in question form a 'solid' rectangle within their D-class, which lead to the name E-solid semigroups.Equivalently, a regular semigroup S is E-solid if and only if the idempotent generated subsemigroup E(S) of S is a union of groups.Using the fact that each 0-rectangular band B = (D a ∪ {0})/H (a ∈ S) of a finite E-solid semigroup is orthodox, we may extend the previous results from orthodox to E-solid semigroups [5,Theorem 1.3.5].
We can attempt to build an involution from a given permutation matching as follows.Consider the graph G(S) with vertices corresponding to the members of S and edges joining each pair of mutual inverses.Next suppose that S possesses a permutation matching φ and consider the subgraph of G(S) consisting of the vertices and edges of a permutation matching, which is a set of disjoint cycles.Any even cycle may then be split into mutually inverse pairs.On the other hand if an odd cycle contains an idempotent, e, we may pair e with itself and pair the remaining members of this odd cycle in mutually inverse pairs.It follows that if S has a permutation matching, but no involution matching, then every permutation matching of S must contain an odd cycle that is idempotent-free.
Suppose then that S is an example of a semigroup of minimum cardinality that has a matching but no involution matching.Then every principal factor D a ∪ {0} of S (or simply D a if D a is the minimum ideal of S) has a permutation matching, mapping D a onto itself.If each of these principal factors had an involution matching, then the union of these involution matchings on the D-classes D a would define an involution matching of S. Since we are assuming that no such involution matching exists, it follows that some principal factor has a permutation matching but no involution matching.Therefore by minimality of the cardinal of S, it follows that S is a completely 0-simple semigroup.(Every completely simple semigroup, being a union of groups, has an involution matching.)By Theorem 1.1(vi), we have that B = S/H also has a permutation matching.If S contained proper subgroups, it would follow by the minimality of the cardinal of S that B possessed an involution matching φ.However this would allow the construction of an involution matching φ on S as follows.
We identify the non-zero members of B with the H -classes H a of S. We then define aφ = a ′ , where a ′ is the unique inverse of a in H a φ.Then a ′ φ is the unique inverse of a ′ in H a ′ φ, and since H a ′ φ = H a , we infer that φ would indeed be an involution matching on S. Since this is a contradiction, we reach the conclusion that any minimal example S is a 0-rectangular band, thereby establishing the following fact.
Proposition 2.1 Suppose that S is a finite regular semigroup of minimum cardinality with the property that S possesses a permutation matching but no involution matching.Then S is a 0-rectangular band.
We thus are led to consider 0-rectangular bands S. Let the non-zero D-class of S have m rows and n columns, where without loss we may take m ≤ n.Indeed we also have m ≥ 2, as if m = 1 we have a right zero semigroup, which does have involution matchings.We are led to the question: Question 4. Does there exist a 0-rectangular band S that has a permutation matching but no involution matching?
We may prove that if this is the case then m cannot be a divsor of n, and so in particular our major D-class D of S cannot be square.In what follows we let R and C respectively stand for the set of m rows and n columns of D. Let us write n = am.Lemma 2.2 Suppose that S has a permutation matching φ.Then for any collection T of t rows of And for any collection Proof The t rows contain nt members.These are mapped by φ into s columns say, which collectively contain ms members.Hence nt ≤ ms and so Since the set on the left hand side of (1) contains the set of s columns, the inequality (1) now follows.
Similarly, any set of t columns (1 ≤ t ≤ n) is mapped by φ into s rows of D so that the t columns collectively contain mt members.Hence mt ≤ ns and so and then (2) follows.
Proposition 2.3 Let S be a 0-rectangular band with m rows and n = am (a ≥ 1) columns in its non-zero D-class.If S has a permutation matching φ, then S has an involution matching.
Proof Consider the bipartite graph G with vertex set R ∪ C, the disjoint union of the respective sets of rows and columns of D, with an edge connecting a row and a column if that row and column intersect in an idempotent.Note in particular that if aφ = b, then an edge connects R a to L b (and R b to L a ).
From ( 1) and ( 2) we see that any set of t rows of R is collectively adjacent to at least at columns of C in D, and any set of t columns is collectively adjacent to at least t a rows of D. By Hall's harem theorem, (see Section III.3 of [1]) there exists a injective functions, π 0 , π 1 , • • • , π a−1 from R into C with pairwise disjoint ranges, whose union is C. We label the columns in the range of π t as tm, tm We may then define an involution matching on D as follows.Let (i, j) ∈ D with j = tm + r, where 0 ≤ r ≤ m − 1.We define ), so that π defines an involution on D (which extends to S by putting 0π = 0).Moreover, by definition of adjacency in G we have that (i, iπ t ) ∈ E(D), and also (jπ −1 t , j) ∈ E(D) as jπ −1 t π t = j.Hence (i, j) (i, j)π (i, j) = (i, j)(jπ −1 t , iπ t )(i, j) = (i, iπ t )(i, j) = (i, j), (jπ −1 t , iπ t )(i, j)(jπ −1 t , iπ t ) = (jπ −1 t , j)(jπ −1 t , iπ t ) = (jπ −1 t , iπ t ), thereby verifying that (i, j) and (i, j)π are mutual inverses in D. Therefore π is indeed an involution matching of S.
There have been lively exchanges on a problem related to ours, some of which have been recorded on Mathoverflow [9].The conversation was initiated by Fedya Petrov who explains that our question, (matching implies involution matching), would be settled in the affirmative if the same were true of the following purely combinatorial problem.
A set of m girls (corresponding to rows) have mn balls so that each girl has n balls.There are m balls of each of n colours (the colours corresponding to columns).Two girls may exchange the balls (1 ball for 1 ball, so each girl still has n balls), but no ball may participate in more than one exchange.The goal is to achieve a situation where each girl has balls of all n colours (and so exactly one of each colour).This question we shall call this the Colour alignment problem.
The participants in the discussion then claim proofs of results that subsume Proposition 2.3 in that the problem may be solved if n ≡ 0, ±1, ±2 (mod m).However, at the time of writing, the general question remains open.Proof Suppose that the Colour alignment problem may always be solved.(The exchanges may include vacuous exchanges where a girl exchanges a ball with itself; in this way we may claim that in our solution every ball is exchanged exactly once.)Let S be an m × n 0-rectangular band with a permutation matching φ.We shall denote typical rows and columns of D respectively as i and j.In this way an entry of D may be written as (i, j) or simply denoted by a single symbol x, y etc.In this latter case, if x = (i, j), we write x 1 = i and x 2 = j.In view of this, in what follows, notation is less cluttered by writing mappings on the left.
Let the first co-ordinates be enumerated by the set of m girls and the second coordinates by the n colours.To girl a we assign the balls of colour φ(a, α) 2 (1 ≤ α ≤ n).This assigns n balls to each girl.Moreover, since φ is bijective, one ball is assigned for each entry of the array D. In particular there are exactly m balls of each colour.
We construct our involution matching Φ on D as follows.Suppose that there is an exchange between girl a and the ball corresponding to φ(a, α) 2 , with girl b and the ball corresponding to φ(b, β) 2 .We then put This is a well-defined function, for if not there would be an equality of the form φ(b, β) 2 = φ(b ′ , β ′ ) 2 , with girl a and the ball corresponding to φ(a, α ′ ) 2 say, exchanged with girl b ′ and ball φ(b ′ , β ′ ) 2 .But then, since φ(b, β) 2 = φ(b ′ , β ′ ) 2 represents equality of colours, girl a would finish with two balls of this one colour, which would contradict our assumption that each girl ends with exactly one ball of each colour.Hence Φ is a function.Moreover, by the definition (4), Φ(b, φ(a, α) 2 ) = (a, φ(b, β) 2 ), so that Φ is an involution.Next we check that the domain of Φ is the complete array, D.
For any girl a and ball φ(a, α) 2 held by girl a, there is an exchange with some girl b and ball φ(b, β) 2 held by girl b, yielding the point (a, φ(b, β) 2 ) as a member of dom(Φ).By the argument of the previous paragraph, these n points are pairwise distinct, and so represent the complete row of D defined by a.It follows that dom(Φ) contains all mn points of D, whence Φ is a well-defined involution on D.

Theorem 1 . 1 [ 3 ,
Theorem 1.6]For a finite regular semigroup S the following are equivalent: (i) S has a permutation matching; (ii) S is a transversal of {V (a)} a∈S ; (iii) |A| ≤ |V (A)| for all A ⊆ S; (iv) S has a permutation matching (• ′ ) that preserves the H -relation; (meaning that a H b → a ′ H b ′ ); (v) each principal factor D a ∪ {0} (a ∈ S) has a permutation matching; (vi) each 0-rectangular band (D a ∪ {0})/H has a permutation matching.

Theorem 2 . 4
(F. Petrov, private communication) A positive solution of the Colour alignment problem implies a positive solution of the involution matching problem.