Higher topological complexity of planar polygon spaces having small genetic codes
| Autor: | Datta, Sutirtha, Daundkar, Navnath, Sarkar, Abhishek |
|---|---|
| Rok vydání: | 2024 |
| Předmět: | |
| Druh dokumentu: | Working Paper |
| Popis: | In this paper, we compute sharp bounds for the higher topological complexity of many planar polygon spaces having small genetic codes. In most of these cases we show that the $k$-th higher topological complexity of planar polygon spaces is either $km$ or $km+1$, where $m$ is their dimension. |
| Databáze: | arXiv |
| Externí odkaz: |
|