Results 1  10
of
30
Representable Multicategories
 Advances in Mathematics
, 2000
"... We introduce the notion of representable multicategory , which stands in the same relation to that of monoidal category as bration does to contravariant pseudofunctor (into Cat). We give an abstract reformulation of multicategories as monads in a suitable Kleisli bicategory of spans. We describe ..."
Abstract

Cited by 33 (6 self)
 Add to MetaCart
We introduce the notion of representable multicategory , which stands in the same relation to that of monoidal category as bration does to contravariant pseudofunctor (into Cat). We give an abstract reformulation of multicategories as monads in a suitable Kleisli bicategory of spans. We describe representability in elementary terms via universal arrows . We also give a doctrinal characterisation of representability based on a fundamental monadic adjunction between the 2category of multicategories and that of strict monoidal categories. The first main result is the coherence theorem for representable multicategories, asserting their equivalence to strict ones, which we establish via a new technique based on the above doctrinal characterisation. The other main result is a 2equivalence between the 2category of representable multicategories and that of monoidal categories and strong monoidal functors. This correspondence extends smoothly to one between bicategories and a se...
Pseudo limits, biadjoints, and pseudo algebras: categorical foundations of conformal field theory
 Mem. Amer. Math. Soc
"... The purpose of this paper is to work out the categorical basis for the foundations of Conformal Field Theory. The definition of Conformal Field Theory was outlined in Segal [45] and recently given in [24] and [25]. Concepts of 2category theory, such as versions of algebra, limit, colimit, and adjun ..."
Abstract

Cited by 18 (8 self)
 Add to MetaCart
