Related papers: Steps and Traces

Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…

In this article we describe properties of the 2-functor from the 2-category of comonads to the 2-category of functors that sends a comonad to its forgetful functor. This allows us to describe contexts where algebras over a monad are…

We introduce the notion of vertex coalgebra, a generalization of vertex operator coalgebras. Next we investigate forms of cocommutativity, coassociativity, skew-symmetry, and an endomorphism, $D^*$, which hold on vertex coalgebras. The…

A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…

We study a coderivation from a cobimodule into a coalgebra. Vector cofields are defined by the action of a codual bicomodule on a coalgebra. This action is induced by a codifferential. A construction of a codual object in the category of…

This report specifies an observational semantics and gives an original presentation of the Byrd's box model. The approach accounts for the semantics of Prolog tracers independently of a particular implementation. Traces are, in general,…

We define a tracelike transformation to be a natural family of conjugation invariant maps $T_{x,C}: hom_C(x,x) \to hom_C(1,1)$ for all dualisable objects $x$ in any symmetric monoidal infinity-category $C$. This generalises the trace from…

Optics are bidirectional accessors of data structures; they provide a powerful abstraction of many common data transformations. This abstraction is compositional thanks to a representation in terms of profunctors endowed with an algebraic…

The notion of vertex operator coalgebra is presented and motivated via the geometry of conformal field theory. Specifically, we describe the category of geometric vertex operator coalgebras, whose objects have comultiplicative structures…

Given a braided pivotal category $\mathcal C$ and a pivotal module tensor category $\mathcal M$, we define a functor $\mathrm{Tr}_{\mathcal C}:\mathcal M \to \mathcal C$, called the associated categorified trace. By a result of…

In this paper we show how the theory of monads can be used to deduce in a uniform manner several duality theorems involving categories of relations on one side and categories of algebras with homomorphisms preserving only some operations on…

Following our joint work arXiv:1003.4578 with Robert Langlands, we make the first steps toward developing geometric methods for analyzing trace formulas in the case of the function field of a curve defined over a finite field. We also…

We introduce the notion of a braiding on a skew monoidal category, whose curious feature is that the defining isomorphisms involve three objects rather than two. These braidings are shown to arise from, and classify, cobraidings (also known…

Techniques from higher categories and higher-dimensional rewriting are becoming increasingly important for understanding the finer, computational properties of higher algebraic theories that arise, among other fields, in quantum…

We show that every trace monoid is isomorphic to a sub-monoid of a monoid of word vectors. It provides a concrete representation of the elements of a trace monoid as processes associated with a resource sharing mechanism. We illustrate this…

Bialgebrae provide an abstract framework encompassing the semantics of different kinds of computational models. In this paper we propose a bialgebraic approach to the semantics of logic programming. Our methodology is to study logic…

We give an introduction to logic tailored for algebraists, explaining how proofs in linear logic can be viewed as algorithms for constructing morphisms in symmetric closed monoidal categories with additional structure. This is made explicit…

Processes are often viewed as coalgebras, with the structure maps specifying the state transitions. In the simplest case, the state spaces are discrete, and the structure map simply takes each state to the next states. But the coalgebraic…

For a set-endofunctor $F$, a graph is triple $(V,E,g)$ with a structure map $g:E\rightarrow F V$. This model is a generalized coalgebra over the category of sets. In this note, we model graphs as coalgebras over $Set\times Set$ and use the…

For a noncommutative algebra $\mathcal{A}$ and an antilinear automorphism $\rho$ of $\mathcal{A}$, there is a notion of a positive trace. When we have a three-dimensional $\mathcal{N}=4$ gauge theory or four-dimensional $\mathcal{N}=2$…