Related papers: A Compositional Framework for Bond Graphs
A graph $G$ is called equiarboreal if the number of spanning trees containing a given edge in $G$ is independent of the choice of edge. In [Combinatorica 1(2) (1981) 163--167], Godsil proved that any graph which is a colour class in an…
We consider when a smooth vector bundle endowed with a connection possesses non-trivial, local parallel sections. This is accomplished by means of a derived flag of subsets of the bundle. The procedure is algebraic and rests upon the…
A category N of labeled (oriented) trivalent graphs (nets) or ribbon graphs is extended by new generators called fusing, braiding, twist and switch with relations which can be called Moore--Seiberg relations. A functor to N is constructed…
To explore whether a flat-band system can accommodate superconductivity, we consider repulsively interacting fermions on the diamond chain, a simplest quasi-one-dimensional system that contains a flat band. Exact diagonalization and the…
Wehrheim and Woodward have shown how to embed all the canonical relations between symplectic manifolds into a category in which the composition is the usual one when transversality and embedding assumptions are satisfied. A morphism in…
Morphisms between (formal) contexts are certain pairs of maps, one between objects and one between attributes of the contexts in question. We study several classes of such morphisms and the connections between them. Among other things, we…
A combinatorial code $\mathcal{C}$ is a collection of subsets of $[n]$, or equivalently a set of points in $\{0,1\}^n$. A morphism of codes is a map from one combinatorial code to another such that the coordinates of points in the image can…
Built on a realistic multiband tight-binding model, mirror symmetry is used to map a calcium-intercalated bilayer graphene Hamiltonian into two independent single layer graphene-like Hamiltonians with renormalized hopping. The…
In this paper, we determine the computational complexity of recognizing two graph classes, \emph{grounded L}-graphs and \emph{stabbable grid intersection} graphs. An L-shape is made by joining the bottom end-point of a vertical ($\vert$)…
A relational structure is a core, if all its endomorphisms are embeddings. This notion is important for computational complexity classification of constraint satisfaction problems. It is a fundamental fact that every finite structure has a…
In this paper we discuss the connected components of underlying graphs of halving lines' configurations. We show how to create a configuration whose underlying graph is the union of two given underlying graphs. We also prove that every…
We study the structure of the category of representations of $\mathbf{FA}$, the category of finite sets and all maps, mostly working over a field of characteristic zero. This category is not semi-simple and exhibits interesting features. We…
We investigate tensor products of matrix factorisations. This is most naturally done by formulating matrix factorisations in terms of bimodules instead of modules. If the underlying ring is C[x_1,...,x_N] we show that bimodule matrix…
We study semi-strict tricategories in which the only weakness is in vertical composition. We construct these as categories enriched in the category of bicategories with strict functors, with respect to the cartesian monoidal structure. As…
In Chapter 1 we fully characterise pairs of finite graphs which form a gap in the full homomorphism order. This leads to a simple proof of the existence of generalised duality pairs. We also discuss how such results can be carried to…
Whereas string diagrams for strict monoidal categories are well understood, and have found application in several fields of Computer Science, graphical formalisms for non-strict monoidal categories are far less studied. In this paper, we…
We introduce a diagram category, study its structure, and investigate some of its applications to the representation theory of Lie algebras and Lie superalgebras. The morphisms of the category, which contains a subcategory isomorphic to the…
The Engel graph of a finite group $G$ is a directed graph encoding the pairs of elements in $G$ satisfying some Engel word. Recent work of Lucchini and the third author shows that, except for a few well-understood cases, the Engel graphs of…
We define a bicategory in which the 0-cells are the entwinings over variable rings. The 1-cells are triples of a bimodule and two maps of bimodules which satisfy an additional hexagon, two pentagons and two (co)unit triangles; and the…
In this paper we present a detailed study of \emph{bonded knots} and their related structures, integrating recent developments into a single framework. Bonded knots are classical knots endowed with embedded bonding arcs modeling physical or…