On the Monoid of Unital Endomorphisms of a Boolean Ring

Let X be a nonempty set and P(X) the power set of X. The aim of this paper is to provide an explicit description of the monoid End1P(X)(P(X)) of unital ring endomorphisms of the Boolean ring P(X) and the automorphism group Aut(P(X)) when X is finite. Among other facts, it is shown that if X has cardinality n≥1, then End1P(X)(P(X))≅Tnop, where Tn is the full transformation monoid on the set X and Aut(P(X))≅Sn.

Centralising Monoids with Low-Arity Witnesses on a Four-Element Set

As part of a project to identify all maximal centralising monoids on a four-element set, we determine all centralising monoids witnessed by unary or by idempotent binary operations on a four-element set. Moreover, we show that every centralising monoid on a set with at least four elements witnessed by the Maľcev operation of a Boolean group operation is always a maximal centralising monoid, i.e., a co-atom below the full transformation monoid. On the other hand, we also prove that centralising monoids witnessed by certain types of permutations or retractive operations can never be maximal.

An extension of properties of symmetric group to monoids and a pretorsion theory in a category of mappings

Several elementary properties of the symmetric group [Formula: see text] extend in a nice way to the full transformation monoid [Formula: see text] of all maps of the set [Formula: see text] into itself. The group [Formula: see text] turns out to be the torsion part of the monoid [Formula: see text]. That is, there is a pretorsion theory in the category of all maps [Formula: see text], [Formula: see text] an arbitrary finite set, in which bijections are exactly the torsion objects.

On the length of uncompletable words in unambiguous automata

This paper deals with uncomplete unambiguous automata. In this setting, we investigate the minimal length of uncompletable words. This problem is connected with a well-known conjecture formulated by A. Restivo. We introduce the notion of relatively maximal row for a suitable monoid of matrices. We show that, if M is a monoid of {0, 1}-matrices of dimension n generated by a set S, then there is a matrix of M containing a relatively maximal row which can be expressed as a product of O(n3) matrices of S. As an application, we derive some upper bound to the minimal length of an uncompletable word of an uncomplete unambiguous automaton, in the case that its transformation monoid contains a relatively maximal row which is not maximal. Finally we introduce the maximal row automaton associated with an unambiguous automaton A. It is a deterministic automaton, which is complete if and only if A is. We prove that the minimal length of the uncompletable words of A is polynomially bounded by the number of states of A and the minimal length of the uncompletable words of the associated maximal row automaton.

v*-ALGEBRAS, INDEPENDENCE ALGEBRAS AND LOGIC

Independence algebras were introduced in the early 1990s by specialists in semigroup theory, as a tool to explain similarities between the transformation monoid on a set and the endomorphism monoid of a vector space. It turned out that these algebras had already been defined and studied in the 1960s, under the name of v*-algebras, by specialists in universal algebra (and statistics). Our goal is to complete this picture by discussing how, during the middle period, independence algebras began to play a very important role in logic.