<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Cicalò, Serena</style></author><author><style face="normal" font="default" size="100%">Fernandes, Vítor H.</style></author><author><style face="normal" font="default" size="100%">Schneider, Csaba</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Partial transformation monoids preserving a uniform partition</style></title><secondary-title><style face="normal" font="default" size="100%">Semigroup Forum (DOI 10.1007/s00233-014-9629-5)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2015</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://link.springer.com/article/10.1007/s00233-014-9629-5</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">90</style></volume><pages><style face="normal" font="default" size="100%">532-544</style></pages><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The objective of this paper is to study the monoid of all partial&lt;br /&gt;
transformations of a finite set that preserve a uniform partition. In addition&lt;br /&gt;
to proving that this monoid is a quotient of a wreath product with respect to a&lt;br /&gt;
congruence relation, we show that it is generated by 5 generators, we compute&lt;br /&gt;
its order and determine a presentation on a minimal generating set.&lt;/p&gt;
</style></abstract><issue><style face="normal" font="default" size="100%">2</style></issue></record></records></xml>