arXiv:1211.6284 [math.GR]AbstractReferencesReviewsResources
Sierpiński rank of the Symmetric inverse semigroup
Published 2012-11-27Version 1
We show that every countable set of partial bijections from an infinite set to itself can be obtained as a composition of just two such partial bijections. This strengthens a result by Higgins, Howie, Mitchell and Ru\v{s}kuc stating that every such countable set of partial bijections may be obtained as the composition of two partial bijections and their inverses.
Related articles: Most relevant | Search more
arXiv:math/0001035 [math.GR] (Published 2000-01-06)
Knuth-Bendix for groups with infinitely many rules
Highly Transitive Actions of Out(Fn)
arXiv:1012.1653 [math.GR] (Published 2010-12-08)
Algorithmically finite groups