Results 1 
6 of
6
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 ..."
Abstract

Cited by 13 (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 ...
Presentations of OmegaCategories By Directed Complexes
, 1997
"... The theory of directed complexes is extended from free !categories to arbitrary ! categories by defining presentations in which the generators are atoms and the relations are equations between molecules. Our main result relates these presentations to the more standard algebraic presentations; we ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
The theory of directed complexes is extended from free !categories to arbitrary ! categories by defining presentations in which the generators are atoms and the relations are equations between molecules. Our main result relates these presentations to the more standard algebraic presentations; we also show that every !category has a presentation by directed complexes. The approach is similar to that used by Crans for pasting presentations. 1991 Mathematics Subject Classification: 18D05. 1 Introduction There are at present three combinatorial structures for constructing !categories: pasting schemes, defined in 1988 by Johnson [8], parity complexes, introduced in 1991 by Street [16, 17] and directed complexes, given by Steiner in 1993 [15]. These structures each consist of cells which have collections of lower dimensional cells as domain and codomain; see for example Definition 2.2 below. They also have `local' conditions on the cells, ensuring that a cell together with its boundin...
Pasting Presentations for OmegaCategories
, 1995
"... The pasting theorem showed that pasting schemes are useful in studying free !categories. It was thought that their inflexibility with respect to composition and identities prohibited wider use. This is not the case: there is a way of dealing with identities which makes it possible to describe !ca ..."
Abstract
 Add to MetaCart
The pasting theorem showed that pasting schemes are useful in studying free !categories. It was thought that their inflexibility with respect to composition and identities prohibited wider use. This is not the case: there is a way of dealing with identities which makes it possible to describe !categories in terms of generating pasting schemes and relations between generated pastings, i.e., with pasting presentations. In this chapter I develop the necessary machinery for this. The main result, that the !category generated by a pasting presentation is universal with respect to respectable families of realizations, is a generalization of the pasting theorem. Contents 1 Introduction 3 2 Pasting schemes according to Johnson 4 2.1 Graded sets : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4 2.2 !categories : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 2.3 Pasting schemes : : : : : : : : : : : : : : : : : : : : : : : : : : : : 6 2.4 The pasting theorem : : ...
MAPS BETWEEN HIGHER BRUHAT ORDERS AND HIGHER STASHEFFTAMARI POSETS
, 2002
"... Abstract. We make explicit a description in terms of convex geometry of the higher Bruhat orders B(n, d) sketched by Kapranov and Voevodsky. We give an analogous description of the higher StasheffTamari poset S1(n, d). We show that the map f sketched by Kapranov and Voevodsky from B(n, d) to S1([0, ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. We make explicit a description in terms of convex geometry of the higher Bruhat orders B(n, d) sketched by Kapranov and Voevodsky. We give an analogous description of the higher StasheffTamari poset S1(n, d). We show that the map f sketched by Kapranov and Voevodsky from B(n, d) to S1([0, n + 1], d + 1) coincides with the map constructed by Rambau, and is a surjection for d ≤ 2. We also give geometric descriptions of lk0 ◦f and lk {0,n+1} ◦f. We construct a map analogous to f from S1(n, d) to B(n − 1, d), and show that it is always a poset embedding. We also give an explicit criterion to determine if an element of B(n −1, d) is in the image of this map. 1.