{"publication_status":"published","oa":1,"oa_version":"Preprint","isi":1,"article_type":"original","intvolume":"        65","volume":65,"month":"01","date_updated":"2023-09-11T13:38:49Z","date_created":"2018-12-11T11:46:24Z","department":[{"_id":"UlWa"}],"_id":"425","title":"Embeddability in the 3-Sphere is decidable","author":[{"first_name":"Jiří","last_name":"Matoušek","full_name":"Matoušek, Jiří"},{"first_name":"Eric","full_name":"Sedgwick, Eric","last_name":"Sedgwick"},{"first_name":"Martin","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","last_name":"Tancer","full_name":"Tancer, Martin","orcid":"0000-0002-1191-6714"},{"first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Uli","last_name":"Wagner","orcid":"0000-0002-1494-0568"}],"article_number":"5","year":"2018","type":"journal_article","citation":{"ieee":"J. Matoušek, E. Sedgwick, M. Tancer, and U. Wagner, “Embeddability in the 3-Sphere is decidable,” <i>Journal of the ACM</i>, vol. 65, no. 1. ACM, 2018.","ama":"Matoušek J, Sedgwick E, Tancer M, Wagner U. Embeddability in the 3-Sphere is decidable. <i>Journal of the ACM</i>. 2018;65(1). doi:<a href=\"https://doi.org/10.1145/3078632\">10.1145/3078632</a>","chicago":"Matoušek, Jiří, Eric Sedgwick, Martin Tancer, and Uli Wagner. “Embeddability in the 3-Sphere Is Decidable.” <i>Journal of the ACM</i>. ACM, 2018. <a href=\"https://doi.org/10.1145/3078632\">https://doi.org/10.1145/3078632</a>.","apa":"Matoušek, J., Sedgwick, E., Tancer, M., &#38; Wagner, U. (2018). Embeddability in the 3-Sphere is decidable. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/3078632\">https://doi.org/10.1145/3078632</a>","short":"J. Matoušek, E. Sedgwick, M. Tancer, U. Wagner, Journal of the ACM 65 (2018).","mla":"Matoušek, Jiří, et al. “Embeddability in the 3-Sphere Is Decidable.” <i>Journal of the ACM</i>, vol. 65, no. 1, 5, ACM, 2018, doi:<a href=\"https://doi.org/10.1145/3078632\">10.1145/3078632</a>.","ista":"Matoušek J, Sedgwick E, Tancer M, Wagner U. 2018. Embeddability in the 3-Sphere is decidable. Journal of the ACM. 65(1), 5."},"scopus_import":"1","doi":"10.1145/3078632","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","issue":"1","language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"2157"}]},"article_processing_charge":"No","publist_id":"7398","abstract":[{"text":"We show that the following algorithmic problem is decidable: given a 2-dimensional simplicial complex, can it be embedded (topologically, or equivalently, piecewise linearly) in R3? By a known reduction, it suffices to decide the embeddability of a given triangulated 3-manifold X into the 3-sphere S3. The main step, which allows us to simplify X and recurse, is in proving that if X can be embedded in S3, then there is also an embedding in which X has a short meridian, that is, an essential curve in the boundary of X bounding a disk in S3 \\ X with length bounded by a computable function of the number of tetrahedra of X.","lang":"eng"}],"publisher":"ACM","publication":"Journal of the ACM","external_id":{"isi":["000425685900006"],"arxiv":["1402.0815"]},"quality_controlled":"1","project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1402.0815"}],"date_published":"2018-01-01T00:00:00Z","status":"public","ec_funded":1,"day":"01"}