Algorithms for Embeddings and Homotopy Theory

Project Period: 2018-05-01 – 2022-04-30
Externally Funded
Principal Investigator
Uli Wagner
Department(s)
Wagner Group
Grant Number
P31312
Funding Organisation
FWF

8 Publications

2020 | Conference Paper | IST-REx-ID: 7806 | OA
Embeddability of simplicial complexes is undecidable
M. Filakovský, U. Wagner, S.Y. Zhechev, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2020, pp. 767–785.
[Published Version] View | DOI | Download Published Version (ext.)
 
2020 | Conference Paper | IST-REx-ID: 7991 | OA
Homotopic curve shortening and the affine curve-shortening flow
S. Avvakumov, G. Nivasch, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
[Published Version] View | Files available | DOI | arXiv
 
2021 | Journal Article | IST-REx-ID: 10220 | OA
Eliminating higher-multiplicity intersections. III. Codimension 2
S. Avvakumov, I. Mabillard, A.B. Skopenkov, U. Wagner, Israel Journal of Mathematics 245 (2021) 501–534.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2020 | Journal Article | IST-REx-ID: 6563 | OA
Are two given maps homotopic? An algorithmic viewpoint
M. Filakovský, L. Vokřínek, Foundations of Computational Mathematics 20 (2020) 311–330.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Preprint | IST-REx-ID: 8182 | OA [Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
2019 | Preprint | IST-REx-ID: 8185 | OA
Envy-free division using mapping degree
S. Avvakumov, R. Karasev, ArXiv (n.d.).
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2019 | Preprint | IST-REx-ID: 8184 | OA
Stronger counterexamples to the topological Tverberg conjecture
S. Avvakumov, R. Karasev, A. Skopenkov, ArXiv (n.d.).
[Preprint] View | Files available | Download Preprint (ext.) | WoS | arXiv
 
2024 | Conference Paper | IST-REx-ID: 15168 | OA
Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs
M. Filakovský, T.V. Nakajima, J. Opršal, G. Tasinato, U. Wagner, in:, 41st International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version] View | Files available | DOI | arXiv