28 research outputs found
Infinite partition monoids
Let and be the partition monoid and symmetric
group on an infinite set . We show that may be generated by
together with two (but no fewer) additional partitions, and we
classify the pairs for which is
generated by . We also show that may be generated by the set of all idempotent partitions
together with two (but no fewer) additional partitions. In fact,
is generated by if and only if it is
generated by . We also
classify the pairs for which is
generated by . Among other results, we show
that any countable subset of is contained in a -generated
subsemigroup of , and that the length function on
is bounded with respect to any generating set
Enumeration of idempotents in planar diagram monoids
We classify and enumerate the idempotents in several planar diagram monoids:
namely, the Motzkin, Jones (a.k.a. Temperley-Lieb) and Kauffman monoids. The
classification is in terms of certain vertex- and edge-coloured graphs
associated to Motzkin diagrams. The enumeration is necessarily algorithmic in
nature, and is based on parameters associated to cycle components of these
graphs. We compare our algorithms to existing algorithms for enumerating
idempotents in arbitrary (regular *-) semigroups, and give several tables of
calculated values.Comment: Majorly revised (new title, new abstract, one additional author), 24
pages, 6 figures, 8 tables, 5 algorithm
Variants of finite full transformation semigroups
The variant of a semigroup S with respect to an element a in S, denoted S^a,
is the semigroup with underlying set S and operation * defined by x*y=xay for
x,y in S. In this article, we study variants T_X^a of the full transformation
semigroup T_X on a finite set X. We explore the structure of T_X^a as well as
its subsemigroups Reg(T_X^a) (consisting of all regular elements) and E_X^a
(consisting of all products of idempotents), and the ideals of Reg(T_X^a).
Among other results, we calculate the rank and idempotent rank (if applicable)
of each semigroup, and (where possible) the number of (idempotent) generating
sets of the minimal possible size.Comment: 25 pages, 6 figures, 1 table - v2 includes a couple more references -
v3 changes according to referee comments (to appear in IJAC
A presentation for a submonoid of the symmetric inverse monoid
A fully invarient congruence relations on the free algebra on a given type
induces a variety of the given type. In contrast, a congruence relation of the
free algebra provides algebra of that type. This algebra is given by a
so-called presentation. In the present paper, we deal with an important class
of algebras of type , namely with semigroups of transformations on a
finite set. Here, we are particularly interested in a presentation of a
submonoid of the symmetric inverse monoid . Our main result is a
presentations for , the monoid of all order-preserving,
fence-preserving, and parity-preserving transformations on an -element set.Comment: 19 page