Endomorphism monoids of acts over monoids

In this paper we investigate under which conditions a monoid R is defined by the endomorphism monoid of an act over R. More precisely, we ask when an isomorphism between two such endomorphism monoids over monoids R₁ and R₂ is induced by a semilinear isomorphism. The question is considered also for ordered and for topological monoids. On the way we characterize monoids over which all projective acts are free. An abstract of this paper appeared in the Proceedings of the Conference on Semigroups, Szeged 1972.     

Graph monoids

A graph semigroup refers to a monoid whose defining relations are of the form x_ix_j=x_jx_i. We describe the centralizer of an arbitrary element of a graph semigroup, show that there exists a unique factorization of any element into commuting parts, and prove related results. Dedicated to L. M. Gluskin on the occasion of his sixtieth birthday     

Finitary monoids

Abstract. No abstract.     

Tied monoids

We construct certain monoids, called tied monoids. These monoids result to be semidirect products finitely presented and commonly built from braid groups and their relatives acting on monoids of set partitions. The nature of our monoids indicate that they should give origin to new knot algebras; indeed, our tied monoids include the tied braid monoid and the tied singular braid monoid, which were used, respectively, to construct new polynomial invariants for classical links and singular links. Consequently, we provide a mechanism to attach an algebra to each tied monoid; this mechanism not only captures known generalizations of the bt-algebra, but also produces possible new knot algebras. To build the tied monoids it is necessary to have presentations of set partition monoids of types A, B and D, among others. For type A we use a presentation due to FitzGerald and for the other type it was necessary to built them.

     

Absolutely Summing Processes

Abstract

Absolutely summing processes are defined, which form a subclass of weakly operator harmonizable processes. When the parameter space is the set of real numbers, it is proved that an absolutely summing process is represented as an integral of operator stationary processes with respect to an appropriate probability measure. To do this, weak convergence of scalar and vector measures is considered. Then we prove compactness of the unit ball of vector measures under certain topologies, and we apply the Choquet theorem to derive an integral representation.     

Cohomology monoids of monoids with coefficients in semimodules II

We relate the old and new cohomology monoids of an arbitrary monoid M with coefficients in semimodules over M, introduced in the author’s previous papers, to monoid and group extensions. More precisely, the old and new second cohomology monoids describe Schreier extensions of semimodules by monoids, and the new third cohomology monoid is related to a certain group extension problem.     

Positive Sugihara monoids

It is proved that in the variety of positive Sugihara monoids, every finite subdirectly irreducible algebra is a retract of a free algebra. It follows that every quasivariety of positive Sugihara monoids is a variety, in contrast with the situation in several neighboring varieties. This result shows that when the logic R-mingle is formulated with the Ackermann constant t, then its full negation-free fragment is hereditarily structurally complete. Presented by R. W. Quackenbush. Received August 28, 2005; accepted in final form July 31, 2006.     

Factorizable inverse monoids

Factorizable inverse monoids constitute the algebraic theory of those partial symmetries which are restrictions of automorphisms; the formal definition is that each element is the product of an idempotent and an invertible. This class of monoids has theoretical significance, and includes concrete instances which are important in various contexts. This survey is organised around the idea of group acts on semilattices and contains a large range of examples. Topics also include methods for construction of factorizable inverse monoids, and aspects of their inner structure, morphisms, and presentations.     

Double Catalan monoids

In this paper, we define and study what we call the double Catalan monoid. This monoid is the image of a natural map from the 0-Hecke monoid to the monoid of binary relations. We show that the double Catalan monoid provides an algebraization of the (combinatorial) set of 4321-avoiding permutations and relate its combinatorics to various off-shoots of both the combinatorics of Catalan numbers and the combinatorics of permutations. In particular, we give an algebraic interpretation of the first derivative of the Kreweras involution on Dyck paths, of 4321-avoiding involutions and of recent results of Barnabei et al. on admissible pairs of Dyck paths. We compute a presentation and determine the minimal dimension of an effective representation for the double Catalan monoid. We also determine the minimal dimension of an effective representation for the 0-Hecke monoid.     

Absolutely indecomposable modules

A module is called absolutely indecomposable if it is directly indecomposable in every generic extension of the universe. We want to show the existence of large abelian groups that are absolutely indecomposable. This will follow from a more general result about -modules over a large class of commutative rings with endomorphism ring which remains the same when passing to a generic extension of the universe. It turns out that `large' in this context has a precise meaning, namely being smaller than the first -Erdos cardinal defined below. We will first apply a result on large rigid valuated trees with a similar property established by Shelah in 1982, and will prove the existence of related `-modules' (-modules with countably many distinguished submodules) and finally pass to -modules. The passage through -modules has the great advantage that the proofs become very transparent essentially using a few `linear algebra' arguments also accessible for graduate students. The result closes a gap of Eklof and Shelah (1999) and Eklof and Mekler (2002), provides a good starting point for Fuchs and Göbel, and gives a new construction of indecomposable modules in general using a counting argument.

     

Absolutely Pure Covers

Absolutely pure modules act in ways similar to injective modules. There are conditions on a ring which guarantee that the class of injective modules will be covering. In this article, we define conditions on the ring R which guarantee that the class of absolutely pure modules will be covering. These include R being left coherent, which we show implies a number of other necessary properties.     

Absolutely inertial delays

Asynchronous systems represent the models of asynchronous circuits from digital electrical engineering. A delay is an asynchronous system that models the delay circuit. The purpose of the paper is that of defining and characterising the absolute inertia of the delays. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)