Primitive permutation groups and strongly factorizable transformation semigroups (Q2204849)

A semigroup \(S\) with the set of idempotents \(E\) and group of units \(G\) is said to be \textit{strongly factorizable} if \(S=EG\). Denote by \(S_n\) and \(T_n\) the symmetric group and the full transformation semigroup on a set of \(n\) elements, respectively. Let \(G\leq S_n\) be a group and \(t\in T_n\). Conditions for \(\langle G,t \rangle\) to be strongly factorizable are found for different \(n\) and ranks \(k\) of \(t\). For example, for \(n\geq 5\), \(\langle G,t \rangle\) is strongly factorizable for all rank \(5\) transformations \(t\) if and only if \(G\) is 5-transitive or \(G=A_6\). It is also proved that if \(S\leq T_n\) is a transformation monoid and \(G\) is the normalizer of \(S\) in \(S_n\) then the semigroup \(SG\) is regular (completely regular) if and only if \(S\) is regular (completely regular). Moreover, if every element in \(SG\) has a \(k\)-th root, then so has every element in \(S\). The following general problem -- among other problems -- was raised: for an existential property \(P\) of semigroups, if \(SG\) satisfies \(P\), decide if \(S\) also satisfies \(P\).