Related papers: Combinatorics and algebra of tensor calculus
Circuit algebras are a symmetric analogue of Jones's planar algebras introduced to study finite-type invariants of virtual knotted objects. Circuit algebra structures appear, in different forms, across mathematics. This paper provides a…
We prove several combinatorial results on path algebras over discrete structures related to directed graphs. These results are motivated by Morse theory on a manifold with boundary and, more generally, by Floer theory on a configuration…
Modular operads are a special type of operad: in fact, they bear the same relationship to operads that graphs do to trees (i.e. simply connected graphs). One of the basic examples of a modular operad is the collection of…
The purpose of this note is to give an exposition of some interesting combinatorics and convex geometry concepts that appear in algebraic geometry in relation to counting the number of solutions of a system of polynomial equations in…
The notion of the genus of a quadratic form is generalized to vertex operator algebras. We define it as the modular braided tensor category associated to a suitable vertex operator algebra together with the central charge. Statements…
In category theory, monads, which are monoid objects on endofunctors, play a central role closely related to adjunctions. Monads have been studied mostly in algebraic situations. In this dissertation, we study this concept in some…
It is a classical result that the category of finitely-generated free monoids serves as a PROP for commutative bialgebras. Attaching permutations to fix the order of multiplication, we construct an extension of this category that is…
A PROP is a symmetric monoidal category, whose set of objects is the set of natural numbers and on objects the monoidal structure is given by the addition. An algebra over a PROP is a symmetric strict monoidal functor to the tensor category…
We review the construction of braided tensor categories and modular tensor categories from representations of vertex operator algebras, which correspond to chiral algebras in physics. The extensive and general theory underlying this…
We argue that operads provide a general framework for dealing with polynomials and combinatory completeness of combinatory algebras, including the classical $\mathbf{SK}$-algebras, linear $\mathbf{BCI}$-algebras, planar…
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…
In this paper we unify previous developments on higher operads and multitensors into a single framework in which the interplay between multitensors on a category V, and monads on the category of graphs enriched in V, is taken as…
We investigate a class of combinatory algebras, called ribbon combinatory algebras, in which we can interpret both the braided untyped linear lambda calculus and framed oriented tangles. Any reflexive object in a ribbon category gives rise…
Let P be a quadratic operad. We determine an associated operad ~P such that for any P-algebra A and any ~P-algebra B then the tensor product $A \otimes B$ is a P-algebra.
In this thesis, we generalize the Koszul duality for associative algebras and operads to PROPs. The operads are algebraic objects that represent the operations with multiple inputs but only one output acting on a certain type of algebras. A…
The perturbative expansion of tensorial field theories in Feynman graphs can be interpreted as weighted generating series of some piecewise linear varieties. This simple fact establishes a link between two a priori distinct fields: the…
Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…
This chapter describes interrelations between: (1) algebraic structure on sets of scalars, (2) properties of monads associated with such sets of scalars, and (3) structure in categories (esp. Lawvere theories) associated with these monads.…
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…
In this paper we will prove that there exists a covariant functor from the category of schemes to the category of graphs. This functor provides a combination between algebraic varieties and combinatorial graphs so that the invariants…