Results 1  10
of
73
SemiAbelian Categories
, 2000
"... The notion of semiabelian category as proposed in this paper is designed to capture typical algebraic properties valid for groups, rings and algebras, say, just as abelian categories allow for a generalized treatment of abeliangroup and module theory. In modern terms, semiabelian categories ar ..."
Abstract

Cited by 49 (5 self)
 Add to MetaCart
The notion of semiabelian category as proposed in this paper is designed to capture typical algebraic properties valid for groups, rings and algebras, say, just as abelian categories allow for a generalized treatment of abeliangroup and module theory. In modern terms, semiabelian categories are exact in the sense of Barr and protomodular in the sense of Bourn and have finite coproducts and a zero object. We show how these conditions relate to "old" exactness axioms involving normal monomorphisms and epimorphisms, as used in the fifties and sixties, and we give extensive references to the literature in order to indicate why semiabelian categories provide an appropriate notion to establish the isomorphism and decomposition theorems of group theory, to pursue general radical theory of rings, and how to arrive at basic statements as needed in homological algebra of groups and similar nonabelian structures. Mathematics Subject Classification: 18E10, 18A30, 18A32. Key words:...
TRIPLES, ALGEBRAS AND COHOMOLOGY
 REPRINTS IN THEORY AND APPLICATIONS OF CATEGORIES
, 2003
"... ..."
Chaincomplete posets and directed sets with applications. Algebra univers
, 1976
"... Let a poset P be called chaincomplete when every chain, including the empty chain, has a sup in P. Many authors have investigated properties of posets atisfying some sort of chaincompleteness condition (see [,11, [31, [6], I71, [17], [,181, ['191, [,211, [,221), and used them in a variety o ..."
Abstract

Cited by 33 (0 self)
 Add to MetaCart
