Directed diagrammatic reducibility
From MaRDI portal
Publication:2215633
Abstract: We introduce the notion of directed diagrammatic reducibility which is a relative version of diagrammatic reducibility. Directed diagrammatic reducibility has strong group theoretic and topological consequences. A multi-relator version of the Freiheitssatz in the presence of directed diagrammatic reducibility is given. Results concerning asphericity and -injectivity of subcomplexes are shown. We generalize the Corson-Trace characterization of diagrammatic reducibility to directed diagrammatic reducibility. We compare diagrammatic reducibility of relative presentations to directed diagrammatic reducibility. Classical tools for showing diagrammatic reducibility, such as the weight test, the max/min test, and small cancellation techniques are adapted to directed diagrammatic reducibility. The paper ends with some applications to labeled oriented trees.
Recommendations
Cites work
- A COLORING TEST FOR ASPHERICITY
- A new test for asphericity and diagrammatic reducibility of group presentations
- A Note on Group Rings of Certain Torsion-Free Groups
- A short proof of a theorem of Brodskiĭ
- Aspherical labelled oriented trees and knots
- Aspherical relative presentations
- Equations over groups, and groups with one defining relation
- scientific article; zbMATH DE number 4049875 (Why is no real title available?)
- scientific article; zbMATH DE number 3574107 (Why is no real title available?)
- scientific article; zbMATH DE number 1529081 (Why is no real title available?)
- Injective labeled oriented trees are aspherical
- Labelled Oriented Trees and the Whitehead-Conjecture
- On the Asphericity of Ribbon Disc Complements
- ON THE REALIZATION OF WIRTINGER PRESENTATIONS AS KNOT GROUPS
Cited in
(7)- A generalized weight test with applications to tree presentations
- Branched Coverings of 2-Complexes and Diagrammatic Reducibility
- scientific article; zbMATH DE number 15579 (Why is no real title available?)
- Diamond Subgraphs in the Reduction Graph of a One-Rule String Rewriting System
- Relative vertex asphericity
- Trivializers and 2-Complexes
- Diagram groups are totally orderable.
This page was built for publication: Directed diagrammatic reducibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2215633)