Abstract
The rank of a finite semigroup is the smallest number of elements required to generate the semigroup. A formula is given for the rank of an arbitrary (not necessarily regular) Rees matrix semigroup over a group. The formula is expressed in terms of the dimensions of the structure matrix, and the relative rank of a certain subset of the structure group obtained from subgroups generated by entries in the structure matrix, which is assumed to be in Graham normal form. This formula is then applied to answer questions about minimal generating sets of certain natural families of transformation semigroups. In particular, the problem of determining the maximum rank of a subsemigroup of the full transformation monoid (and of the symmetric inverse semigroup) is considered.
Similar content being viewed by others
References
Araújo, J., Schneider, C.: The rank of the endomorphism monoid of a uniform partition. Semigroup Forum 78(3), 498–510 (2009). doi:10.1007/s00233-008-9122-0
Brittenham, M., Margolis, S.W., Meakin, J.: Subgroups of the free idempotent generated semigroups need not be free. J. Algebra 321(10), 3026–3042 (2009). doi:10.1016/j.jalgebra.2008.12.017
Cameron, P.J.: Dixon’s theorem and random synchronization. Discrete Math. 313(11), 1233–1236 (2013). doi:10.1016/j.disc.2012.06.002
Cameron, P.J., Solomon, R., Turull, A.: Chains of subgroups in symmetric groups. J. Algebra 127(2), 340–352 (1989)
Dixon, J.D.: The probability of generating the symmetric group. Math. Z. 110, 199–205 (1969)
Dolinka, I., Gray, R.: Maximal subgroups of free idempotent generated semigroups over the full linear monoid. Trans. Am. Math. Soc. (to appear). doi:10.1090/S0002-9947-2013-05864-3
Doyen, J.: Équipotence et unicité de systèmes générateurs minimaux dans certains monoïdes. Semigroup Forum 28(1–3), 341–346 (1984). doi:10.1007/BF02572494
Doyen, J.: Quelques propriétés des systèmes générateurs minimaux des monoïdes. Semigroup Forum 42(3), 333–343 (1991). doi:10.1007/BF02573429
Easdown, D., Sapir, M.V., Volkov, M.V.: Periodic elements of the free idempotent generated semigroup on a biordered set. Int. J. Algebra Comput. 20(2), 189–194 (2010). doi:10.1142/S0218196710005583
East, J.: Presentations for singular subsemigroups of the partial transformation semigroup. Int. J. Algebra Comput. 20(1), 1–25 (2010). doi:10.1142/S0218196710005509
East, J.: On the singular part of the partition monoid. Int. J. Algebra Comput. 21(1–2), 147–178 (2011). doi:10.1142/S021819671100611X
Fernandes, V.H., Quinteiro, T.M.: On the monoids of transformations that preserve the order and a uniform partition. Commun. Algebra 39(8), 2798–2815 (2011). doi:10.1080/00927872.2010.492043
Fernandes, V.H., Gomes, G.M.S., Jesus, M.M.: Congruences on monoids of transformations preserving the orientation of a finite chain. J. Algebra 321(3), 743–757 (2009). doi:10.1016/j.jalgebra.2008.11.005
Garba, G.U.: Idempotents in partial transformation semigroups. Proc. R. Soc. Edinb. A 116(3–4), 359–366 (1990)
Gomes, G.M.S., Howie, J.M.: On the ranks of certain finite semigroups of transformations. Math. Proc. Camb. Philos. Soc. 101(3), 395–403 (1987)
Gomes, G.M.S., Howie, J.M.: On the ranks of certain semigroups of order-preserving transformations. Semigroup Forum 45(3), 272–282 (1992)
Graham, R.L.: On finite 0-simple semigroups and graph theory. Math. Syst. Theory 2, 325–339 (1968)
Graham, N., Graham, R., Rhodes, J.: Maximal subsemigroups of finite semigroups. J. Comb. Theory 4, 203–209 (1968)
Graham, R.L., Grötschel, M., Lovász, L. (eds.): Handbook of Combinatorics, vols. 1, 2. Elsevier, Amsterdam (1995)
Gray, R.: A graph theoretic approach to combinatorial problems in semigroup theory. PhD Thesis, University of St. Andrews (2005)
Gray, R.: Hall’s condition and idempotent rank of ideals of endomorphism monoids. Proc. Edinb. Math. Soc. (2) 51(1), 57–72 (2008). doi:10.1017/S0013091504001397
Gray, R., Ruškuc, N.: Generating sets of completely 0-simple semigroups. Commun. Algebra 33(12), 4657–4678 (2005). doi:10.1080/00927870500276676
Gray, R., Ruškuc, N.: Maximal subgroups of free idempotent-generated semigroups over the full transformation monoid. Proc. Lond. Math. Soc. (3) 104(5), 997–1018 (2012). doi:10.1112/plms/pdr054
Gray, R., Ruskuc, N.: On maximal subgroups of free idempotent generated semigroups. Isr. J. Math. 189, 147–176 (2012). doi:10.1007/s11856-011-0154-x
Houghton, C.H.: Completely 0-simple semigroups and their associated graphs and groups. Semigroup Forum 14(1), 41–67 (1977)
Howie, J.M.: Idempotent generators in finite full transformation semigroups. Proc. R. Soc. Edinb. A 81(3–4), 317–323 (1978)
Howie, J.M.: Idempotents in completely 0-simple semigroups. Glasg. Math. J. 19(2), 109–113 (1978)
Howie, J.M.: Fundamentals of Semigroup Theory. L.M.S. Monographs, vol. 7. Academic Press [Harcourt Brace Jovanovich Publishers], London (1995)
Howie, J.M., McFadden, R.B.: Idempotent rank in finite full transformation semigroups. Proc. R. Soc. Edinb. A 114(3–4), 161–167 (1990)
Jaikin-Zapirain, A., Pyber, L.: Random generation of finite and profinite groups and group enumeration. Ann. Math. (2) 173(2), 769–814 (2011). doi:10.4007/annals.2011.173.2.4
Jerrum, M.: A compact representation for permutation groups. In: 23rd Annual Symposium on Foundations of Computer Science, Chicago, IL, 1982, pp. 126–133. IEEE Press, New York (1982)
Kantor, W.M., Lubotzky, A.: The probability of generating a finite classical group. Geom. Dedic. 36(1), 67–87 (1990). doi:10.1007/BF00181465
Levi, I., Seif, S.: Combinatorial techniques for determining rank and idempotent rank of certain finite semigroups. Proc. Edinb. Math. Soc. (2) 45(3), 617–630 (2002)
Levi, I., Seif, S.: Constructive techniques for labeling constant weight Gray codes with applications to minimal generating sets of semigroups. J. Algebra 266(1), 189–219 (2003)
Levi, I., Seif, S.: Counting techniques to label constant weight Gray codes with links to minimal generating sets of semigroups. J. Algebra 266(1), 220–238 (2003)
Liebeck, M.W., Shalev, A.: The probability of generating a finite simple group. Geom. Dedic. 56(1), 103–113 (1995). doi:10.1007/BF01263616
McIver, A., Neumann, P.M.: Enumerating finite groups. Q. J. Math. Oxf. Ser. (2) 38(152), 473–488 (1987). doi:10.1093/qmath/38.4.473
Rhodes, J., Steinberg, B.: The q-Theory of Finite Semigroups. Springer Monographs in Mathematics. Springer, New York (2009)
Rhodes, J., Tilson, B.R.: Improved lower bounds for the complexity of finite semigroups. J. Pure Appl. Algebra 2, 13–71 (1972)
Serre, J.-P.: Trees. Springer Monographs in Mathematics. Springer, Berlin (2003). Translated from the French original by John Stillwell, Corrected 2nd printing of the 1980 English translation
Zhao, P.: On the ranks of certain semigroups of orientation preserving transformations. Commun. Algebra 39(11), 4195–4205 (2011). doi:10.1080/00927872.2010.521933
Acknowledgements
Some of the results given here appear first appeared in the PhD thesis of the author [20].
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Jean-Eric Pin.
Dedicated to the memory of John M. Howie.
Rights and permissions
About this article
Cite this article
Gray, R.D. The minimal number of generators of a finite semigroup. Semigroup Forum 89, 135–154 (2014). https://doi.org/10.1007/s00233-013-9521-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00233-013-9521-8