Complexes of groups are higher dimensional analogs of graphs of groups. The Bass-Serre theory of groups acting on trees is generalized (to the extent that is possible) to this higher dimensional setting. The complexes of groups that arise from group actions are called good. Simple examples are presented to show that not all complexes of groups are good. A sufficient condition for a 2-complex of groups to be good is given. The condition is a generalized small cancellation condition, that is, a "combinatorial non-positive curvature" condition. Small cancellation hypotheses are formulated in terms of conformal structures on 2-complexes. With this approach, Lyndon's curvature formula takes on a more geometric appearance. Then diagrammatic metho...
Niblo and Reeves [NR2] constructed a cubing for each Coxeter group using the hyperplanes of the Coxe...
. We introduce a convenient category of combinatorial objects, known as cell-sets, on which we study...
An important idea in the work of G.-C. Rota is that certain combinatorial objects give rise to Hopf ...
International audienceWe present a family of simplicial complexes called \emphmulti-cluster complexe...
Quadric complexes are square complexes satisfying a new type of combinatorial nonpositive curvature ...
Étant donné un complexe de groupes, quand peut-on déduire une propriété de son groupe fondamental à ...
AbstractBass and Serre recast the foundations of combinatorial group theory in [7]. Here we apply th...
Étant donné un complexe de groupes, quand peut-on déduire une propriété de son groupe fondamental à ...
In this article a generalized version of small cancellation theory is de-veloped which is applicable...
In this talk we develop a graph theoretical test on graphs corresponding to subgroups of one-relator...
In this article, we introduce and investigate bucolic complexes, a common generalization of systolic...
From the reviews: "This book (...) defines the boundaries of the subject now called combinatorial gr...
The main purpose of this book is to show how ideas from combinatorial group theory have spread to tw...
The problems in the combinatorial theory of groups and semi-groups have been studied. Such problems ...
A graph complex is a finite family of graphs closed under deletion of edges. Graph complexes show up...
Niblo and Reeves [NR2] constructed a cubing for each Coxeter group using the hyperplanes of the Coxe...
. We introduce a convenient category of combinatorial objects, known as cell-sets, on which we study...
An important idea in the work of G.-C. Rota is that certain combinatorial objects give rise to Hopf ...
International audienceWe present a family of simplicial complexes called \emphmulti-cluster complexe...
Quadric complexes are square complexes satisfying a new type of combinatorial nonpositive curvature ...
Étant donné un complexe de groupes, quand peut-on déduire une propriété de son groupe fondamental à ...
AbstractBass and Serre recast the foundations of combinatorial group theory in [7]. Here we apply th...
Étant donné un complexe de groupes, quand peut-on déduire une propriété de son groupe fondamental à ...
In this article a generalized version of small cancellation theory is de-veloped which is applicable...
In this talk we develop a graph theoretical test on graphs corresponding to subgroups of one-relator...
In this article, we introduce and investigate bucolic complexes, a common generalization of systolic...
From the reviews: "This book (...) defines the boundaries of the subject now called combinatorial gr...
The main purpose of this book is to show how ideas from combinatorial group theory have spread to tw...
The problems in the combinatorial theory of groups and semi-groups have been studied. Such problems ...
A graph complex is a finite family of graphs closed under deletion of edges. Graph complexes show up...
Niblo and Reeves [NR2] constructed a cubing for each Coxeter group using the hyperplanes of the Coxe...
. We introduce a convenient category of combinatorial objects, known as cell-sets, on which we study...
An important idea in the work of G.-C. Rota is that certain combinatorial objects give rise to Hopf ...