The purpose of this paper is to work out the categorical basis for the foundations of Conformal Field Theory. The definition of Conformal Field Theory was outlined in Segal [45] and recently given in [24] and [25]. Concepts of 2category theory, such as versions of algebra, limit, colimit, and adjunction, are necessary for this
Theory and Applications of Crossed Complexes
, 1993
"... ... L are simplicial sets, then there is a strong deformation retraction of the fundamental crossed complex of the cartesian product K \Theta L onto the tensor product of the fundamental crossed complexes of K and L. This satisfies various sideconditions and associativity/interchange laws, as for t ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
... L are simplicial sets, then there is a strong deformation retraction of the fundamental crossed complex of the cartesian product K \Theta L onto the tensor product of the fundamental crossed complexes of K and L. This satisfies various sideconditions and associativity/interchange laws, as for the chain complex version. Given simplicial sets K 0 ; : : : ; K r , we discuss the rcube of homotopies induced on (K 0 \Theta : : : \Theta K r ) and show these form a coherent system. We introduce a definition of a double crossed complex, and of the associated total (or codiagonal) crossed complex. We introduce a definition of homotopy colimits of diagrams of crossed complexes. We show that the homotopy colimit of crossed complexes can be expressed as the
Pasting Diagrams in nCategories with Applications to Coherence Theorems and Categories of Paths
, 1987
"... This document was typeset using L ..."
Higherdimensional categories with finite derivation type
"... We study convergent (terminating and confluent) presentations of ncategories. Using the notion of polygraph (or computad), we introduce the homotopical property of finite derivation type for ncategories, generalising the one introduced by Squier for word rewriting systems. We characterise this pr ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
We study convergent (terminating and confluent) presentations of ncategories. Using the notion of polygraph (or computad), we introduce the homotopical property of finite derivation type for ncategories, generalising the one introduced by Squier for word rewriting systems. We characterise this property by using the notion of critical branching. In particular, we define sufficient conditions for an ncategory to have finite derivation type. Through examples, we present several techniques based on derivations of 2categories to study convergent presentations by 3polygraphs.
Frobenius Algebras and ambidextrous adjunctions
, 2006
"... In this paper we explain the relationship between Frobenius objects in monoidal categories and adjunctions in 2categories. Specifically, we show that every Frobenius object in a monoidal category M arises from an ambijunction (simultaneous left and right adjoints) in some 2categoryDinto which M fu ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
In this paper we explain the relationship between Frobenius objects in monoidal categories and adjunctions in 2categories. Specifically, we show that every Frobenius object in a monoidal category M arises from an ambijunction (simultaneous left and right adjoints) in some 2categoryDinto which M fully and faithfully embeds. Since a 2D topological quantum field theory is equivalent to a commutative Frobenius algebra, this result also shows that every 2D TQFT is obtained from an ambijunction in some 2category. Our theorem is proved by extending the theory of adjoint monads to the context of an arbitrary 2category and utilizing the free completion under EilenbergMoore objects. We then categorify this theorem by replacing the monoidal category M with a semistrict monoidal 2category M, and replacing the 2categoryD into which it embeds by a semistrict 3category. To state this more powerful result, we must first define the notion of a ‘Frobenius pseudomonoid’, which categorifies that of a Frobenius object. We then define the notion of a ‘pseudo ambijunction’, categorifying that of an ambijunction. In each case, the idea is that all the usual axioms now hold only up to coherent isomorphism. Finally, we show that every Frobenius pseudomonoid in a semistrict monoidal 2category arises from a pseudo ambijunction in some semistrict 3category.
Computads for Finitary Monads on Globular Sets
, 1998
"... . A finitary monad A on the category of globular sets provides basic algebraic operations from which more involved `pasting' operations can be derived. To makes this rigorous, we define Acomputads and construct a monad on the category of Acomputads whose algebras are Aalgebras; an action of the n ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
. A finitary monad A on the category of globular sets provides basic algebraic operations from which more involved `pasting' operations can be derived. To makes this rigorous, we define Acomputads and construct a monad on the category of Acomputads whose algebras are Aalgebras; an action of the new monad encapsulates the pasting operations. When A is the monad whose algebras are ncategories, an Acomputad is an ncomputad in the sense of R.Street. When A is associated to a higher operad (in the sense of the author) , we obtain pasting in weak ncategories. This is intended as a first step towards proving the equivalence of the various definitions of weak ncategory now in the literature. Introduction This work arose as a reflection on the foundation of higher dimensional category theory. One of the main ingredients of any proposed definition of weak ncategory is the shape of diagrams (pasting scheme) we accept to be composable. In a globular approach [3] each kcell has a source ...
An Australian conspectus of higher categories

, 2004
"... Much Australian work on categories is part of, or relevant to, the development of higher categories and their theory. In this note, I hope to describe some of the origins and achievements of our efforts that they might perchance serve as a guide to the development of aspects of higherdimensional wo ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Much Australian work on categories is part of, or relevant to, the development of higher categories and their theory. In this note, I hope to describe some of the origins and achievements of our efforts that they might perchance serve as a guide to the development of aspects of higherdimensional work. I trust that the somewhat autobiographical style will add interest rather than be a distraction. For so long I have felt rather apologetic when describing how categories might be helpful to other mathematicians; I have often felt even worse when mentioning enriched and higher categories to category theorists. This is not to say that I have doubted the value of our work, rather that I have felt slowed down by the continual pressure to defend it. At last, at this meeting, I feel justified in speaking freely amongst motivated researchers who know the need for the subject is well established. Australian Category Theory has its roots in homology theory: more precisely, in the treatment of the cohomology ring and the Künneth formulas in the book by Hilton and Wylie [HW]. The first edition of the book had a mistake concerning the cohomology ring of a product. The Künneth formulas arise from splittings of the natural short exact sequences
Polygraphic programs and polynomialtime functions
"... Abstract – We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of firstorder functional programs. We explain their semantics and prove that they form a Turingcomplete computational model. Their algebraic s ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Abstract – We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of firstorder functional programs. We explain their semantics and prove that they form a Turingcomplete computational model. Their algebraic structure is used by analysis tools, called polygraphic interpretations, for complexity analysis. In particular, we delineate a subclass of polygraphic programs that compute exactly the functions that are Turingcomputable in polynomial time.