Related papers: Categorical Data Structures for Technical Computin…
Categorical semantics of type theories are often characterized as structure-preserving functors. This is because in category theory both the syntax and the domain of interpretation are uniformly treated as structured categories, so that we…
We are interested in regular expressions and transducers that represent word relations in an alphabet-invariant way---for example, the set of all word pairs u,v where v is a prefix of u independently of what the alphabet is. Current…
Let $X$ be a non-empty set and $\sP(X)$ be its power set. A set-valuation or a set-labeling of a given graph $G$ is an injective function $f:V(G) \to \sP(X)$ such that the induced function $f^{\ast}:E(G) \to \sP(X)$ defined by $f^{\ast}…
We present a novel class of convolutional neural networks (CNNs) for set functions, i.e., data indexed with the powerset of a finite set. The convolutions are derived as linear, shift-equivariant functions for various notions of shifts on…
Geometric graphs are a special kind of graph with geometric features, which are vital to model many scientific problems. Unlike generic graphs, geometric graphs often exhibit physical symmetries of translations, rotations, and reflections,…
Matching 't Hooft anomalies is a powerful tool for constraining the low-energy dynamics of quantum systems and their allowed renormalization group (RG) flows. For non-invertible (or categorical) symmetries, however, a key challenge has been…
In this paper we introduced an arithmetic graph function which associates with every group G the directed graph whose vertices corresponds to the divisors of |G|. With the help of such functions we introduced arithmetic graphs of classes of…
Benchmark data sets are an indispensable ingredient of the evaluation of graph-based machine learning methods. We release a new data set, compiled from International Planning Competitions (IPC), for benchmarking graph classification,…
In enumerative combinatorics, it is often a goal to enumerate both labeled and unlabeled structures of a given type. The theory of combinatorial species is a novel toolset which provides a rigorous foundation for dealing with the…
We introduce a theory for encoding and manipulating algebraic data on categories via $\textit{concentration structures}$, which are equivalence relations on morphisms that satisfy certain axioms. For any category with a concentration…
Attack trees (ATs) are popular graphical models for reasoning about the security of complex systems, allowing for the quantification of risk through so-called AT metrics. A large variety of different such AT metrics have been proposed, and…
We introduce a novel compositional description of Feynman diagrams, with well-defined categorical semantics as morphisms in a dagger-compact category. Our chosen setting is suitable for infinite-dimensional diagrammatic reasoning,…
This article serves as a preliminary introduction to the design of a new, open-source applied and computational category theory framework, named Categorica, built on top of the Wolfram Language. Categorica allows one to configure and…
Software product line engineering is a very common method for designing complex software systems. Feature modeling is the most common approach to specify product lines. The main part of a feature model is a special tree of features called a…
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 introduce structured decompositions, category-theoretic structures which simultaneously generalize notions from graph theory (including treewidth, layered treewidth, co-treewidth, graph decomposition width, tree independence number,…
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…
In this report, we present TAGLAS, an atlas of text-attributed graph (TAG) datasets and benchmarks. TAGs are graphs with node and edge features represented in text, which have recently gained wide applicability in training graph-language or…
For a nice-enough category $\mathcal{C}$, we construct both the morphism category ${\rm H}(\mathcal{C})$ of $\mathcal{C}$ and the category ${\rm mod}\mbox{-}\mathcal{C}$ of all finitely presented contravariant additive functors over…
We propose a novel database model whose basic structure is a labeled, directed, acyclic graph with a single root, in which the nodes represent the data sets of an application and the edges represent functional relationships among the data…