Detailed Information on Publication Record
2017
Algorithmic Solvability of the Lifting Extension Problem
ČADEK, Martin, Marek KRČÁL and Lukáš VOKŘÍNEKBasic information
Original name
Algorithmic Solvability of the Lifting Extension Problem
Authors
ČADEK, Martin (203 Czech Republic, belonging to the institution), Marek KRČÁL (203 Czech Republic) and Lukáš VOKŘÍNEK (203 Czech Republic, guarantor, belonging to the institution)
Edition
Discrete & Computational Geometry, New York, Springer, 2017, 0179-5376
Other information
Language
English
Type of outcome
Článek v odborném periodiku
Field of Study
10101 Pure mathematics
Country of publisher
United States of America
Confidentiality degree
není předmětem státního či obchodního tajemství
References:
Impact factor
Impact factor: 0.672
RIV identification code
RIV/00216224:14310/17:00094956
Organization unit
Faculty of Science
UT WoS
000400072700008
Keywords in English
homotopy classes ; equivariant ; fibrewise ; lifting-extension problem ; algorithmic computation; embeddability; Moore-Postnikov tower
Tags
International impact, Reviewed
Změněno: 28/3/2018 13:12, Ing. Nicole Zrilić
Abstract
V originále
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.
Links
| GBP201/12/G028, research and development project |
|