1987
DOI: 10.1007/978-1-4613-9586-7_2
|View full text |Cite
|
Sign up to set email alerts
|

Reducible Diagrams and Equations Over Groups

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
121
0

Year Published

1988
1988
2010
2010

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 100 publications
(123 citation statements)
references
References 13 publications
2
121
0
Order By: Relevance
“…The standard split extension of G n .k; l/ by the cyclic group of order n has presentation E n .k; l/ D hx; t j t n ; xt [6] gives that if R n .k; l/ is aspherical (in the sense that any non-empty spherical picture over R contains a dipole) then the presentation P n .k; l/ is aspherical (more precisely, it is diagrammatically reducible in the sense of Gersten [9], which implies that 2 .K/ D 0, where K is the standard CW-complex associated with P ). Theorem 4.1 of [3] gives necessary and sufficient conditions for R n .k; l/ to be aspherical.…”
Section: Asphericitymentioning
confidence: 99%
“…The standard split extension of G n .k; l/ by the cyclic group of order n has presentation E n .k; l/ D hx; t j t n ; xt [6] gives that if R n .k; l/ is aspherical (in the sense that any non-empty spherical picture over R contains a dipole) then the presentation P n .k; l/ is aspherical (more precisely, it is diagrammatically reducible in the sense of Gersten [9], which implies that 2 .K/ D 0, where K is the standard CW-complex associated with P ). Theorem 4.1 of [3] gives necessary and sufficient conditions for R n .k; l/ to be aspherical.…”
Section: Asphericitymentioning
confidence: 99%
“…If open cells are mapped homeomorphically to open cells, then f is called a spherical diagram over P . f is called reducible if there is a pair of 2-cells in C having a boundary edge t in common and being mapped onto the same 2-cell in K P by folding over t. A 2-complex K is called diagrammatically reducible (DR) if each spherical diagram over K is reducible (for details see [3] or [10]). …”
Section: Some Graphsmentioning
confidence: 99%
“…Similarly, summing κ(f ) over all faces of X counts the number of faces minus the sum of all the assigned external angles. Combining these two counts yields the following theorem, versions of which have been proven by Lyndon [63], Gersten [47], Pride [75], Ballmann and Buyalo [3], and myself and Wise [67], among others. See Section 4 of [67] for a more detailed discussion of its history.…”
Section: Combinatorial Gauss-bonnetmentioning
confidence: 76%
“…The first involves the notion of conformally CAT(0) 2-complexes as developed by Gersten [47] and investigated further by Pride [75], Corson [42], Huck and Rosebrock [53] and others. The second application uses a more recent notion due to Dani Wise [84] that he calls nonpositive section curvature.…”
Section: Conformal Cat(0) and Sectional Curvaturementioning
confidence: 99%
See 1 more Smart Citation