Computing homotopy classes for diagrams

04/20/2021
by   Marek Filakovsky, et al.
0

We present an algorithm that, given finite simplicial sets X, A, Y with an action of a finite group G, computes the set [X,Y]^A_G of homotopy classes of equivariant maps ℓ X → Y extending a given equivariant map f A → Y under the stability assumption X^H ≤ 2 conn Y^H and conn Y^H ≥ 1, for all subgroups H≤ G. For fixed n = dim X, the algorithm runs in polynomial time. When the stability condition is dropped, the problem is undecidable already in the non-equivariant setting. The algorithm is obtained as a special case of a more general result: For finite diagrams of simplicial sets X, A, Y, i.e. functors ℐ^op→𝗌𝖲𝖾𝗍, in the stable range dim X ≤ 2 conn Y and conn Y > 1, we give an algorithm that computes the set [X, Y]^A of homotopy classes of maps of diagrams ℓ X → Y extending a given f A → Y. Again, for fixed n = X, the running time of the algorithm is polynomial. The algorithm can be utilized to compute homotopy invariants in the equivariant setting – for example, one can algorithmically compute equivariant stable homotopy groups. Further, one can apply the result to solve problems from computational topology, which we showcase on the following Tverberg-type problem: Given a k-dimensional simplicial complex K, is there a map K →ℝ^d without r-tuple intersection points? In the metastable range of dimensions, rd ≥ (r+1)k +3, the result of Mabillard and Wagner shows this problem equivalent to the existence of a particular equivariant map. In this range, our algorithm is applicable and, thus, the r-Tverberg problem is algorithmically decidable (in polynomial time when k, d and r are fixed).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/26/2017

A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes

This paper presents the first polynomial time algorithm to compute geode...
research
06/01/2017

Computing simplicial representatives of homotopy group elements

A central problem of algebraic topology is to understand the homotopy gr...
research
08/09/2022

A Survey on Computing Schematic Network Maps: The Challenge to Interactivity

Schematic maps are in daily use to show the connectivity of subway syste...
research
12/06/2022

Extending Snow's algorithm for computations in the finite Weyl groups

In 1990, D.Snow proposed an effective algorithm for computing the orbits...
research
07/14/2020

A Practical Algorithm with Performance Guarantees for the Art Gallery Problem

Given a closed simple polygon P, we say two points p,q see each other if...
research
09/29/2017

Recognizing Matroids

Let E be a finite set and P, S, L three classes of subsets of E, and ...
research
08/15/2023

Enumerating Tarski fixed points on lattices of binary relations

We study the problem of enumerating Tarski fixed points, focusing on the...

Please sign up or login with your details

Forgot password? Click here to reset