Results 1  10
of
12
Braids and Factorizable Inverse Monoids
"... What is the untangling effect on a braid if one is allowed to snip a string, or if two specified strings are allowed to pass through each other, or even allowed to merge and part as newly reconstituted strings? To calculate the effects, one works in an appropriate factorizable inverse monoid, some a ..."
Abstract
 Add to MetaCart
What is the untangling effect on a braid if one is allowed to snip a string, or if two specified strings are allowed to pass through each other, or even allowed to merge and part as newly reconstituted strings? To calculate the effects, one works in an appropriate factorizable inverse monoid, some
Some classes of factorizable semigroups∗
"... [Almost] factorizable inverse monoids [semigroups] play an important rule in the theory of inverse semigroups (see for example [2]). The notion of “factorizable ” and “almost factorizable ” coincides for inverse monoids. A couple of crucial results for inverse semigroups S are the following: a) S i ..."
Abstract
 Add to MetaCart
[Almost] factorizable inverse monoids [semigroups] play an important rule in the theory of inverse semigroups (see for example [2]). The notion of “factorizable ” and “almost factorizable ” coincides for inverse monoids. A couple of crucial results for inverse semigroups S are the following: a
On presentations of Brauertype monoids
 CENT. EUR. J. MATH
, 2005
"... We obtain presentations for the Brauer monoid, the partial analogue of the Brauer monoid, and for the greatest factorizable inverse submonoid of the dual symmetric inverse monoid. In all three cases we apply the same approach, based on the realization of all these monoids as Brauertype monoids. ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
We obtain presentations for the Brauer monoid, the partial analogue of the Brauer monoid, and for the greatest factorizable inverse submonoid of the dual symmetric inverse monoid. In all three cases we apply the same approach, based on the realization of all these monoids as Brauertype monoids.
Cofull Embeddings in Coset Monoids
, 2005
"... Easdown, East and FitzGerald (2004) gave a sucient condition for a (factorizable inverse) monoid to embed as a cofull submonoid of the coset monoid of its group of units. We show that this condition is also necessary. This yields a simple description of the class of nite monoids which embed in the c ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Easdown, East and FitzGerald (2004) gave a sucient condition for a (factorizable inverse) monoid to embed as a cofull submonoid of the coset monoid of its group of units. We show that this condition is also necessary. This yields a simple description of the class of nite monoids which embed
unknown title
"... It is well known that the rpp semigroups are generalized regular semigroups. In order to further investigate the structure of rpp semigroups, we introduce the type(I,L∗) factorizable monoids. In this paper, we study such factorizable rpp monoids admitting a left univocal type(I,L∗) factorization ..."
Abstract
 Add to MetaCart
It is well known that the rpp semigroups are generalized regular semigroups. In order to further investigate the structure of rpp semigroups, we introduce the type(I,L∗) factorizable monoids. In this paper, we study such factorizable rpp monoids admitting a left univocal type
Partial mirror symmetry II: generators and relations
"... Abstract. We continue our development of the theory of reflection monoids by first deriving a presentation for a general reflection monoid from a result of Easdown, East and Fitzgerald for factorizable inverse monoids. We then derive “Popova ” style presentations for reflection monoids built from Bo ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. We continue our development of the theory of reflection monoids by first deriving a presentation for a general reflection monoid from a result of Easdown, East and Fitzgerald for factorizable inverse monoids. We then derive “Popova ” style presentations for reflection monoids built from
The Hopf algebra of uniform block permutations
 J. Algebraic Combinatorics
"... Abstract. We introduce the Hopf algebra of uniform block permutations and show that it is selfdual, free, and cofree. These results are closely related to the fact that uniform block permutations form a factorizable inverse monoid. This Hopf algebra contains the Hopf algebra of permutations of Malv ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Abstract. We introduce the Hopf algebra of uniform block permutations and show that it is selfdual, free, and cofree. These results are closely related to the fact that uniform block permutations form a factorizable inverse monoid. This Hopf algebra contains the Hopf algebra of permutations
SIMPLE MODULES OVER FACTORPOWERS
"... Abstract. In this paper we study complex representations of the factorpower FP + (G, M) of a finite group G acting on a finite set M. This includes the finite monoid FP + (Sn), which can be seen as a kind of a “balanced ” generalization of the symmetric group Sn inside the semigroup of all binary re ..."
Abstract
 Add to MetaCart
Abstract. In this paper we study complex representations of the factorpower FP + (G, M) of a finite group G acting on a finite set M. This includes the finite monoid FP + (Sn), which can be seen as a kind of a “balanced ” generalization of the symmetric group Sn inside the semigroup of all binary
THE HOPF ALGEBRA OF UNIFORM BLOCK PERMUTATIONS. EXTENDED ABSTRACT
, 2004
"... Abstract. We introduce the Hopf algebra of uniform block permutations and show that it is selfdual, free, and cofree. These results are closely related to the fact that uniform block permutations form a factorizable inverse monoid. This Hopf algebra contains the Hopf algebra of permutations of Malv ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We introduce the Hopf algebra of uniform block permutations and show that it is selfdual, free, and cofree. These results are closely related to the fact that uniform block permutations form a factorizable inverse monoid. This Hopf algebra contains the Hopf algebra of permutations
Almost perfect restriction semigroups
, 2014
"... We call a restriction semigroup almost perfect if it is proper and its least monoid congruence is perfect. We show that any such semigroup is isomorphic to a ‘Wproduct ’ W (T, Y), where T is a monoid, Y is a semilattice and there is a homomorphism from T into the inverse semigroup TIY of isomorphi ..."
Abstract
 Add to MetaCart
We call a restriction semigroup almost perfect if it is proper and its least monoid congruence is perfect. We show that any such semigroup is isomorphic to a ‘Wproduct ’ W (T, Y), where T is a monoid, Y is a semilattice and there is a homomorphism from T into the inverse semigroup TIY
Results 1  10
of
12