Generation of infinite factorizable inverse monoids.
From MaRDI portal
Publication:444663
DOI10.1007/s00233-011-9339-1zbMath1254.20045OpenAlexW2014826388MaRDI QIDQ444663
Publication date: 16 August 2012
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00233-011-9339-1
idempotentsgeneratorsgenerating setsBergman propertydual symmetric inverse monoidsfactorizable inverse monoidsfactorizable parts of symmetric inverse monoidsrelative ranks
Related Items
Generating infinite monoids of cellular automata ⋮ Idempotents and one-sided units: lattice invariants and a semigroup of functors on the category of monoids ⋮ An extension to ``A subsemigroup of the rook monoid ⋮ Infinite dual symmetric inverse monoids ⋮ John Macintosh Howie: work and legacy ⋮ Unnamed Item ⋮ Sets of universal sequences for the symmetric group and analogous semigroups ⋮ Idempotents and one-sided units in infinite partial Brauer monoids ⋮ Infinite partition monoids
Cites Work
- Generators and relations for partition monoids and algebras.
- Factorizable transformation semigroups
- Factorizable inverse monoids.
- Embedding inverse semigroups in coset semigroups
- Factorizable inverse semigroups
- Partial symmetry, reflection monoids and Coxeter groups.
- Braids and partial permutations.
- THE FACTORIZABLE BRAID MONOID
- A PRESENTATION OF THE DUAL SYMMETRIC INVERSE MONOID
- On a Class of Factorizable Inverse Monoids Associated with Braid Groups
- EMBEDDINGS IN COSET MONOIDS
- BRAIDS AND FACTORIZABLE INVERSE MONOIDS
- On relative ranks of full transformation semigroups
- COUNTABLE VERSUS UNCOUNTABLE RANKS IN INFINITE SEMIGROUPS OF TRANSFORMATIONS AND RELATIONS
- A presentation for the monoid of uniform block permutations
- Generating Countable Sets of Permutations
- ON A NEW APPROACH TO THE DUAL SYMMETRIC INVERSE MONOID $\mathcal{I}_{X}^{\ast}$
- The Bergman property for semigroups
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
