pith. sign in

arxiv: 1710.04711 · v2 · pith:3R7LSYWVnew · submitted 2017-10-12 · 🧮 math.AT · math.GT

The topological complexity of the free product

Alexander Dranishnikov , Rustam Sadykov This is my paper
classification 🧮 math.AT math.GT
keywords complexityfreeproducttopologicalcohomologicaldimensiondiscreteformula
0
0 comments X
read the original abstract

We prove the formula $TC(G\ast H)=\max\{TC(G), TC(H), cd(G\times H)\}$ for the topological complexity of the free product of discrete groups with cohomological dimension >2.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Configuration sets for groups

    math.CO 2021-01 unverdicted novelty 3.0

    Develops practical tools for configuration sets F(G,k) in groups and applies them to homogeneous linear systems in finite fields and connectivity of Cayley graphs Cay(G^k, F(G,k)).