Related papers: Path category for free - Open morphisms from coalg…
In this paper we investigate the construction of bicategories of fractions originally described by D. Pronk: given any bicategory $\mathcal{C}$ together with a suitable class of morphisms $\mathbf{W}$, one can construct a bicategory…
This paper is a rather informal guide to some of the basic theory of 2-categories and bicategories, including notions of limit and colimit, 2-dimensional universal algebra, formal category theory, and nerves of bicategories. As is the way…
We investigate several categories related to transition structures, using a mixture of algebraic and topological methods. We show how two such categories are connected by a contravariant adjunction. This is the most detailed of a family of…
A cocycle category H(X,Y) is defined for objects X and Y in a model category, and it is shown that the set of morphisms [X,Y] is isomorphic to the set of path components of H(X,Y) provided the ambient model category is right proper and…
This chapter is a tutorial on techniques and results in free convex algebraic geometry and free real algebraic geometry (RAG). The term free refers to the central role played by algebras of noncommutative polynomials R<x> in free (freely…
A class of algebras is constructed using free fermions and the invariant antisymmetric tensors associated with irreducible holonomy groups. (This version contains minor typographical corrections and some additional references. )
This is an overview of double categories of "open systems": systems that can interact with their environment. We focus on the variable sharing paradigm, where we compose open systems by identifying variables. This paradigm is often…
The categories with noninvertible morphisms are studied analogously to the semisupermanifolds with noninvertible transition functions. The concepts of regular n-cycles, obstruction and the regularization procedure are introduced and…
What makes two computational systems equivalent? Topos theory answers with classifying toposes: a system's semantic content is encoded in the geometric theory it classifies, and two presentations are equivalent when their classifying…
We show that for any continuous monotonic fixed-point free automorphism $f$ on a $\sigma$-compact subgroup $G\subset \mathbb R$ there exists a binary operation $+_f$ such that $\langle G, +_f\rangle$ is a topological group topologically…
We develop a representation theory of categories as a means to explore characteristic structures in algebra. Characteristic structures play a critical role in isomorphism testing of groups and algebras, and their construction and…
We propose a probabilistic transition system specification format, referred to as probabilistic RBB safe, for which rooted branching bisimulation is a congruence. The congruence theorem is based on the approach of Fokkink for the…
For any context-free grammar, we build a transition diagram, that is, a finite directed graph with labeled arcs, which describes the work of the grammar. This approach is new, and it is different from previously known graph models. We…
We give a computational approach to theorem proving in homological algebra. This approach is based on computations in the free abelian category of an additive category $\mathbf{A}$. We show that the free abelian category is amenable to…
Category theory provides a collective description of many arrangements in mathematics, such as topological spaces, Banach spaces and game theory. Within this collective description, the perspective from any individual member of the…
We generalise the usual notion of fibred category; first to fibred 2-categories and then to fibred bicategories. Fibred 2-categories correspond to 2-functors from a 2-category into 2-Cat. Fibred bicategories correspond to trihomomorphisms…
Random noncommutative geometry can be seen as a Euclidean path-integral approach to the quantization of the theory defined by the Spectral Action in noncommutative geometry (NCG). With the aim of investigating phase transitions in random…
Recent approaches to verifying programs in separation logics for concurrency have used state transition systems (STSs) to specify the atomic operations of programs. A key challenge in the setting has been to compose such STSs into larger…
We treat here the interrelation between formal languages and those dynamical systems that can be described by cellular automata (CA). There is a well-known injective map which identifies any CA-invariant subshift with a central formal…
In this note we introduce a notion of free cofibrations of permutative categories. We show that each cofibration of permutative categories is a retract of a free cofibration.