Related papers: Partial monoids: associativity and confluence

An atomic monoid $M$ is called length-factorial if for every non-invertible element $x \in M$, no two distinct factorizations of $x$ into irreducibles have the same length (i.e., number of irreducible factors, counting repetitions). The…

A partial automorphism of a semigroup $S$ is any isomorphism between its subsemigroups, and the set all partial automorphisms of $S$ with respect to composition is the inverse monoid called the partial automorphism monoid of $S$. Two…

The polynomial multiplication problem has attracted considerable attention since the early days of computer algebra, and several algorithms have been designed to achieve the best possible time complexity. More recently, efforts have been…

We apply Stone duality and model theory to study the structure theory of free pro-aperiodic monoids. Stone duality implies that elements of the free pro-aperiodic monoid may be viewed as elementary equivalence classes of pseudofinite words.…

For a given inverse semigroup S , we introduce the notion of algebraic crossed product by using a given partial action of S, and we will prove that under some condition it is associative. Also we will introduce the concept of partial…

We propose a way of associating to each finitely generated monoid or semigroup a formal language, called its loop problem. In the case of a group, the loop problem is essentially the same as the word problem in the sense of combinatorial…

Let $M$ be a cancellative and commutative monoid. A submonoid $N$ of $M$ is called an undermonoid if the Grothendieck groups of $M$ and $N$ coincide. For a given property $\mathfrak{p}$, we are interested in providing an answer to the…

Squier introduced a homotopical method in order to describe all the relations amongst rewriting reductions of a confluent and terminating string rewriting system. From a string rewriting system he constructed a $2$-dimensional combinatorial…

Factorizations of monoids are studied. Two necessary and sufficient conditions in terms of so-called descent 1-cocyles for a monoid to be factorized through two submonoids are found. A full classification of those factorizations of a monoid…

The objective of this paper is to study the monoid of all partial transformations of a finite set that preserve a uniform partition. In addition to proving that this monoid is a quotient of a wreath product with respect to a congruence…

A subset of Q^n is called semilinear (or piecewise linear) if it is Boolean combination of linear half-spaces. We study the computational complexity of the constraint satisfaction problem (CSP) over the rationals when all the constraints…

In this paper, we introduce monoidal rewriting systems (MRS), an abstraction of string rewriting in which reductions are defined over an arbitrary ambient monoid rather than a free monoid of words. This shift is partly motivated by logic:…

We show how the categorial approach to inverse monoids can be described as a certain endofunctor (which we call the partialization functor) of some category. In this paper we show that this functor can be used to obtain several recently…

Set-membership estimation is usually formulated in the context of set-valued calculus and no probabilistic calculations are necessary. In this paper, we show that set-membership estimation can be equivalently formulated in the probabilistic…

Let ${\mathscr P}$ be a topological property. We say that a space $X$ is ${\mathscr P}$-connected if there exists no pair $C$ and $D$ of disjoint cozero-sets of $X$ with non-${\mathscr P}$ closure such that the remainder $X\backslash(C\cup…

We generalize the concept of a field by allowing addition to be a partial operation. We show that elements of such a "partially additive field" share many similarities with physical quantities. In particular, they form subsets of mutually…

In this paper we examine a number of term rewriting system for integer number representations, building further upon the datatype defining systems described in [2]. In particular, we look at automated methods for proving confluence and…

It is shown that the category of semi-biproducts in monoids is equivalent to a category of pseudo-actions. A semi-biproduct in monoids is at the same time a generalization of a semi-direct product in groups and a biproduct in commutative…

Reductions combine collections of input values with an associative and often commutative operator to produce collections of results. When the same input value contributes to multiple outputs, there is an opportunity to reuse partial…

We study the P versus NP problem through properties of functions and monoids, continuing the work of [3]. Here we consider inverse monoids whose properties and relationships determine whether P is different from NP, or whether injective…