SearcharxivSearch

arXiv subjects

W. A. Wilson

Publications and source records attributed to W. A. Wilson.

2 recordsLinked to original sources

Minimal generating sets for matrix monoids

In this paper, we determine minimal generating sets for several well-known monoids of matrices over semirings. In particular, we find minimal generating sets for the monoids consisting of: all $n\times n$ boolean matrices when $n\leq 8$; the $n\times n$ boolean matrices containing the identity matrix (the reflexive boolean matrices) when $n\leq 7$; the $n\times n$ boolean matrices containing a permutation (the Hall matrices) when $n \leq 8$; the upper, and lower, triangular boolean matrices of every dimension; the $2 \times 2$ matrices over the semiring $\mathbb{N} \cup \{-\infty\}$ with addition $\oplus$ defined by $x\oplus y = \max(x, y)$ and multiplication $\otimes$ given by $x\otimes y = x + y$ (the max-plus semiring); the $2\times 2$ matrices over any quotient of the max-plus semiring by the congruence generated by $t = t + 1$ where $t\in \mathbb{N}$; the $2\times 2$ matrices over the min-plus semiring and its finite quotients by the congruences generated by $t = t + 1$ for all $t\in \mathbb{N}$; and the $n \times n$ matrices over $\mathbb{Z} / n\mathbb{Z}$ relative to their group of units.

math.RA

Computing maximal subsemigroups of a finite semigroup

A proper subsemigroup of a semigroup is maximal if it is not contained in any other proper subsemigroup. A maximal subsemigroup of a finite semigroup has one of a small number of forms, as described in a paper of Graham, Graham, and Rhodes. Determining which of these forms arise in a given finite semigroup is difficult, and no practical mechanism for doing so appears in the literature. We present an algorithm for computing the maximal subsemigroups of a finite semigroup given knowledge of its Green's structure, and the ability to determine maximal subgroups of certain subgroups. For a finite semigroup $S$ represented by a generating set $X$, in many examples, if it is practical to compute the Green's structure of $S$ from $X$, then it is also practical to find the maximal subsemigroups of $S$ using the algorithm we present. The generating set $X$ for $S$ may consist, for example, of transformations, or partial permutations, of a finite set, or of matrices over a semiring. In such examples, the time taken to determine the Green's structure of $S$ is comparable to that taken to find the maximal subsemigroups. Certain aspects of the problem of finding maximal subsemigroups reduce to other well-known computational problems, such as finding all maximal cliques in a graph and computing the maximal subgroups in a group. The algorithm presented comprises two parts. One part relates to computing the maximal subsemigroups of a special class of semigroups, known as Rees 0-matrix semigroups. The other part involves a careful analysis of certain graphs associated to the semigroup $S$, which, roughly speaking, capture the essential information about the action of $S$ on its $\mathscr{J}$-classes.

math.CO