ČADEK, Martin, Marek KRČÁL and Lukáš VOKŘÍNEK. Algorithmic Solvability of the Lifting Extension Problem. Discrete & Computational Geometry. New York: Springer, 2017, vol. 57, No 4, p. 915-965. ISSN 0179-5376. Available from: https://dx.doi.org/10.1007/s00454-016-9855-6. |
Other formats:
BibTeX
LaTeX
RIS
@article{1390095, author = {Čadek, Martin and Krčál, Marek and Vokřínek, Lukáš}, article_location = {New York}, article_number = {4}, doi = {http://dx.doi.org/10.1007/s00454-016-9855-6}, keywords = {homotopy classes ; equivariant ; fibrewise ; lifting-extension problem ; algorithmic computation; embeddability; Moore-Postnikov tower}, language = {eng}, issn = {0179-5376}, journal = {Discrete & Computational Geometry}, title = {Algorithmic Solvability of the Lifting Extension Problem}, url = {https://link.springer.com/article/10.1007%2Fs00454-016-9855-6}, volume = {57}, year = {2017} }
TY - JOUR ID - 1390095 AU - Čadek, Martin - Krčál, Marek - Vokřínek, Lukáš PY - 2017 TI - Algorithmic Solvability of the Lifting Extension Problem JF - Discrete & Computational Geometry VL - 57 IS - 4 SP - 915-965 EP - 915-965 PB - Springer SN - 01795376 KW - homotopy classes KW - equivariant KW - fibrewise KW - lifting-extension problem KW - algorithmic computation KW - embeddability KW - Moore-Postnikov tower UR - https://link.springer.com/article/10.1007%2Fs00454-016-9855-6 L2 - https://link.springer.com/article/10.1007%2Fs00454-016-9855-6 N2 - Let X and Y be finite simplicial sets, both equipped with a free simplicial action of a finite group. Assuming that Y is d-connected and dimX less orequal to 2d, we provide an algorithm that computes the set of all equivariant homotopy classes of equivariant continuous maps between geometric realizations of X and Y. This yields the first algorithm for deciding topological embeddability of a k-dimensional finite simplicial complex into n-dimensional Euclidean space under certain conditions on k and n. ER -
ČADEK, Martin, Marek KRČÁL and Lukáš VOKŘÍNEK. Algorithmic Solvability of the Lifting Extension Problem. \textit{Discrete \&{} Computational Geometry}. New York: Springer, 2017, vol.~57, No~4, p.~915-965. ISSN~0179-5376. Available from: https://dx.doi.org/10.1007/s00454-016-9855-6.
|