Results 1 
6 of
6
Categories and groupoids
, 1971
"... In 1968, when this book was written, categories had been around for 20 years and groupoids for twice as long. Category theory had by then become widely accepted as an essential tool in many parts of mathematics and a number of books on the subject had appeared, or were about to appear (e.g. [13, 22, ..."
Abstract

Cited by 40 (2 self)
 Add to MetaCart
In 1968, when this book was written, categories had been around for 20 years and groupoids for twice as long. Category theory had by then become widely accepted as an essential tool in many parts of mathematics and a number of books on the subject had appeared, or were about to appear (e.g. [13, 22, 37, 58, 65] 1). By contrast, the use of groupoids was confined to a small number of pioneering articles, notably by Ehresmann [12] and Mackey [57], which were largely ignored by the mathematical community. Indeed groupoids were generally considered at that time not to be a subject for serious study. It was argued by several wellknown mathematicians that group theory sufficed for all situations where groupoids might be used, since a connected groupoid could be reduced to a group and a set. Curiously, this argument, which makes no appeal to elegance, was not applied to vector spaces: it was well known that the analogous reduction in this case is not canonical, and so is not available, when there is extra structure, even such simple structure as an endomorphism. Recently, Corfield in [41] has discussed methodological issues in mathematics with this topic, the resistance to the notion of groupoids, as a prime example. My book was intended chiefly as an attempt to reverse this general assessment of the time by presenting applications of groupoids to group theory
A functorial approach to the C ∗ algebras of a graph
 Caterina Consani, Department of Mathematics, University of Toronto
"... ∗homomorphisms. The resulting C ∗algebras are identified as Toeplitz graph algebras. Graph algebras are proved to have inductive limit decompositions over any family of subgraphs with union equal to the whole graph. The construction is used to prove various structural properties of graph algebras. ..."
Abstract

Cited by 17 (5 self)
 Add to MetaCart
∗homomorphisms. The resulting C ∗algebras are identified as Toeplitz graph algebras. Graph algebras are proved to have inductive limit decompositions over any family of subgraphs with union equal to the whole graph. The construction is used to prove various structural properties of graph algebras. Introduction. Since the paper of Cuntz and Krieger in 1976, much work has gone into elucidating the brief remarks made there regarding the case of infinite 0 − 1 matrices. While perhaps the most farreaching solution put forward has been a direct generalization to infinite 0 − 1 matrices ([9]), most of the papers on the subject generalize to a class of infinite directed graphs. (In fact, this is the direction indicated in [7].) In this paper
Crossed complexes, and free crossed resolutions for amalgamated sums and HNNextensions of groups
 Georgian Math. J
, 1999
"... Dedicated to Hvedri Inassaridze for his 70th birthday The category of crossed complexes gives an algebraic model of CWcomplexes and cellular maps. Free crossed resolutions of groups contain information on a presentation of the group as well as higher homological information. We relate this to the p ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
Dedicated to Hvedri Inassaridze for his 70th birthday The category of crossed complexes gives an algebraic model of CWcomplexes and cellular maps. Free crossed resolutions of groups contain information on a presentation of the group as well as higher homological information. We relate this to the problem of calculating nonabelian extensions. We show how the strong properties of this category allow for the computation of free crossed resolutions for amalgamated sums and HNNextensions of groups, and so obtain computations of higher homotopical syzygies in these cases. 1
HNN extensions of inverse semigroups and groupoids
"... We use the isomorphism between the categories of inverse semigroups and inductive groupoids to construct HNN extensions of inverse semigroups, where the associated inverse subsemigroups are order ideals of the base. Properties of groupoids then ensure that the base inverse semigroup always embed ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We use the isomorphism between the categories of inverse semigroups and inductive groupoids to construct HNN extensions of inverse semigroups, where the associated inverse subsemigroups are order ideals of the base. Properties of groupoids then ensure that the base inverse semigroup always embeds in an HNN extension constructed in this way. Other properties of HNN extensions are determined, including a description of the maximal subgroups and of the maximal group image, and the structure of the inverse subsemigroup generated by the stable letters. Finally, some examples are given.
Crossed complexes, free crossed resolutions and graph products of groups’, (submitted
"... The category of crossed complexes gives an algebraic model of CWcomplexes and cellular maps. Free crossed resolutions of groups contain information on a presentation of the group as well as higher homological information. We relate this to the problem of calculating nonabelian extensions. We show ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The category of crossed complexes gives an algebraic model of CWcomplexes and cellular maps. Free crossed resolutions of groups contain information on a presentation of the group as well as higher homological information. We relate this to the problem of calculating nonabelian extensions. We show how the strong properties of this category allow for the computation of free crossed resolutions of graph products of groups, and so obtain computations of higher homotopical syzygies in this case. 1