Presentation for the Partial Dual Symmetric Inverse Monoid

We give a monoid presentation in terms of generators and define relations for the partial analogue of the finite dual symmetric inverse monoid.     

Brauer and Jones tied monoids

We introduce a ramified monoid, attached to each Brauer–type monoid, that is, to the symmetric group, to the Jones and Brauer monoids among others. Ramified monoids correspond to a class of tied monoids arising from knot theory and are interesting in themselves. The ramified monoid attached to the symmetric group is the Coxeter-like version of the so–called tied braid monoid. We give a presentation of the ramified monoid attached to the Brauer monoid. Also, we introduce and study two tied-like monoids that cannot be described as ramified monoids. However, these monoids can also be regarded as tied versions of the Jones and Brauer monoids.     

The Natural Embedding of Positive Singular Artin Monoids

We explore some combinatorial properties of singular Artin monoids and invoke them to prove that a positive singular Artin monoid of arbitrary Coxeter type necessarily injects into the corresponding singular Artin monoid. This is an extension of L. Pari' result that positive Artin monoids embed in the correpsonding Artin groups: Adjoining inverses of the generators does not produce any new identities between words that do not involve those inverses.     

On the score sheets of a round-robin football tournament

The set of (ordered) score sheets of a round-robin football tournament played between n teams together with the pointwise addition has the structure of an affine monoid. In this paper we study (using both theoretical and computational methods) the most important invariants of this monoid, namely the Hilbert basis, the multiplicity, the Hilbert series and the Hilbert function.     

The radical-annihilator monoid of a ring

Kuratowski’s closure-complement problem gives rise to a monoid generated by the closure and complement operations. Consideration of this monoid yielded an interesting classification of topological spaces, and subsequent decades saw further exploration using other set operations. This article is an exploration of a natural analogue in ring theory: a monoid produced by “radical” and “annihilator” maps on the set of ideals of a ring. We succeed in characterizing semiprime rings and commutative dual rings by their radical-annihilator monoids, and we determine the monoids for commutative local zero-dimensional (in the sense of Krull dimension) rings.     

Artin monoids inject in their groups

We prove that the natural homomorphism from an Artin monoid to its associated Artin group is always injective. Received: March 14, 2002     

Fundamental groups,inverse schützenberger automata,and monoid presentations

This paper gives decidable conditions for when a finitely generated subgroup of a free group is the fundamental group of a Schützenberger automaton corresponding to a monoid presentation of an inverse monoid. Also, generalizations are given to specific types of inverse monoids as well as to monoids which are "nearly inverse." This result has applications to computing membership for inverse monoids in a Mal'cev product of the pseudovariety of semilattices with a pseudovariety of groups.

This paper also shows that there is a bijection between strongly connected inverse automata and subgroups of a free group, generated by positive words. Hence, we also obtain that it is decidable whether a finite strongly connected inverse automaton is a Schützenberger automaton corresponding to a monoid presentation of an inverse monoid. Again, we have generalizations to other types of inverse monoids and to "nearly inverse" monoids. We show that it is undecidable whether a finite strongly connected inverse automaton is a Schützenberger automaton of a monoid presentation of anE-unitary inverse monoid.     

Centralisers in Surface Braid Groups

Abstract

Let Σ be an orientable surface. We generalise Fenn–Rolfsen–Zhu's results on centralisers of singular braids on the disk to singular braids on Σ. As a corollary, we derive a simple and geometric proof of the fact that the word problem is solvable in the monoid of singular braids on n strands on Σ.     

Essential variables in hypersubstitutions

For a variety V of algebras of type , we consider the set M _i (V) of all hypersubstitutions such that the variable x _i is essential in the term (f) with respect to the variety V. We will give a complete answer to the question for which varieties V of type = (n) the set M _i (v) of hypersubstitutions forms a monoid. This is important since to every monoid of hypersubstitutions there corresponds a complete sublattice of the lattice of all varieties of algebras of the given type. For varieties of semigroups we get the monoid of all leftmost and all rightmost hypersubstitutions. Received December 2, 1998; accepted in final form December 18, 2000.     

Absolute graphs with prescribed endomorphism monoid

We consider endomorphism monoids of graphs. It is well-known that any monoid can be represented as the endomorphism monoid M of some graph Γ with countably many colors. We give a new proof of this theorem such that the isomorphism between the endomorphism monoid $\mathop{\rm End}\nolimits (\Gamma)We consider endomorphism monoids of graphs. It is well-known that any monoid can be represented as the endomorphism monoid M of some graph Γ with countably many colors. We give a new proof of this theorem such that the isomorphism between the endomorphism monoid and M is absolute, i.e. holds in any generic extension of the given universe of set theory. This is true if and only if |M|,|Γ| are smaller than the first Erdős cardinal (which is known to be strongly inaccessible). We will encode Shelah’s absolutely rigid family of trees (Isr. J. Math. 42(3), 177–226, 1982) into Γ. The main result will be used to construct fields with prescribed absolute endomorphism monoids, see G?bel and Pokutta (Shelah’s absolutely rigid trees and absolutely rigid fields, in preparation). This work was supported by the project No. I-706-54.6/2001 of the German-Israeli Foundation for Scientific Research & Development and a fellowship within the Postdoc-Programme of the German Academic Exchange Service (DAAD).     

