Related papers: Completeness for categories of generalized automat…
A certain amount of category theory is developed in an arbitrary finitely complete category with a factorization system on it, playing the role of the comprehensive factorization system on Cat. Those aspects related to the concepts of…
The category of quasi frames (or qframes) is introduced and studied. In the context of qframes we can jointly study problems related to the L-Surjunctivity and Stable Finiteness Conjectures. As a consequences of our main results, we can…
Given a homological epimorphism $\pi:\mathcal{C}\longrightarrow \mathcal{C}/\mathcal{I}$ between $K$-categories, we show that if the ideal $\mathcal{I}$ satisfies certain conditions, then there exists an equivalence between the singularity…
The classical Eckmann-Hilton argument shows that two monoid structures on a set, such that one is a homomorphism for the other, coincide and, moreover, the resulting monoid is commutative. This argument immediately gives a proof of the…
We prove 2-categorical conservativity for any {0,T}-free fragment of MALL over its corresponding intuitionistic version: that is, that the universal map from a closed symmetric monoidal category to the *-autonomous category that it freely…
In this paper we give an example of duoidal $\infty$-categories. We introduce map $\mathcal{O}$-monoidales in an $\mathcal{O}$-monoidal $(\infty,2)$-category for an $\infty$-operad $\mathcal{O}^{\otimes}$. We show that the endomorphism…
We prove that a minimal automaton has a minimal adjacency matrix rank and a minimal adjacency matrix nullity using equitable partition (from graph spectra theory) and Nerode partition (from automata theory). This result naturally introduces…
For predual categories C and D we establish isomorphisms between opfibrations representing local varieties of languages in C, local pseudovarieties of D-monoids, and finitely generated profinite D-monoids. The global sections of these…
Suppose given a Frobenius category E, i.e. an exact category with a big enough subcategory B of bijectives. Let_E_ := E/B denote its classical stable category. For example, we may take E to be the category of complexes C(A) with entries in…
We give a definition of an operad with general groups of equivariance suitable for use in any symmetric monoidal category with appropriate colimits. We then apply this notion to study the 2-category of algebras over an operad in Cat. We…
To any dg-category $T$ (over some base ring $k$), we define a $D^{-}$-stack $\mathcal{M}_{T}$ in the sense of \cite{hagII}, classifying certain $T^{op}$-dg-modules. When $T$ is saturated, $\mathcal{M}_{T}$ classifies compact objects in the…
Let $A$ be a finite-dimensional algebra, and $\mathfrak{M}$ be a $d$-cluster tilting subcategory of mod$A$. From the viewpoint of higher homological algebra, a natural question to ask is when $\mathfrak{M}$ induces a $d$-cluster tilting…
We consider the ordinary category Span(C) of (isomorphism classes of) spans of morphisms in a category C with finite limits as needed, composed horizontally via pullback, and give a general criterion for a quotient of Span(C) to be an…
We consider the structures given by repeatedly generalising the definition of finite state automata by symmetry considerations, and constructing analogues of transition monoids at each step. This approach first gives us non-deterministic…
We explain two related constructions on the data of two monoidal symmetric closed categories $\mathscr{A}$ and $\mathscr{E}$ and monoidal functors $F: \mathscr{E}\to \mathscr{A}$ and $G: \mathscr{A}\to \mathscr{E}$. In a first part, we…
Let $\mathcal{M}$ be an $n$-cluster tilting subcategory of ${\rm mod}\mbox{-}\Lambda$, where $\Lambda$ is an artin algebra. Let $\mathcal{S}(\mathcal{M})$ denotes the full subcategory of $\mathcal{S}(\Lambda)$, the submodule category of…
We introduce the notion of a "category with path objects", as a slight strengthening of Kenneth Brown's classic notion of a "category of fibrant objects". We develop the basic properties of such a category and its associated homotopy…
A finitary automaton group is a group generated by an invertible, deterministic finite-state letter-to-letter transducer whose only cycles are self-loops at an identity state. We show that, for this presentation of finite groups, the…
Combining ideas from distributed algorithms and alternating automata, we introduce a new class of finite graph automata that recognize precisely the languages of finite graphs definable in monadic second-order logic. By restricting…
We study the satisfiability problem of symbolic finite automata and decompose it into the satisfiability problem of the theory of the input characters and the monadic second-order theory of the indices of accepted words. We use our…