منابع مشابه
Copower functors
We give a common generalization of two earlier constructions in [2], that yielded coalgebraic type functors for weighted, resp. fuzzy transition systems. Transition labels for these systems were drawn from a commutative monoid M or a complete semilattice L, with the transition structure interacting with the algebraic structure on the labels. Here, we show that those earlier signature functors a...
متن کاملCopower Objects and Their Applications to Finiteness in Topoi
In this paper, we examine a new approach to topos theory – rather than considering subobjects, look at quotients. This leads to the notion of a copower object, which is the object of quotients of a given object. We study some properties of copower objects, many of which are similar to the properties of a power objects. Given enough categorical structure (i.e. in a pretopos) it is possible to ge...
متن کاملModular Functors
We prove in this paper that the genus zero data of a modular functor determines the modular functor. We do this by establishing that the S-matrix in genus onewith one point labeled arbitrarily can be expressed in terms of the genus zero information and we give an explicit formula. We do not assume the modular functor in question has duality or is unitary, in order to establish this. CONTENTS
متن کاملWebster’s Functors
We start with a warm-up: we explain Nakajima’s construction of the geometric sl2-action on ⊕ v Hmid(T ∗Gr(v, w)). 1.1. Warm-up: Nakajima’s geometric action. The lagrangian subvariety φ−1(0) ⊂ M(v) is easily seen to be the zero section Gr(v, w) ⊂ T ∗Gr(v, w). Indeed, consider the action of C× on M(v) induced from the C×-action on T ∗R by fiberwise dilations. Under the identification ofM(v) with ...
متن کاملStratifications and Mackey Functors Ii: Globally Defined Mackey Functors
We describe structural properties of globally defined Mackey functors related to the stratification theory of algebras. We show that over a field of characteristic zero they form a highest weight category and we also determine precisely when this category is semisimple. This approach is used to show that the Cartan matrix is often symmetric and non-singular, and we are able to compute finite pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.09.057