The Polycyclic Monoids P n and the Thompson Groups V n,1

We construct what we call the strong orthogonal completion C _n of the polycyclic monoid P _n on n generators. The inverse monoid C _n is congruence free and its group of units is the Thompson group V _n,1. Copies of C _n can be constructed from partitions of sets into n blocks each block having the same cardinality as the underlying set.     

The Congruence Lattice of Bruck–Reilly Extensions

We study the lattice. C(S) of congruences of a monoid S which is the Bruck-Reilly extension of a monoid T by a homomorphism . The inclusion, meet and join of congruences are described in terms of congruences and ideals of T. We show that C(S) can be naturally decomposed into three sublattices, corresponding (roughly speaking) to the three different types of congruences on such semigroups.1991 Mathematics Subject Classification: 20M10     

A generalized Goulden–Jackson cluster method and lattice path enumeration

The Goulden–Jackson cluster method is a powerful tool for obtaining generating functions counting words in a free monoid by occurrences of a set of subwords. We introduce a generalization of the cluster method for monoid networks, which generalize the combinatorial framework of free monoids. As a sample application of the generalized cluster method, we compute bivariate and multivariate generating functions counting Motzkin paths – both with height bounded and unbounded – by statistics corresponding to the number of occurrences of various subwords, yielding both closed-form and continued fraction formulas.     

Totally Ordered Monoids Based on Triangular Norms

A totally ordered monoid, or tomonoid for short, is a monoid together with a translation-invariant (i.e., compatible) total order. We consider in this paper tomonoids fulfilling the following conditions: the multiplication is commutative; the monoidal identity is the top element; all nonempty suprema exist; and the multiplication distributes over arbitrary suprema. The real unit interval endowed with its natural order and a left-continuous t-norm is our motivating example. A t-norm is a binary operation used in fuzzy logic for the interpretation of the conjunction.

Given a tomonoid of the indicated type, we consider the chain of its quotients induced by filters. The intention is to understand the tomonoid as the result of a linear construction process, leading from the coarsest quotient, which is the one-element tomonoid, up to the finest quotient, which is the tomonoid itself. Consecutive elements of this chain correspond to extensions by Archimedean tomonoids. If in this case the congruence classes are order-isomorphic to real intervals, a systematic specification turns out to be possible.

In order to deal with tomonoids and their quotients in an effective and transparent way, we follow an approach with a geometrical flavor: we work with transformation monoids, using the Cayley representation theorem. Our main results are formulated in this framework. Finally, a number of examples from the area of t-norms are included for illustration.     

Graphs and ranks of monoids

For a finite monoid S, let ν(S) (ν_d(S)) denote the least number n such that there exists a graph (directed graph) Γ of order n with End(Γ)?S. Also let rank(S) be the smallest number of elements required to generate S. In this paper, we use Cayley digraphs of monoids, to connect lower bounds of ν(S) (ν_d(S)) to the lower bounds of rank(S). On the other hand, we connect upper bounds of rank(S) to upper bounds of ν(S) (ν_d(S)).     

Presentations for Two Extensions of the Monoid of Order-Preserving Mappings on a Finite Chain

The purpose of this paper is to give presentations for the monoids of orientation-preserving mappings on a finite chain of order n, and orientation-preserving or reversing mappings on such a chain. Both these monoids are natural extensions of the monoid of order-preserving mappings. The obtained presentations are on two and three generators, respectively, and have n + 2 and n + 6 relations, respectively.AMS Subject Classification (1991): 20M05 20M20 06A05     

C(P)系对幺半群的刻画

设S是幺半群.本文介绍并研究了正则右系的一个推广.一个右S-系A称为C(P)系,如果A的所有循环子系满足条件(P).本文证明了右C(P)系形成了右S-系的一个新的类,同时,C(P)性质为幺半群同调分类研究提供了新思路.     

A poset connected to Artin monoids of simply laced type

Let W be a Weyl group whose type is a simply laced Dynkin diagram. On several W-orbits of sets of mutually commuting reflections, a poset is described which plays a role in linear representations of the corresponding Artin group A. The poset generalizes many properties of the usual order on positive roots of W given by height. In this paper, a linear representation of the positive monoid of A is defined by use of the poset.