{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T18:34:43Z","timestamp":1778178883488,"version":"3.51.4"},"reference-count":29,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2015,7,6]],"date-time":"2015-07-06T00:00:00Z","timestamp":1436140800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Proc. Camb. Phil. Soc."],"published-print":{"date-parts":[[2015,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Let <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S0305004115000389_inline1\"\/><jats:tex-math>$\\mathcal{P}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> be a partition of a finite set <jats:italic>X<\/jats:italic>. We say that a transformation <jats:italic>f<\/jats:italic> : <jats:italic>X<\/jats:italic> \u2192 <jats:italic>X<\/jats:italic> preserves (or stabilises) the partition <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S0305004115000389_inline1\"\/><jats:tex-math>$\\mathcal{P}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> if for all <jats:italic>P<\/jats:italic> \u2208 <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S0305004115000389_inline1\"\/><jats:tex-math>$\\mathcal{P}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> there exists <jats:italic>Q<\/jats:italic> \u2208 <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S0305004115000389_inline1\"\/><jats:tex-math>$\\mathcal{P}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> such that <jats:italic>Pf<\/jats:italic> \u2286 <jats:italic>Q<\/jats:italic>. Let <jats:italic>T<\/jats:italic>(<jats:italic>X<\/jats:italic>, <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S0305004115000389_inline1\"\/><jats:tex-math>$\\mathcal{P}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>) denote the semigroup of all full transformations of <jats:italic>X<\/jats:italic> that preserve the partition <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S0305004115000389_inline1\"\/><jats:tex-math>$\\mathcal{P}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>.<\/jats:p><jats:p>In 2005 Pei Huisheng found an upper bound for the minimum size of the generating sets of <jats:italic>T<\/jats:italic>(<jats:italic>X<\/jats:italic>, <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S0305004115000389_inline1\"\/><jats:tex-math>$\\mathcal{P}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>), when <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S0305004115000389_inline1\"\/><jats:tex-math>$\\mathcal{P}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> is a partition in which all of its parts have the same size. In addition, Pei Huisheng conjectured that his bound was exact. In 2009 the first and last authors used representation theory to solve Pei Huisheng's conjecture.<\/jats:p><jats:p>The aim of this paper is to solve the more complex problem of finding the minimum size of the generating sets of <jats:italic>T<\/jats:italic>(<jats:italic>X<\/jats:italic>, <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S0305004115000389_inline1\"\/><jats:tex-math>$\\mathcal{P}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>), when <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S0305004115000389_inline1\"\/><jats:tex-math>$\\mathcal{P}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> is an arbitrary partition. Again we use representation theory to find the minimum number of elements needed to generate the wreath product of finitely many symmetric groups, and then use this result to solve the problem.<\/jats:p><jats:p>The paper ends with a number of problems for experts in group and semigroup theories.<\/jats:p>","DOI":"10.1017\/s0305004115000389","type":"journal-article","created":{"date-parts":[[2015,7,6]],"date-time":"2015-07-06T06:27:01Z","timestamp":1436164021000},"page":"339-353","source":"Crossref","is-referenced-by-count":25,"title":["The rank of the semigroup of transformations stabilising a partition of a finite set"],"prefix":"10.1017","volume":"159","author":[{"given":"JO\u00c3O","family":"ARA\u00daJO","sequence":"first","affiliation":[]},{"given":"WOLFRAM","family":"BENTZ","sequence":"additional","affiliation":[]},{"given":"JAMES D.","family":"MITCHELL","sequence":"additional","affiliation":[]},{"given":"CSABA","family":"SCHNEIDER","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2015,7,6]]},"reference":[{"key":"S0305004115000389_ref28","doi-asserted-by":"publisher","DOI":"10.4064\/fm-24-1-209-212"},{"key":"S0305004115000389_ref19","doi-asserted-by":"publisher","DOI":"10.1080\/00927879808826160"},{"key":"S0305004115000389_ref14","doi-asserted-by":"publisher","DOI":"10.1017\/S0013091502000974"},{"key":"S0305004115000389_ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0013108"},{"key":"S0305004115000389_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00233-004-0142-0"},{"key":"S0305004115000389_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s00233-008-9122-0"},{"key":"S0305004115000389_ref17","volume-title":"London Math. Soc. Monogr. New Series","author":"Howie","year":"1995"},{"key":"S0305004115000389_ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s00233-005-0538-5"},{"key":"S0305004115000389_ref27","first-page":"319","volume-title":"The Santa Cruz Conference on Finite Groups (Univ. California, Santa Cruz, Calif., 1979)","author":"Scott","year":"1980"},{"key":"S0305004115000389_ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s00233-004-0135-z"},{"key":"S0305004115000389_ref12","doi-asserted-by":"publisher","DOI":"10.1017\/S0017089500030482"},{"key":"S0305004115000389_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF03025769"},{"key":"S0305004115000389_ref24","volume-title":"Wreath products of groups and semigroups","author":"Meldrum","year":"1995"},{"key":"S0305004115000389_ref25","unstructured":"J. D. Mitchell et al. Semigroups - GAP package, Version 2.4.1. May 2015. http:\/\/www-groups.mcs.st-andrews.ac.uk\/~jamesm\/semigroups.php"},{"key":"S0305004115000389_ref21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511629235"},{"key":"S0305004115000389_ref9","doi-asserted-by":"publisher","DOI":"10.1081\/AGB-120018506"},{"key":"S0305004115000389_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s00233-010-9274-6"},{"key":"S0305004115000389_ref3","doi-asserted-by":"publisher","DOI":"10.1081\/AGB-120029913"},{"key":"S0305004115000389_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-8693(03)00499-X"},{"key":"S0305004115000389_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s00605-006-0433-5"},{"key":"S0305004115000389_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s00012-003-1809-1"},{"key":"S0305004115000389_ref8","doi-asserted-by":"publisher","DOI":"10.4064\/fm-25-1-5-6"},{"key":"S0305004115000389_ref11","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-06-04026-8"},{"key":"S0305004115000389_ref15","doi-asserted-by":"publisher","DOI":"10.1112\/S0024609305018138"},{"key":"S0305004115000389_ref16","doi-asserted-by":"publisher","DOI":"10.1017\/S0308210500027360"},{"key":"S0305004115000389_ref18","doi-asserted-by":"publisher","DOI":"10.1017\/S0308210500024355"},{"key":"S0305004115000389_ref23","doi-asserted-by":"publisher","DOI":"10.1017\/S0013091501000530"},{"key":"S0305004115000389_ref26","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1017\/S0013091500021192","article-title":"Rank properties in finite inverse semigroups","volume":"43","author":"Ribeiro","year":"2000","journal-title":"Proc. Edinburgh Math. Soc. (2)"},{"key":"S0305004115000389_ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s00153-012-0276-9"}],"container-title":["Mathematical Proceedings of the Cambridge Philosophical Society"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0305004115000389","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T19:39:57Z","timestamp":1555789197000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0305004115000389\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,6]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["S0305004115000389"],"URL":"https:\/\/doi.org\/10.1017\/s0305004115000389","relation":{},"ISSN":["0305-0041","1469-8064"],"issn-type":[{"value":"0305-0041","type":"print"},{"value":"1469-8064","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,6]]}}}