Related papers: The monoid of queue actions
Nonunique factorization in commutative monoids is often studied using factorization invariants, which assign to each monoid element a quantity determined by the factorization structure. For numerical monoids (co-finite, additive submonoids…
A monoid $M$ is said to be surjunctive if every injective cellular automaton with finite alphabet over $M$ is surjective. We show that monoid algebras of surjunctive monoids are stably finite. In other words, given any field $K$ and any…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
A Puiseux monoid is a submonoid of $(\mathbb{Q},+)$ consisting of nonnegative rational numbers. Although the operation of addition is continuous with respect to the standard topology, the set of irreducibles of a Puiseux monoid is, in…
Every $F$-inverse monoid can be equipped with the unary operation which maps each element to the maximum element of its $\sigma$-class. In this enriched signature, the class of all $F$-inverse monoids forms a variety of algebraic…
We study the class of acts with embeddings as an abstract elementary class. We show that the class is always stable and show that superstability in the class is characterized algebraically via weakly noetherian monoids. The study of these…
A monoid $S$ is right coherent if every finitely generated subact of every finitely presented right $S$-act itself has a finite presentation; it is weakly right coherent if every finitely generated right ideal of $S$ has a finite…
We present an algorithmic approach to the conjugacy problems in monoids, using rewriting systems. We extend the classical theory of rewriting developed by Knuth and Bendix to a rewriting that takes into account the cyclic conjugates.
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
This paper makes a combinatorial study of the two monoids and the two types of tableaux that arise from the two possible generalizations of the Patience Sorting algorithm from permutations (or standard words) to words. For both types of…
We describe several technical tools that prove to be efficient for investigating the rewrite systems associated with a family of algebraic laws, and might be useful for more general rewrite systems. These tools consist in introducing a…
We introduce a new matroid (graph) invariant, the arboricity polynomial. Given a matroid, the arboricity polynomial enumerates the number of covers of the ground set by disjoint independent sets. We establish the polynomiality of the…
A Puiseux monoid is an additive submonoid of the nonnegative rational numbers. If $M$ is a Puiseux monoid, then the question of whether each non-invertible element of $M$ can be written as a sum of irreducible elements (that is, $M$ is…
Let $G$ be a group and $G_0 \subseteq G$ be a subset. A sequence over $G_0$ means a finite sequence of terms from $G_0$, where the order of elements is disregarded and the repetition of elements is allowed. A product-one sequence is a…
We combine the language of monoids with the language of preorders so as to refine some fundamental aspects of the classical theory of factorization and prove an abstract factorization theorem with a variety of applications. In particular,…
A fully invarient congruence relations on the free algebra on a given type induces a variety of the given type. In contrast, a congruence relation of the free algebra provides algebra of that type. This algebra is given by a so-called…
In this article, we consider the monoid of all monotone and order-decreasing partial transformations denoted as $\mathcal{DORP}_{n}$ on an $n$ ordered chain $[n]=\{1, \ldots,n\}$, its two-sided ideal $I(n,p)= \{\rho \in \mathcal{DORP}_{n} :…
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 construct the analogue of the plactic monoid for the super semistandard Young tableaux over a signed alphabet. This is done by developing a generalization of the Knuth's relations. Moreover we get generalizations of Greene's invariants…
This paper develops the fundamentals of modular representation theory for finite monoids, introducing the decomposition matrix and exploring its connection to Brauer characters. We define modular characteristic and explain how the…