Skip to content
DraconiticResearch
Search Sources API
181,716 studies31 sourcesUpdated 31 min ago
PreprintCC BY 4.0arXiv

Combination Theorems and the Farrell--Jones Conjecture for Graph Products of Pairs

  • I. Gkeneralis
  • S. Prassidis
Open at sourcePDFDOICite

Abstract

We study the Farrell--Jones conjecture for graph products of pairs and for fundamental groups of polyhedral products. We introduce a pair-deletion decomposition and a local notion of FJ-admissibility, and prove a vertexwise combination theorem for graph products of pairs. The criterion applies, in particular, to ordinary graph products, free-factor pairs, suitable normal pairs, and classes controlled by acylindrical Bass--Serre actions. For polyhedral products, we combine these results with their description by relative graph products and graph products of pairs. We also obtain bounds and exact computations for amenable category, together with applications to simplicial volume and Borel rigidity of closed aspherical polyhedral-product manifolds.

Related

  1. (Self-)similar groups and the Farrell-Jones conjectures
    Laurent Bartholdi
    Groups, Geometry, and DynamicsPeer-reviewedLicence not statedFull text2 citedAlgebra & number theoryHAL
  2. Uniform Stability of Scott-Vogelius Elements on Three-Dimensional Freudenthal Meshes in Degrees Four and Five: Resolving the Farrell-Mitchell-Scott Conjecture
    Hanbing Liang, Fujun Liu
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingComputational physicsarXiv
  3. A Local Approach to Monogenity with an Application to Lenny Jones' Conjecture
    Michail Karatarakis, Sumandeep Kaur
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  4. Limit theorems for random matrix products with a simple top Lyapunov exponent
    Pablo G. Barrientos, Dominique Malicet
    arXivPreprintarXiv licenceFull textDynamical systemsarXiv
  5. Generalizing Green's Syzygy Theorems to Symmetric Products of Curves
    Wenbo Niu, Peter Yi Wei
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv

Cite

BibTeXRIS
BibTeX
@misc{gkeneralis2026combination,
  title = {{Combination Theorems and the Farrell--Jones Conjecture for Graph Products of Pairs}},
  author = {I. Gkeneralis and S. Prassidis},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.03847},
  eprint = {2611.03847},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.03847},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Combination Theorems and the Farrell--Jones Conjecture for Graph Products of Pairs
AU  - I. Gkeneralis
AU  - S. Prassidis
PY  - 2026
DA  - 2026/11/02
PB  - arXiv
DO  - 10.48550/arxiv.2611.03847
UR  - https://arxiv.org/abs/2611.03847
AB  - We study the Farrell--Jones conjecture for graph products of pairs and for fundamental groups of polyhedral products. We introduce a pair-deletion decomposition and a local notion of FJ-admissibility, and prove a vertexwise combination theorem for graph products of pairs. The criterion applies, in particular, to ordinary graph products, free-factor pairs, suitable normal pairs, and classes controlled by acylindrical Bass--Serre actions. For polyhedral products, we combine these results with their description by relative graph products and graph products of pairs. We also obtain bounds and exact computations for amenable category, together with applications to simplicial volume and Borel rigidity of closed aspherical polyhedral-product manifolds.
ER  -