Related papers: The conjugacy problem in semigroups and monoids
This paper addresses the torsion problem for a class of automaton semigroups, defined as semigroups of transformations induced by Mealy automata, aka letter-by-letter transducers with the same input and output alphabet. The torsion problem…
Cactus groups and their pure subgroups appear in various fields of mathematics and are currently attracting attention from diverse mathematical communities. They share similarities with both right-angled Coxeter groups and braid groups. In…
We prove that if $M$ is a monoid and $A$ a finite set with more than one element, then the residual finiteness of $M$ is equivalent to that of the monoid consisting of all cellular automata over $M$ with alphabet $A$.
This article examines the three-way relationship between right coherency of a monoid $S$, solutions of equations over $S$-acts, and injectivity properties of $S$-acts. A monoid $S$ is right coherent if every finitely generated subact of…
In this paper we explore the extent to which the algebraic structure of a monoid $M$ determines the topologies on $M$ that are compatible with its multiplication. Specifically we study the notions of automatic continuity; minimal Hausdorff…
We define and study the notion of a crossed module over an inverse semigroup and the corresponding $4$-term exact sequences, called crossed module extensions. For a crossed module $A$ over an $F$-inverse monoid $T$, we show that equivalence…
Abstract. This article determines relations between two notions concerning monoids: factorability structure, introduced to simplify the bar complex; and quadratic normalisation, introduced to generalise quadratic rewriting systems and…
We prove that if $S$ is a $le$-semigroup in which left ideal elements commute (condition which is called $\mathbf{\Lambda}$), then any $\mathcal{J}$-class satisfying the Green condition is a subsemigroup of $S$. As a corollary of this we…
We study the freeness problem for matrix semigroups. We show that the freeness problem is decidable for upper-triangular $2\times 2$ matrices with rational entries when the products are restricted to certain bounded languages.
If $u$ and $v$ are two conjugate elements of a hyperbolic group then the length of a shortest conjugating element for $u$ and $v$ can be bounded by a linear function of the sum of their lengths, as was proved by Lysenok. Bridson and…
We study congruences on the partial automorphism monoid of a finite rank free group action. We give a decomposition of a congruence on this monoid into a Rees congruence, a congruence on a Brandt semigroup and an idempotent separating…
A common form of MapReduce application involves discovering relationships between certain pairs of inputs. Similarity joins serve as a good example of this type of problem, which we call a "some-pairs" problem. In the framework of Afrati et…
We consider blind, deterministic, finite automata equipped with a register which stores an element of a given monoid, and which is modified by right multiplication by monoid elements. We show that, for monoids M drawn from a large class…
The isomorphism problem for infinite finitely presented groups is probably the hardest among standard algorithmic problems in group theory. Classes of groups where it has been completely solved are nilpotent groups, hyperbolic groups, and…
The left regular band structure on a hyperplane arrangement and its representation theory provide an important connection between semigroup theory and algebraic combinatorics. A finite semigroup embeds in a real hyperplane face monoid if…
This paper introduces and studies a categorical analogue of the familiar monoid semiring construction. By introducing an axiomatisation of summation that unifies notions of summation from algebraic program semantics with various notions of…
The problem of embedding an ample semigroup in an inverse semigroup as a (2, 1, 1)-type subalgebra is known to be undecidable. In this article, we investigate the problem for certain classes of ample semigroups. We also give examples of…
A subsemigroup S of a semigroup Q is a left order in Q and Q is a semigroup of left quotients of S if every element of Q can be expressed as a# b where a and b are elements of S and if, in addition, every element of S that is square…
A prefix monoid is a finitely generated submonoid of a finitely presented group generated by the prefixes of its defining relators. Important results of Guba (1997), and of Ivanov, Margolis and Meakin (2001), show how the word problem for…
We prove that it is decidable whether or not a finitely generated submonoid of a virtually free group is graded, introduce a new geometric characterization as quasi-geodesic monoids, and show that their word problem is rational (as a…