Related papers: Turing Automata and Graph Machines
We study a categorical generalisation of tree automata, as $\Sigma$-algebras for a fixed endofunctor $\Sigma$ endowed with initial and final states. Under mild assumptions about the base category, we present a general minimisation algorithm…
We call an operator algebra A {\em reversible} if A with reversed multiplication is also an abstract operator algebra (in the modern operator space sense). This class of operator algebras is intimately related to the {\em symmetric operator…
We examine various categorical structures that can and cannot be constructed. We show that total computable functions can be mimicked by constructible functors. More generally, whatever can be done by a Turing machine can be constructed by…
We examine a variant of hypergraphs that we call interfaced linear hypergraphs, with the aim of creating a sound and complete graphical language for symmetric traced monoidal categories (STMCs) suitable for graph rewriting. In particular,…
This paper studies averaging algebras, say, associative algebras endowed with averaging operators. We develop a cohomology theory for averaging algebras and justify it by interpreting lower degree cohomology groups as formal deformations…
We introduce a new class of operator algebras -- tracially complete C*-algebras -- as a vehicle for transferring ideas and results between C*-algebras and their tracial von Neumann algebra completions. We obtain structure and classification…
A binary relation on graphs is recursively enumerable if and only if it can be computed by a formula in monadic second-order logic. The latter means that the formula defines a set of graphs, in the usual way, such that each "computation…
Graph inverse semigroups generalize the polycyclic inverse monoids and play an important role in the theory of C*-algebras. This paper has two main goals: first, to provide an abstract characterization of graph inverse semigroups; and…
We develop a general finite-alphabet framework for Euler-type sums based on the notion of a monoidal alphabet. An alphabet of summand letters is called monoidal when it is closed under pointwise multiplication, thereby inducing the usual…
We undertake a comprehensive study of structural properties of graph products of von Neumann algebras equipped with faithful, normal states, as well as properties of the graph products relative to subalgebras coming from induced subgraphs.…
For a finite connected simple graph, the Terwilliger algebra is a matrix algebra generated by the adjacency matrix and idempotents corresponding to the distance partition with respect to a fixed vertex. We will consider algebras defined by…
The standard generators of tridiagonal algebras, recently introduced by Terwilliger, are shown to generate a new (in)finite family of mutually commuting operators which extends the Dolan-Grady construction. The involution property relies on…
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…
We relate commutative algebras in braided tensor categories to braid-reversed tensor equivalences, motivated by vertex algebra representation theory. First, for $\mathcal{C}$ a braided tensor category, we give a detailed construction of the…
Structural pattern recognition describes and classifies data based on the relationships of features and parts. Topological invariants, like the Euler number, characterize the structure of objects of any dimension. Cohomology can provide…
The Geometric Algebra Transformer (GATr) is a versatile architecture for geometric deep learning based on projective geometric algebra. We generalize this architecture into a blueprint that allows one to construct a scalable transformer…
Graphs and various graph-like combinatorial structures, such as preorders and hypergraphs, are ubiquitous in programming. This paper focuses on representing graphs in a purely functional programming language like Haskell. There are several…
We introduce the notion of a topological higher-rank graph, a unified generalization of the higher-rank graph and the topological graph. Using groupoid techniques, we define the Toeplitz and Cuntz-Krieger algebras of topological higher-rank…
We adapt the notion of an algebraic theory to work in the setting of quasicategories developed recently by Joyal and Lurie. We develop the general theory at some length. We study one extended example in detail: the theory of commutative…
We give a dynamical characterization of categorical Morita equivalence between compact quantum groups. More precisely, by a Tannaka-Krein type duality, a unital C*-algebra endowed with commuting actions of two compact quantum groups…