arXiv (OAI Expanded)
open access
A note on higher coherence of graphs of groups
For $n\in \mathbb{N}$, a group is called $n$-coherent if every subgroup of type $\mathsf{F}_n$ is of type $\mathsf{F}_{n+1}$. For $n\ge 1$, we observe that graphs of groups with $n$-coherent vertex groups and virtually poly-cyclic edge groups are $n$-coherent. We deduce the $n$-coherence of certain
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A note on higher coherence of graphs of groups#925080
- Graphical Discreteness, Coxeter Doublings and Generalized Polygons#1076206
- A Note on the Invertibility of Oriented Graphs#628825
- Combinatorial Characterizations of Virtually Torsion-Free and Virtually Free Groups#793586
- Combinatorial Characterizations of Virtually Torsion-Free and Virtually Free Groups#789582
Record · ID 920846
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive