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)).
The topological complexity of the free product
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.
fields
math.CO 1years
2021 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Configuration sets for groups
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)).