Let a poset P be called chaincomplete when every chain, including the empty chain, has a sup in P. Many authors have investigated properties of posets atisfying some sort of chaincompleteness condition (see [,11, [31, [6], I71, [17], [,181, ['191, [,211, [,221), and used them in a variety of applications. In this paper we study the
Model category structures on chain complexes of sheaves
 Trans. Amer. Math. Soc
"... of unbounded chain complexes, where the cofibrations are the injections. This folk theorem is apparently due to Joyal, and has been generalized recently ..."
Abstract

Cited by 30 (0 self)
 Add to MetaCart
of unbounded chain complexes, where the cofibrations are the injections. This folk theorem is apparently due to Joyal, and has been generalized recently
K.: Abstraction of High Level Concepts from Numerical Values in Databases
 In: Proceedings of the Knowledge Discovery in Data Mining Workshop (KDD
, 1994
"... A conceptual clustering method is proposed for discovering high level concepts of numerical attribute values from databases. The method considers both frequency and value distributions of data, thus is able to discover relevant concepts from numerical attributes. The discovered knowledge can be used ..."
Abstract

Cited by 24 (12 self)
 Add to MetaCart
A conceptual clustering method is proposed for discovering high level concepts of numerical attribute values from databases. The method considers both frequency and value distributions of data, thus is able to discover relevant concepts from numerical attributes. The discovered knowledge can be used for representing data semantically and for providing approximate answers when exact ones are not available. Our knowledge discovery approach is to partition the data set of one or more attributes into clusters that minimize the relaxation error. An algorithm is developed which finds the best binary partition in O(n) time and generates a concept hierarchy in O(n2) time where n is the number of distinct values of the attribute. The effectiveness of our clustering method is demonstrated by applying it to a large transportation database for approximate query answering. Key words: approximate query answering, type abstraction hierarchy, conceptual clustering, discretization, data summarization, knowledge discovery in databases. 1
A Categorical Quantum Logic
 UNDER CONSIDERATION FOR PUBLICATION IN MATH. STRUCT. IN COMP. SCIENCE
, 2005
"... We define a strongly normalising proofnet calculus corresponding to the logic of strongly compact closed categories with biproducts. The calculus is a full and faithful representation of the free strongly compact closed category with biproducts on a given category with an involution. This syntax ca ..."
Abstract

Cited by 22 (5 self)
 Add to MetaCart
We define a strongly normalising proofnet calculus corresponding to the logic of strongly compact closed categories with biproducts. The calculus is a full and faithful representation of the free strongly compact closed category with biproducts on a given category with an involution. This syntax can be used to represent and reason about quantum processes.
Exactly Definable Categories
"... this paper is to show that certain properties ofmodules become more transparent if one views them as exact functors. In particular, one can use the machinery of localization theory for locally coherent Grothendieck categories because Ex(C ..."
Abstract

Cited by 17 (9 self)
 Add to MetaCart
this paper is to show that certain properties ofmodules become more transparent if one views them as exact functors. In particular, one can use the machinery of localization theory for locally coherent Grothendieck categories because Ex(C
New Model Categories From Old
 J. Pure Appl. Algebra
, 1995
"... . We review Quillen's concept of a model category as the proper setting for defining derived functors in nonabelian settings, explain how one can transport a model structure from one category to another by mean of adjoint functors (under suitable assumptions), and define such structures for ca ..."
Abstract

Cited by 15 (6 self)
 Add to MetaCart
. We review Quillen's concept of a model category as the proper setting for defining derived functors in nonabelian settings, explain how one can transport a model structure from one category to another by mean of adjoint functors (under suitable assumptions), and define such structures for categories of cosimplicial coalgebras. 1. Introduction Model categories, first introduced by Quillen in [Q1], have proved useful in a number of areas  most notably in his treatment of rational homotopy in [Q2], and in defining homology and other derived functors in nonabelian categories (see [Q3]; also [BoF, BlS, DwHK, DwK, DwS, Goe, ScV]). From a homotopy theorist's point of view, one interesting example of such nonabelian derived functors is the E 2 term of the mod p unstable Adams spectral sequence of Bousfield and Kan. They identify this E 2 term as a sort of Ext in the category CA of unstable coalgebras over the mod p Steenrod algebra (see x7.4). The original purpose of this note w...
Green's Theorem on Hall Algebras
 In &quot;Representations of Algebras and Related Topics,&quot; CMS Conference Proceedings 19 (1996), American Mathematical Society
"... . Let k be a finite field and a hereditary finitary kalgebra. Let P be the set of isomorphism classes of finite modules. We define a multiplication on the Qspace with basis P by counting the number of submodules U of a given module V with prescribed isomorphism classes both of V=U and U. In thi ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
(Show Context)
. Let k be a finite field and a hereditary finitary kalgebra. Let P be the set of isomorphism classes of finite modules. We define a multiplication on the Qspace with basis P by counting the number of submodules U of a given module V with prescribed isomorphism classes both of V=U and U. In this way we obtain the so called Hall algebra H=H(;Q) with coefficients in Q: Besides H, we are also interested in the subalgebra C generated by the the subset I of all isomorphism classes of simple  modules; this subalgebra is called the corresponding composition algebra, since it encodes the number of composition series of all modules. Recently, J. A. Green has introduced on H (and on C) a comultiplication ffi so that it becomes nearly a bialgebra. Here, "nearly" means that ffi:H!H\Omega\Gamma is in general not an algebra homomorphism for the usual (componentwise) multiplication on H\Omega\Gamma ; instead, there is a slightly twisted multiplication on H\Omega\Gamma which has to be con...
Quantum informationflow, concretely, abstractly
 PROC. QPL 2004
, 2004
"... These ‘lecture notes ’ are based on joint work with Samson Abramsky. I will survey and informally discuss the results of [3, 4, 5, 12, 13] in a pedestrian not too technical way. These include: • ‘The logic of entanglement’, that is, the identification and abstract axiomatization of the ‘quantum info ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
These ‘lecture notes ’ are based on joint work with Samson Abramsky. I will survey and informally discuss the results of [3, 4, 5, 12, 13] in a pedestrian not too technical way. These include: • ‘The logic of entanglement’, that is, the identification and abstract axiomatization of the ‘quantum informationflow ’ which enables protocols such as quantum teleportation. 1 To this means we defined strongly compact closed categories which abstractly capture the behavioral properties of quantum entanglement. • ‘Postulates for an abstract quantum formalism ’ in which classical informationflow (e.g. token exchange) is part of the formalism. As an example, we provided a purely formal description of quantum teleportation and proved correctness in abstract generality. 2 In this formalism types reflect kinds, contra the essentially typeless von Neumann formalism [25]. Hence even concretely this formalism manifestly improves on the usual one. • ‘A highlevel approach to quantum informatics’. 3 Indeed, the above discussed work can be conceived as aiming to solve: von Neumann quantum formalism � highlevel language lowlevel language. I also provide a brief discussion on how classical and quantum uncertainty can be mixed in the above formalism (cf. density matrices). 4