Related papers: Translation Monoids and Recursive Evaluation in Fi…

We will prove bi-interpretability of the arithmetic $\N = \langle N, +,\cdot, 0, 1\rangle$ and the weak second order theory of $\N$ with the free monoid $\mathbb{M}_X$ of finite rank greater than 1 and with a non-trivial partially…

This work is a contribution to the study of set of the representations of integers in a rational base number system. This prefix-closed subset of the free monoid is naturally represented as a highly non regular tree whose nodes are the…

In this paper, we study tensor (or monoidal) categories of finite rank over an algebraically closed field $\mathbb F$. Given a tensor category $\mathcal{C}$, we have two structure invariants of $\mathcal{C}$: the Green ring (or the…

Every rational number p/q defines a rational base numeration system in which every integer has a unique finite representation, up to leading zeroes. This work is a contribution to the study of the set of the representations of integers.…

We first study commutative, pointed monoids providing basic definitions and results in a manner similar commutative ring theory. Included are results on chain conditions, primary decomposition as well as normalization for a special class of…

The class of finitely presented algebras A over a field K with a set of generators x_{1},...,x_{n} and defined by homogeneous relations of the form x_{i_1}x_{i_2}...x_{i_l}=x_{sigma(i_1)}x_{sigma(i_2)}...x_{sigma(i_l)}, where l geq 2 is a…

We classify the $\mathscr{R}$-cross-sections of the monoid of order-preserving transformations on the $n$-element chain in terms of certain binary trees.

Sorting algorithms are fundamental to computer science, and their correctness criteria are well understood as rearranging elements of a list according to a specified total order on the underlying set of elements. As mathematical functions,…

In this technical report we describe a general class of monoids for which (sub)sequential rational can be characterised in terms of a congruence relation in the flavour of Myhill-Nerode relation. The class of monoids that we consider can be…

We study definable sets $D$ of SU-rank 1 in $M^{eq}$, where $M$ is a countable homogeneous and simple structure in a language with finite relational vocabulary. Each such $D$ can be seen as a `canonically embedded structure', which inherits…

The algebraic expression $3 + 2 + 6$ can be evaluated to $11$, but it can also be partially evaluated to $5 + 6$. In categorical algebra, such partial evaluations can be defined in terms of the $1$-skeleton of the bar construction for…

We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…

In this note, we define the Burnside ring of a monoid, generalizing the construction for groups. After giving foundational definitions, we characterize transitive M-sets and their automorphisms, then prove a structure theorem for a broad…

For which sets A does there exist a mapping, computed by a total or partial recursive function, such that the mapping, when its domain is restricted to A, is a 1-to-1, onto mapping to $\Sigma^*$? And for which sets A does there exist such a…

This paper investigates the class of finitely presented monoids defined by homogeneous (length-preserving) relations from a computational perspective. The properties of admitting a finite complete rewriting system, having finite derivation…

We explore from an algebraic viewpoint the properties of the tree languages definable with a first-order formula involving the ancestor predicate, using the description of these languages as those recognized by iterated block products of…

Let $A$ be a Rees-like algebra of dimension $d$ and $N$ a commutative partially cancellative torsion-free seminormal monoid. We prove the following results. \begin{enumerate} \item Let $P$ be a finitely generated projective $A$-module of…

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 introduce and characterize a particularly tractable class of unital type 1 C*-algebras with bounded dimension of irreducible representations. Algebras in this class are called recursive subhomogeneous algebras, and they have an inductive…

Let $A\subset B$ be an extension of commutative reduced rings and $M\subset N$ an extension of positive commutative cancellative torsion-free monoids. We prove that $A$ is subintegrally closed in $B$ and $M$ is subintegrally closed in $N$…