The Algebra of Adjacency Patterns: Rees Matrix Semigroups with Reversion

Abstract

We establish a surprisingly close relationship between universal Horn classes of directed graphs and varieties generated by socalled adjacency semigroups which are Rees matrix semigroups over the trivial group with the unary operation of reversion. In particular, the lattice of subvarieties of the variety generated by adjacency semigroups that are regular unary semigroups is essentially the same as the lattice of universal Horn classes of reflexive directed graphs. A number of examples follow, including a limit variety of regular unary semigroups and finite unary semigroups with NP-hard variety membership problems.2000 Mathematics Subject Classification. 20M07, 08C15, 05C15, 20M17.

The Finite Basis Problem for Kiselman Monoids

“…Observe that adding an involution may radically change the equational properties of a semigroup: a finitely based semigroup may become a nonfinitely based involuted semigroup and vice versa. Infinite examples of this sort have been known since 1970s (see [32,Section 2] for references and a discussion); more recently, Jackson and the second-named author [13] have constructed a finitely based finite semigroup that becomes a nonfinitely based involuted semigroup after adding a natural involution, while Lee [18] has shown that the 6-element nonfinitely based semigroup L defined by ( 16) admits an involution under which it becomes a finitely based involuted semigroup.…”

Unary enhancements of inherently non-finitely based semigroups

“…To the best of our knowledge, the first example of a nonfinitely based finite unary semigroup whose reduct is finitely based was constructed only in 1998, see [8]. The unary operation used in [8] was rather ad hoc, and similar examples with well behaved unary operations (including an example of a nonfinitely based finite involutory semigroup with finitely based reduct) have only recently appeared in [7]. Examples of the 'opposite' kind (of finitely based finite unary semigroups with nonfinitely based reducts) are not yet known.…”

Representations and identities of Baxter monoids with involution

“…Since the turn of the millennium, interest in involution semigroups has significantly increased. For example, many counterintuitive results were established and examples have been found to demonstrate that an involution semigroup (S, * ) and its semigroup reduct S need not be simultaneously finitely based [19,20,30,[35][36][37][38][39]. Refer to [1][2][3]21,40,41] for more information on the identities and varieties of involution semigroups.…”