Related papers: A Compositional Framework for Bond Graphs

Let $\mathcal{E}$ be a weakly idempotent complete exact category with enough injective and projective objects. Assume that $\mathcal{M} \subseteq \mathcal{E}$ is a rigid, contravariantly finite subcategory of $\mathcal{E}$ containing all…

The Fundamental Morphism Theorem is a categorical version of the First Noether Isomorphism Theorem for categories that do not have kernels or cokernels. We consider two categories of graphs. Both categories will admit graphs with multiple…

A groupoid is a small category in which all morphisms are isomorphisms. An inductive groupoid is a specialised groupoid whose object set is a regular biordered set and the morphisms admit a partial order. A normal category is a specialised…

We show that a compact rigid balanced braided monoidal category with enough compact projective objects gives rise to a system of mapping class group representations compatible with the gluing along marked intervals. A motivation to consider…

Let $G$ be a group. The intersection graph of subgroups of $G$, denoted by $\mathscr{I}(G)$, is a graph with all the proper subgroups of $G$ as its vertices and two distinct vertices in $\mathscr{I}(G)$ are adjacent if and only if the…

It is well-known that for a large class of local rings of positive characteristic, including complete intersection rings, the Frobenius endomorphism can be used as a test for finite projective dimension. In this paper, we exploit this…

Consider a coring with exact rational functor, and a finitely generated and projective right comodule. We construct a functor (\emph{coinduction functor}) which is right adjoint to the hom-functor represented by this comodule. Using the…

In this paper, we study the structure of braid graphs in simply-laced Coxeter systems. We prove that every reduced expression has a unique factorization as a product of so-called links, which in turn induces a decomposition of the braid…

We compare closed and rigid monoidal categories. Closedness is defined by the tensor product having a right adjoint: the internal hom functor. Rigidity, on the other hand, generalises the duality of finite-dimensional vector spaces. In the…

The results of [1,2] on linear homogeneous two-weight codes over finite Frobenius rings are exended in two ways: It is shown that certain non-projective two-weight codes give rise to strongly regular graphs in the way described in [1,2].…

The functor that takes a ring to its category of modules has an adjoint if one remembers the forgetful functor to abelian groups: the endomorphism ring of linear natural transformations. This uses the self-enrichment of the category of…

A weak entwining structure in a 2-category K consists of a monad t and a comonad c, together with a 2-cell relating both structures in a way that generalizes a mixed distributive law.A weak entwining structure can be characterized as a…

Let $C$ be an additive category with cokernels and let Mod($C$) be the category of additive functors from $C^{op}$ to the category Ab of abelian groups. Let mod($C$) be the full subcategory of Mod($C$) consisting of coherent functors. In…

Flip graphs of combinatorial and geometric objects are at the heart of many deep structural insights and connections between different branches of discrete mathematics and computer science. They also provide a natural framework for the…

String diagrams are pictorial representations for morphisms of symmetric monoidal categories. They constitute an intuitive and expressive graphical syntax, which has found application in a very diverse range of fields including concurrency…

Functor morphing provides a method to translate complex representations of automorphism groups of finite modules over finite rings to representations of automorphism groups of functors in some abelian category. In this paper we give an…

A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…

It is well-known that combinatorial circuits are modeled mathematically by string diagrams in a monoidal category. Given a gate set $\Sigma$, the circuits over $\Sigma$ can be thought of as string diagrams in the free monoidal category…

We construct a series of finite-dimensional quantum groups as braided Drinfeld doubles of Nichols algebras of type Super A, for an even root of unity, and classify ribbon structures for these quantum groups. Ribbon structures exist if and…

We introduce a framework for emulating graphs and, through them, curved spaces of arbitrary dimension, using arrays of superconducting wires. The array consists of two stacked layers of wires, horizontal and vertical, such that wires are…