Related papers: Natural Transformations as Rewrite Rules and Monad…
Congruence families, i.e., $\ell$-adic convergence for well-defined arithmetic subsequences, is a commonplace phenomenon for the coefficients of modular forms. Such families superficially resemble one another, but they often vary…
We extend the basic concepts of Street's formal theory of monads from the setting of 2-categories to that of double categories. In particular, we introduce the double category Mnd(C) of monads in a double category C and define what it means…
Given a locally presentable enriched category $\mathcal{E}$ together with a small dense full subcategory $\mathcal A$ of arities, we study the relationship between monads on $\mathcal E$ and identity-on-objects functors out of $\mathcal A$,…
Let $(1)$ be an automorphism on an additive category $\mathcal{B}$, and let $\eta\colon (1)\to {\rm Id}_{\mathcal{B}}$ be a natural transformation satisfying $\eta_{X(1)}=\eta_X(1)$ for any object $X$ in $\mathcal{B}$. We construct a new…
The basic method of rewriting for words in a free monoid given a monoid presentation is extended to rewriting for paths in a free category given a `Kan extension presentation'. This is related to work of Carmody-Walters on the Todd-Coxeter…
Systematic compositionality is the ability to recombine meaningful units with regular and predictable outcomes, and it's seen as key to humans' capacity for generalization in language. Recent work has studied systematic compositionality in…
In this article, we prove an isomorphism theorem for the case of refinement $\Gamma$-monoids. Based on this we show a version of the well-known Jordan-H\"older theorem in this framework. The main theorem of this article states that - as in…
If $\mathcal{C}$ is a cocomplete monoidal category in which tensoring from both sides preserves coequalizers, then the category of monoids over $\mathcal{C}$ is cocomplete. The same holds if $\mathcal{C}$ has regular factorizations and…
Multifraction reduction is a new approach to the word problem for Artin-Tits groups and, more generally, for the enveloping group of a monoid in which any two elements admit a greatest common divisor. This approach is based on a rewrite…
Transformational music theory mainly deals with group and group actions on sets, which are usually constituted by chords. For example, neo-Riemannian theory uses the dihedral group D24 to study transformations between major and minor…
We construct a category equivalent to the category $\mathbf{Mon}$ of monoids and monoid homomorphisms, based on categories with strict factorization systems. This equivalence is then extended to the category $\mathbf{Mon_s}$ of unital…
This thesis deals with the specification and construction of syntax and operational semantics of a programming language. We work with a general notion of signature for specifying objects of a given category as initial objects in a suitable…
Formal power series come up in several areas such as formal language theory , algebraic and enumerative combinatorics, semigroup theory, number theory etc. This paper focuses on the set x R[[x]] consisting of formal power series with zero…
Word reordering is one of the most difficult aspects of statistical machine translation (SMT), and an important factor of its quality and efficiency. Despite the vast amount of research published to date, the interest of the community in…
Profinite equations are an indispensable tool for the algebraic classification of formal languages. Reiterman's theorem states that they precisely specify pseudovarieties, i.e.~classes of finite algebras closed under finite products,…
A subunit in a monoidal category is a subobject of the monoidal unit for which a canonical morphism is invertible. They correspond to open subsets of a base topological space in categories such as those of sheaves or Hilbert modules. We…
Cyclic words are equivalence classes of cyclic permutations of ordinary words. When a group is given by a rewriting relation, a rewriting system on cyclic words is induced, which is used to construct algorithms to find minimal length…
A new and extensive formalism is developed for monads and galaxies in non-standard enlargements. It is shown that monads and galaxies can be manipulated using order-preserving and order-reversing set-to-set maps, and that set properties…
This is the second paper in a series that aims to provide mathematical descriptions of objects and constructions related to the first few steps of the semantical theory of dependent type systems. We construct for any pair $(R,LM)$, where…
We give an introduction to constructive category theory by answering two guiding computational questions. The first question is: how do we compute the set of all natural transformations between two finitely presented functors like…