{"id":"https://openalex.org/W7124292317","doi":"https://doi.org/10.48550/arxiv.2601.09506","title":"On Numbers of Simplicial Walks and Equivalent Canonizations for Graph Recognition","display_name":"On Numbers of Simplicial Walks and Equivalent Canonizations for Graph Recognition","publication_year":2026,"publication_date":"2026-01-14","ids":{"openalex":"https://openalex.org/W7124292317","doi":"https://doi.org/10.48550/arxiv.2601.09506"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2601.09506","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.09506","pdf_url":null,"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2601.09506","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5123055766","display_name":"Marek \u010cern\u00fd","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"\u010cern\u00fd, Marek","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5123055766"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.4781999886035919,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.4781999886035919,"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/T10142","display_name":"Formal Methods in Verification","score":0.12919999659061432,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.11699999868869781,"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/graph-homomorphism","display_name":"Graph homomorphism","score":0.723800003528595},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.5921000242233276},{"id":"https://openalex.org/keywords/homomorphism","display_name":"Homomorphism","score":0.5849999785423279},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5011000037193298},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3626999855041504},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.3626999855041504}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7501999735832214},{"id":"https://openalex.org/C7036158","wikidata":"https://www.wikidata.org/wiki/Q3385162","display_name":"Graph homomorphism","level":5,"score":0.723800003528595},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6604999899864197},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.6025999784469604},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.5921000242233276},{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.5849999785423279},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5011000037193298},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3626999855041504},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3626999855041504},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.335099995136261},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.3118000030517578},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.28630000352859497},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.27390000224113464},{"id":"https://openalex.org/C156004811","wikidata":"https://www.wikidata.org/wiki/Q2228257","display_name":"Multiplicity (mathematics)","level":2,"score":0.2639000117778778}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2601.09506","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.09506","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2601.09506","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.09506","pdf_url":null,"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.428765207529068}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Two":[0],"graphs":[1],"are":[2,80,129],"isomorphic":[3],"exactly":[4,81,130],"when":[5],"they":[6],"admit":[7],"the":[8,28,56,62,103,106,178,186,205],"same":[9],"number":[10],"of":[11,30,58,65,86,108,113,135,167],"homomorphisms":[12],"from":[13],"every":[14],"graph.":[15],"Hence,":[16],"a":[17,35,120],"graph":[18,37,49,200],"is":[19,54,154,193],"recognized":[20,77,126],"up":[21],"to":[22,34,47,55,105,180,207],"isomorphism":[23,42,63],"by":[24,71,78,94,111,127,143,162],"homomorphism":[25],"counts":[26],"over":[27],"class":[29,38],"all":[31],"graphs.":[32],"Restricting":[33],"specific":[36],"yields":[39],"some":[40],"natural":[41],"relaxations":[43],"and":[44,97,116,145,184,204],"modulates":[45],"recognition":[46],"particular":[48],"properties.":[50],"A":[51],"notable":[52],"restriction":[53,104,206],"classes":[57,107],"bounded":[59,109],"treewidth,":[60],"yielding":[61],"relaxation":[64],"Weisfeiler--Leman":[66],"refinement":[67,121],"(WL),":[68],"as":[69,92],"shown":[70,93],"Dvo\u0159\u00e1k":[72],"[JGT":[73],"2010].":[74],"The":[75,124,189],"properties":[76,125],"WL":[79],"those":[82,131],"definable":[83,132],"in":[84,133,157,165,195],"fragments":[85,134],"first-order":[87,137],"logic":[88,138],"with":[89,139,174],"counting":[90,140],"quantifiers,":[91,141],"Cai,":[95],"F\u00fcrer,":[96],"Immerman":[98],"[Comb.":[99],"1992].":[100],"We":[101,159,170],"characterize":[102],"pathwidth":[110,208],"numbers":[112],"simplicial":[114],"walks,":[115],"formalize":[117],"it":[118],"into":[119],"procedure":[122],"(SW).":[123],"SW":[128,152,164],"restricted-conjunction":[136],"introduced":[142],"Montacute":[144],"Shah":[146],"[LMCS":[147],"2024].":[148],"Unlike":[149],"WL,":[150],"computing":[151],"directly":[153],"not":[155],"polynomial-time":[156],"general.":[158],"address":[160],"this":[161],"representing":[163],"terms":[166],"multiplicity":[168],"automata.":[169],"equip":[171],"these":[172],"automata":[173],"an":[175],"involution,":[176],"simplifying":[177],"canonization":[179],"standard":[181],"forward":[182],"reduction":[183],"omitting":[185],"backward":[187],"one.":[188],"resulting":[190],"canonical":[191],"form":[192],"computable":[194],"time":[196],"$O(kn^{3k})$":[197],"for":[198],"any":[199],"on":[201],"$n$":[202],"vertices":[203],"at":[209],"most":[210],"$k$.":[211]},"counts_by_year":[],"updated_date":"2026-01-16T23:21:37.720618","created_date":"2026-01-16T00:00:00"}