Related papers: Categorified Path Calculus
The theory of path algebras is usually circunscripted to the study of representations, usually linked to finite graphs. In our work, we focus on studying the structure of path algebras over a field associated to arbitrary graphs. We…
Many well-known graph drawing techniques, including force directed drawings, spectral graph layouts, multidimensional scaling, and circle packings, have algebraic formulations. However, practical methods for producing such drawings…
We develop a graphical calculus of manifold diagrams which generalises string and surface diagrams to arbitrary dimensions. Manifold diagrams are pasting diagrams for $(\infty, n)$-categories that admit a semi-strict composition operation…
We develop a purely set-theoretic formalism for binary trees and binary graphs. We define a category of binary automata, and display it as a fibred category over the category of binary graphs. We also relate the notion of binary graphs to…
Monoidal algebraic structures consist of operations that can have multiple outputs as well as multiple inputs, which have applications in many areas including categorical algebra, programming language semantics, representation theory,…
We define a monoidal semantics for algebraic theories. The basis for the definition is provided by the analysis of the structural rules in the term calculus of algebraic languages. Models are described both explicitly, in a form that…
A graphical model is a statistical model that is associated to a graph whose nodes correspond to variables of interest. The edges of the graph reflect allowed conditional dependencies among the variables. Graphical models admit…
The pathway is a biological term that refers to a series of interactions between molecules in a cell that causes a certain product or a change in the cell. Pathway analysis is a powerful method for gene expression analysis. Through pathway…
Marginal polytopes are important geometric objects that arise in statistics as the polytopes underlying hierarchical log-linear models. These polytopes can be used to answer geometric questions about these models, such as determining the…
A rooted planar map is a connected graph embedded in the 2-sphere, with one edge marked and assigned an orientation. A term of the pure lambda calculus is said to be linear if every variable is used exactly once, normal if it contains no…
The $k$-th power of the adjacency matrix of a simple undirected graph represents the number of walks with length $k$ between pairs of nodes. As a walk where no node repeats, a path is a walk where each node is only visited once. The set of…
In this paper, we explore the concept of the ``matrix product of graphs," initially introduced by Prasad, Sudhakara, Sujatha, and M. Vinay. This operation involves the multiplication of adjacency matrices of two graphs with assigned labels,…
Directed acyclic graphs (DAGs) are a class of graphs commonly used in practice, with examples that include electronic circuits, Bayesian networks, and neural architectures. While many effective encoders exist for DAGs, it remains…
A new calculus of planar diagrams involving diagrammatics for biadjoint functors and degenerate affine Hecke algebras is introduced. The calculus leads to an additive monoidal category whose Grothendieck ring contains an integral form of…
Category theory is a branch of mathematics that provides a formal framework for understanding the relationship between mathematical structures. To this end, a category not only incorporates the data of the desired objects, but also…
The main aim of the paper is to give a socle theory for Leavitt path algebras of arbitrary graphs. We use both the desingularization process and combinatorial methods to study Morita invariant properties concerning the socle and to…
A cyclic base ordering of a connected graph $G$, is a cyclic ordering of $E(G)$ such that every cyclically consecutive $|V(G)|-1$ edges form a spanning tree. In this project, we study cyclic base ordering of various families of graphs,…
Quantum computation can be formulated through various models, each highlighting distinct structural and resource-theoretic aspects of quantum computational power. This paper develops a unified categorical framework that encompasses these…
A $k$-ranking of a graph $G$ is a labeling of its vertices from $\{1,\ldots,k\}$ such that any nontrivial path whose endpoints have the same label contains a larger label. The least $k$ for which $G$ has a $k$-ranking is the ranking number…
Indexed symmetric monoidal categories are an important refinement of bicategories -- this structure underlies several familiar bicategories, including the homotopy bicategory of parametrized spectra, and its equivariant and fiberwise…