Markov semigroups, monoids, and groups

A group is Markov if it admits a prefix-closed regular language of unique representatives with respect to some generating set, and strongly Markov if it admits such a language of unique minimal-length representatives over every generating set. This paper considers the natural generalizations of these concepts to semigroups and monoids. Two distinct potential generalizations to monoids are shown to be equivalent. Various interesting examples are presented, including an example of a non-Markov monoid that nevertheless admits a regular language of unique representatives over any generating set. It is shown that all finitely generated commutative semigroups are strongly Markov, but that finitely generated subsemigroups of virtually abelian or polycyclic groups need not be. Potential connections with word-hyperbolic semigroups are investigated. A study is made of the interaction of the classes of Markov and strongly Markov semigroups with direct products, free products, and finite-index subsemigroups and extensions. Several questions are posed.Comment: 40 pages; 3 figure

Markov chains, R\mathscr R-trivial monoids and representation theory

We develop a general theory of Markov chains realizable as random walks on $\mathscr R$-trivial monoids. It provides explicit and simple formulas for the eigenvalues of the transition matrix, for multiplicities of the eigenvalues via M\"obius inversion along a lattice, a condition for diagonalizability of the transition matrix and some techniques for bounding the mixing time. In addition, we discuss several examples, such as Toom-Tsetlin models, an exchange walk for finite Coxeter groups, as well as examples previously studied by the authors, such as nonabelian sandpile models and the promotion Markov chain on posets. Many of these examples can be viewed as random walks on quotients of free tree monoids, a new class of monoids whose combinatorics we develop.Comment: Dedicated to Stuart Margolis on the occasion of his sixtieth birthday; 71 pages; final version to appear in IJA

Directed nonabelian sandpile models on trees

We define two general classes of nonabelian sandpile models on directed trees (or arborescences) as models of nonequilibrium statistical phenomena. These models have the property that sand grains can enter only through specified reservoirs, unlike the well-known abelian sandpile model. In the Trickle-down sandpile model, sand grains are allowed to move one at a time. For this model, we show that the stationary distribution is of product form. In the Landslide sandpile model, all the grains at a vertex topple at once, and here we prove formulas for all eigenvalues, their multiplicities, and the rate of convergence to stationarity. The proofs use wreath products and the representation theory of monoids.Comment: 43 pages, 5 figures; introduction improve

Poset topology and homological invariants of algebras arising in algebraic combinatorics

We present a beautiful interplay between combinatorial topology and homological algebra for a class of monoids that arise naturally in algebraic combinatorics. We explore several applications of this interplay. For instance, we provide a new interpretation of the Leray number of a clique complex in terms of non-commutative algebra. R\'esum\'e. Nous pr\'esentons une magnifique interaction entre la topologie combinatoire et l'alg\`ebre homologique d'une classe de mono\"ides qui figurent naturellement dans la combinatoire alg\'ebrique. Nous explorons plusieurs applications de cette interaction. Par exemple, nous introduisons une nouvelle interpr\'etation du nombre de Leray d'un complexe de clique en termes de la dimension globale d'une certaine alg\`ebre non commutative.Comment: This is an extended abstract surveying the results of arXiv:1205.1159 and an article in preparation. 12 pages, 3 Figure

Uniquely presented finitely generated commutative monoids

A finitely generated commutative monoid is uniquely presented if it has only a minimal presentation. We give necessary and sufficient conditions for finitely generated, combinatorially finite, cancellative, commutative monoids to be uniquely presented. We use the concept of gluing to construct commutative monoids with this property. Finally for some relevant families of numerical semigroups we describe the elements that are uniquely presented.Comment: 13 pages, typos corrected, references update

A strong geometric hyperbolicity property for directed graphs and monoids

We introduce and study a strong "thin triangle"' condition for directed graphs, which generalises the usual notion of hyperbolicity for a metric space. We prove that finitely generated left cancellative monoids whose right Cayley graphs satisfy this condition must be finitely presented with polynomial Dehn functions, and hence word problems in NP. Under the additional assumption of right cancellativity (or in some cases the weaker condition of bounded indegree), they also admit algorithms for more fundamentally semigroup-theoretic decision problems such as Green's relations L, R, J, D and the corresponding pre-orders. In contrast, we exhibit a right cancellative (but not left cancellative) finitely generated monoid (in fact, an infinite class of them) whose Cayley graph is a essentially a tree (hence hyperbolic in our sense and probably any reasonable sense), but which is not even recursively presentable. This seems to be strong evidence that no geometric notion of hyperbolicity will be strong enough to yield much information about finitely generated monoids in absolute generality.Comment: Exposition improved. Results unchange