{"id":"https://openalex.org/W4416182732","doi":"https://doi.org/10.37236/13879","title":"Equality on all #CSP Instances Yields Constraint Function Isomorphism via Interpolation and Intertwiners","display_name":"Equality on all #CSP Instances Yields Constraint Function Isomorphism via Interpolation and Intertwiners","publication_year":2025,"publication_date":"2025-11-13","ids":{"openalex":"https://openalex.org/W4416182732","doi":"https://doi.org/10.37236/13879"},"language":null,"primary_location":{"id":"doi:10.37236/13879","is_oa":true,"landing_page_url":"https://doi.org/10.37236/13879","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v32i4p42/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v32i4p42/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101552771","display_name":"Benjamin Young","orcid":"https://orcid.org/0009-0009-2760-350X"},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ben Young","raw_affiliation_strings":["University of Wisconsin-Madison"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Wisconsin-Madison","institution_ids":["https://openalex.org/I135310074"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101552771"],"corresponding_institution_ids":["https://openalex.org/I135310074"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.32144048,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"32","issue":"4","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.42410001158714294,"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.42410001158714294,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.19599999487400055,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.05939999967813492,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/homomorphism","display_name":"Homomorphism","score":0.6542999744415283},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.5127999782562256},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.4108999967575073},{"id":"https://openalex.org/keywords/isomorphism-theorem","display_name":"Isomorphism theorem","score":0.41019999980926514},{"id":"https://openalex.org/keywords/algebra-homomorphism","display_name":"Algebra homomorphism","score":0.3935999870300293},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.34310001134872437},{"id":"https://openalex.org/keywords/constructive-proof","display_name":"Constructive proof","score":0.3391999900341034},{"id":"https://openalex.org/keywords/graph-homomorphism","display_name":"Graph homomorphism","score":0.3278999924659729},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.3215999901294708}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7526000142097473},{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.6542999744415283},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5580000281333923},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.5127999782562256},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.4108999967575073},{"id":"https://openalex.org/C26231708","wikidata":"https://www.wikidata.org/wiki/Q1065966","display_name":"Isomorphism theorem","level":2,"score":0.41019999980926514},{"id":"https://openalex.org/C175316100","wikidata":"https://www.wikidata.org/wiki/Q3882299","display_name":"Algebra homomorphism","level":3,"score":0.3935999870300293},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3779999911785126},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.34310001134872437},{"id":"https://openalex.org/C202854965","wikidata":"https://www.wikidata.org/wiki/Q3044470","display_name":"Constructive proof","level":2,"score":0.3391999900341034},{"id":"https://openalex.org/C7036158","wikidata":"https://www.wikidata.org/wiki/Q3385162","display_name":"Graph homomorphism","level":5,"score":0.3278999924659729},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.3215999901294708},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.31139999628067017},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.2930000126361847},{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.2915000021457672},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.27950000762939453},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.27489998936653137},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.27219998836517334},{"id":"https://openalex.org/C12595997","wikidata":"https://www.wikidata.org/wiki/Q739245","display_name":"Extremal graph theory","level":5,"score":0.2718999981880188},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.26980000734329224},{"id":"https://openalex.org/C55294529","wikidata":"https://www.wikidata.org/wiki/Q579544","display_name":"Vandermonde matrix","level":3,"score":0.2606000006198883},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2565999925136566},{"id":"https://openalex.org/C3746008","wikidata":"https://www.wikidata.org/wiki/Q981351","display_name":"Symmetric function","level":2,"score":0.25429999828338623},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.2533000111579895}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/13879","is_oa":true,"landing_page_url":"https://doi.org/10.37236/13879","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v32i4p42/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.37236/13879","is_oa":true,"landing_page_url":"https://doi.org/10.37236/13879","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v32i4p42/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4416182732.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"A":[0],"fundamental":[1],"result":[2,41],"in":[3,135,139,180],"the":[4,23,120,133,160,163,174,181,189,203,206],"study":[5],"of":[6,26,37,46,64,83,105,124,147,162,166,177,183,188,205,211,233],"graph":[7,68],"homomorphisms":[8,27,69],"is":[9,70,128],"Lov\u00e1sz's":[10,40,91],"theorem":[11,92],"that":[12,50,98,118],"two":[13,100,143],"graphs":[14,47,54],"are":[15,108,115],"isomorphic":[16,109],"if":[17,20,110,113],"and":[18,32,57,103,111,185,194,213],"only":[19,112],"they":[21,114],"admit":[22],"same":[24],"number":[25],"from":[28,60,173,230],"every":[29],"graph.":[30],"Cai":[31,212],"Govorov":[33,214],"capped":[34],"a":[35,71,79,153,167,171,222],"line":[36],"work":[38],"extending":[39,216],"to":[42,93,218],"more":[43],"general":[44,94,219],"types":[45],"by":[48,78,96,215],"showing":[49,97],"it":[51,217],"holds":[52],"for":[53,155,225],"with":[55,137,228],"vertex":[56],"edge":[58],"weights":[59],"an":[61],"arbitrary":[62],"field":[63,232],"characteristic":[65,234],"zero.":[66,235],"Counting":[67],"counting":[72],"constraint":[73,81,106,157,168,226],"satisfaction":[74],"problem":[75],"(#CSP)":[76],"parameterized":[77],"single":[80],"function":[82,122,169],"arity":[84],"two.":[85],"In":[86],"this":[87,148],"work,":[88],"we":[89,131,151,201],"extend":[90],"#CSP":[95,126],"any":[99,125,231],"sets":[101],"$\\mathcal{F}$":[102,136],"$\\mathcal{G}$":[104],"functions":[107,134,158,227],"#CSP-indistinguishable":[116],"--":[117],"is,":[119],"partition":[121],"value":[123],"instance":[127],"unchanged":[129],"when":[130],"replace":[132],"those":[138],"$\\mathcal{G}$.":[140],"We":[141],"give":[142,152],"very":[144],"different":[145],"proofs":[146],"result.":[149],"First,":[150],"proof":[154,187,224],"complex-valued":[156],"using":[159],"intertwiners":[161],"automorphism":[164],"group":[165],"set,":[170],"concept":[172],"representation":[175],"theory":[176],"compact":[178],"groups,":[179],"style":[182],"Man\u010dinska":[184],"Roberson's":[186],"equivalence":[190],"between":[191],"quantum":[192],"isomorphism":[193],"homomorphism":[195],"indistinguishability":[196],"over":[197],"planar":[198],"graphs.":[199],"Second,":[200],"demonstrate":[202],"power":[204],"simple":[207],"Vandermonde":[208],"interpolation":[209],"technique":[210],"#CSP,":[220],"giving":[221],"constructive":[223],"entries":[229]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-11-13T00:00:00"}