{"id":"https://openalex.org/W1596349602","doi":"https://doi.org/10.1137/120891204","title":"Nerves of Good Covers Are Algorithmically Unrecognizable","display_name":"Nerves of Good Covers Are Algorithmically Unrecognizable","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W1596349602","doi":"https://doi.org/10.1137/120891204","mag":"1596349602"},"language":"en","primary_location":{"id":"doi:10.1137/120891204","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120891204","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1205.6082","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Martin Tancer","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Martin Tancer","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Dmitry Tonkonog","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dmitry Tonkonog","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.04476573,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"42","issue":"4","first_page":"1697","last_page":"1719"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12536","display_name":"Topological and Geometric Data Analysis","score":0.49619999527931213,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12536","display_name":"Topological and Geometric Data Analysis","score":0.49619999527931213,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.4097000062465668,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.02070000022649765,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/contractible-space","display_name":"Contractible space","score":0.8463000059127808},{"id":"https://openalex.org/keywords/simplicial-complex","display_name":"Simplicial complex","score":0.8363000154495239},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.6901000142097473},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6504999995231628},{"id":"https://openalex.org/keywords/simplicial-approximation-theorem","display_name":"Simplicial approximation theorem","score":0.5047000050544739},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.49129998683929443},{"id":"https://openalex.org/keywords/abstract-simplicial-complex","display_name":"Abstract simplicial complex","score":0.45899999141693115}],"concepts":[{"id":"https://openalex.org/C169611556","wikidata":"https://www.wikidata.org/wiki/Q230689","display_name":"Contractible space","level":2,"score":0.8463000059127808},{"id":"https://openalex.org/C187929450","wikidata":"https://www.wikidata.org/wiki/Q994399","display_name":"Simplicial complex","level":2,"score":0.8363000154495239},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.6901000142097473},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.679099977016449},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6504999995231628},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5414000153541565},{"id":"https://openalex.org/C64245159","wikidata":"https://www.wikidata.org/wiki/Q3983972","display_name":"Simplicial approximation theorem","level":5,"score":0.5047000050544739},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.49129998683929443},{"id":"https://openalex.org/C146867743","wikidata":"https://www.wikidata.org/wiki/Q4669959","display_name":"Abstract simplicial complex","level":3,"score":0.45899999141693115},{"id":"https://openalex.org/C143392562","wikidata":"https://www.wikidata.org/wiki/Q449111","display_name":"Subdivision","level":2,"score":0.4390000104904175},{"id":"https://openalex.org/C3469331","wikidata":"https://www.wikidata.org/wiki/Q7520902","display_name":"Simplicial homology","level":3,"score":0.382099986076355},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3434999883174896},{"id":"https://openalex.org/C162329640","wikidata":"https://www.wikidata.org/wiki/Q332648","display_name":"Covering space","level":2,"score":0.3310000002384186},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32820001244544983},{"id":"https://openalex.org/C127634017","wikidata":"https://www.wikidata.org/wiki/Q5627866","display_name":"h-vector","level":3,"score":0.2662999927997589},{"id":"https://openalex.org/C182950735","wikidata":"https://www.wikidata.org/wiki/Q1930978","display_name":"Tensegrity","level":2,"score":0.2599000036716461},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.25870001316070557},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.25209999084472656}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/120891204","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120891204","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1205.6082","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1205.6082","pdf_url":"https://arxiv.org/pdf/1205.6082","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1205.6082","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1205.6082","pdf_url":"https://arxiv.org/pdf/1205.6082","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5566021001","display_name":null,"funder_award_id":"P202/12/G061","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"},{"id":"https://openalex.org/G6471918000","display_name":null,"funder_award_id":"G34.31.0053","funder_id":"https://openalex.org/F4320321079","funder_display_name":"Russian Foundation for Basic Research"}],"funders":[{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"},{"id":"https://openalex.org/F4320321079","display_name":"Russian Foundation for Basic Research","ror":"https://ror.org/02mh1ke95"},{"id":"https://openalex.org/F4320329640","display_name":"Independent University, Bangladesh","ror":"https://ror.org/05qbbf772"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W749223900","https://openalex.org/W2004459113","https://openalex.org/W2009406359","https://openalex.org/W2009820254","https://openalex.org/W2015798421","https://openalex.org/W2024071496","https://openalex.org/W2053369489","https://openalex.org/W2079885899","https://openalex.org/W2085366727","https://openalex.org/W2325821690"],"related_works":[],"abstract_inverted_index":{"A":[0,82],"good":[1,36,49,61,79,97,128],"cover":[2,62,80,98],"in":[3,12,66,99],"$\\mathbb{R}^d$":[4,13],"is":[5,21,44,85,90,105,112,150,157,177,186],"a":[6,60,67,71,96,108,147,169,174],"collection":[7],"of":[8,18,35,48,59,77,95,173],"open":[9,137],"contractible":[10,23],"sets":[11],"such":[14],"that":[15,45,103,145,167],"the":[16,56,78,93,184],"intersection":[17,33,46,57],"any":[19,116],"subcollection":[20],"either":[22],"or":[24,133],"empty.":[25],"Motivated":[26],"by":[27,136],"an":[28,140],"analogy":[29],"with":[30,130,134,165],"convex":[31],"sets,":[32],"patterns":[34,47],"covers":[37,50,129,132,135],"were":[38],"studied":[39],"intensively.":[40],"Our":[41],"main":[42],"result":[43,122,142,164],"are":[51],"algorithmically":[52],"unrecognizable.":[53],"More":[54],"precisely,":[55],"pattern":[58],"can":[63],"be":[64],"stored":[65],"simplicial":[68,83,110,148],"complex":[69,84,111,149,176,185],"called":[70],"nerve":[72,94],"which":[73,75],"records":[74],"subfamilies":[76],"intersect.":[81],"topologically":[86,113,158],"$d$-representable":[87,114,178],"if":[88,125,146,168],"it":[89,104,156],"isomorphic":[91],"to":[92],"$\\mathbb{R}^d$.":[100,190],"We":[101,160],"prove":[102,144],"undecidable":[106],"whether":[107],"given":[109],"for":[115],"fixed":[117],"$d":[118],"\\geq":[119],"5$.":[120],"The":[121],"remains":[123],"valid":[124],"we":[126,143],"replace":[127],"acyclic":[131],"$d$-balls.":[138],"As":[139],"auxiliary":[141],"piecewise-linearly":[151,187],"embeddable":[152,188],"into":[153,189],"$\\mathbb{R}^d$,":[154],"then":[155,183],"$d$-representable.":[159],"also":[161],"supply":[162],"this":[163],"showing":[166],"\u201csufficiently":[170],"fine\u201d":[171],"subdivision":[172],"$k$-dimensional":[175],"and":[179],"$k":[180],"\\leq":[181],"\\frac{2d-3}3$,":[182]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2016-06-24T00:00:00"}