Related papers: Translation Monoids and Recursive Evaluation in Fi…

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…

In recent papers we have studied refined enumerations of alternating sign matrices with respect to a fixed set of top and bottom rows. The present paper is a first step towards extending these considerations to alternating sign matrices…

The starting point of algebraic language theory is that regular languages of finite words are exactly those recognized by finite monoids. This finiteness condition gives rise to a topological space whose points, called profinite words,…

We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

In [arXiv:1509.02937], the notion of a module tensor category was introduced as a braided monoidal central functor $F\colon \mathcal{V}\longrightarrow \mathcal{T}$ from a braided monoidal category $\mathcal{V}$ to a monoidal category…

We show how to reconstruct the topology on the monoid of endomorphisms of the rational numbers under the strict or reflexive order relation, and the polymorphism clone of the rational numbers under the reflexive relation. In addition we…

We consider the translational hull $\Omega(I)$ of an arbitrary subsemigroup $I$ of an endomorphism monoid $\mathrm{End}(A)$ where $A$ is a universal algebra. We give conditions for every bi-translation of $I$ to be realised by…

The additive monoid $R_+(x)$ is defined as the set of all nonnegative integer linear combinations of binomial coefficients $\binom{x}{n}$ for $n \in \mathbb Z_+$. This paper is concerned with the inquiry into the structure of $R_+(\alpha)$…

A linking pairing is a symetric bilinear pairing lambda: GxG --> Q/Z on a finite abelian group. The set of isomorphism classes of linking pairings is a non-cancellative monoid E under orthogonal sum, which is infinitely generated and…

We study the set of monomial ideals in a polynomial ring as an ordered set, with the ordering given by reverse inclusion. We give a short proof of the fact that every antichain of monomial ideals is finite. Then we investigate ordinal…

Let $\Lambda^{\ast}$ be the free monoid of (finite) words over a not necessarily finite alphabet $\Lambda$, which is equipped with some (partial) order. This ordering lifts to $\Lambda^{\ast}$, where it extends the divisibility ordering of…

We study the class structure of finite-alphabet Markov chains with arbitrary memory length. To capture the structural constraints induced by prohibited transitions, we introduce the skeleton of a higher-order transition kernel, defined as a…

The aim of this note is to prove that monoids $\mathrm{Mon}\langle a,b:aUb=b\rangle$, with $aUb$ of relative length 6, admit finite complete rewriting systems. This is some advance in the understanding the long-standing open problem whether…

Let $\Gamma$ be the infinite cyclic group on a generator $x.$ To avoid confusion when working with $\mathbb Z$-modules which also have an additional $\mathbb Z$-action, we consider the $\mathbb Z$-action to be a $\Gamma$-action instead.…

Fully bracketed implication terms on $n$ variables are evaluated in G\"odel $m$-valued logic on a finite chain, and we enumerate truth-table rows by output value across all Catalan bracketings. Using the Catalan decomposition, we derive a…

Multilinear Grammar provides a framework for integrating the many different syntagmatic structures of language into a coherent semiotically based Rank Interpretation Architecture, with default linear grammars at each rank. The architecture…

Recently, deep architectures, such as recurrent and recursive neural networks have been successfully applied to various natural language processing tasks. Inspired by bidirectional recurrent neural networks which use representations that…

Presheaves and nominal sets provide alternative abstract models of sets of syntactic objects with free and bound variables, such as lambda-terms. One distinguishing feature of the presheaf-based perspective is its elegant syntax-free…

Let $R$ be an associative ring with identity and let $N$ be a nil ideal of $R$. It is shown that units of $R/N$ can be lifted to units in $R$. Under some mild conditions on the ring, a procedure is given to determine those lifted units in a…