Related papers: Multifraction reduction III: The case of interval …
We show that the freeness problems for automaton semigroups and for automaton monoids are undecidable and, thereby, solve an open problem listed by Grigorchuk, Nekrashevych and Sush\-chansk\u{\i}i. We achieve this using a new technique to…
A number of properties of spherical Artin groups extend to Garside groups, defined as the groups of fractions of monoids where least common multiples exist, there is no nontrivial unit, and some additional finiteness conditions are…
This is the second part of a series of three strongly related papers in which three equivalent structures are studied: - internal categories in categories of monoids; defined in terms of pullbacks relative to a chosen class of spans -…
Combinatorial and topological aspects of monoids with an absorbing element and their associated algebras are considered. Phd thesis.
We introduce two partially overlapping classes of pathwise dualities between interacting particle systems that are based on commutative monoids (semigroups with a neutral element) and semirings, respectively. For interacting particle…
This paper deals with the algebraic structure of the sequence of harmonics when combined with equal temperaments. Fractals and the golden ratio appear surprisingly on the way. The sequence of physical harmonics is an increasingly enumerable…
Very little is known about the structure of the intersection of two $k$-generated monoids of words, even for $k=3$. Here we investigate the case of $k$-maximal monoids, that is, monoids whose basis of cardinality $k$ cannot be non-trivially…
In this paper we show that the membership problems for finitely generated submonoids and for rational subsets are recursively equivalent for groups with two or more ends.
A recent paper studied an inverse submonoid $M_n$ of the rook monoid, by representing the nonzero elements of $M_n$ via certain triplets belonging to $\mathbb{Z}^3$. In this short note, we allow the triplets to belong to $\mathbb{R}^3$. We…
In this paper we consider three submonoids of the dihedral inverse monoid $\mathcal{DI}_n$, namely its submonoids $\mathcal{OPDI}_n$, $\mathcal{MDI}_n$ and $\mathcal{ODI}_n$ of all orientation-preserving, monotone and order-preserving…
A generalized numerical semigroup is a submonoid $S$ of $\mathbb{N}^d$ with finite complement in it. We characterize isomorphisms between these monoids in terms of permutation of coordinates. Considering the equivalence relation that…
Graph inverse semigroups generalize the polycyclic inverse monoids and play an important role in the theory of C*-algebras. This paper has two main goals: first, to provide an abstract characterization of graph inverse semigroups; and…
We study groups acting by length-preserving transformations on spaces equipped with asymmetric, partially-defined distance functions. We introduce a natural notion of quasi-isometry for such spaces and exhibit an extension of the…
Graph products of monoids provide a common framework for direct and free products, and graph monoids (also known as free partially commutative monoids). If the monoids in question are groups, then any graph product is, of course, a group.…
Clones of functions play a foundational role in both universal algebra and theoretical computer science. In this work, we introduce clone merge monoids (cm-monoids), a unifying one-sorted algebraic framework that integrates abstract clones,…
We present some fundamental results on (possibly nonlinear) algebraic semigroups and monoids. These include a version of Chevalley's structure theorem for irreducible algebraic monoids, and the description of all algebraic semigroup…
In many situations one encounters an entity that resembles a monoid. It consists of a carrier and two operations that resemble a unit and a multiplication, subject to three equations that resemble associativity and left and right unital…
We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…
Inspired by methods in prime characteristic in commutative algebra, we introduce and study combinatorial invariants of seminormal monoids. We relate such numbers with the singularities and homological invariants of the semigroup ring…
The non-empty finite subsets of a multiplicatively written monoid form a monoid under setwise multiplication. The same holds for finite subsets containing the identity element. Partly due to their unusual arithmetic properties, these…