{"id":"https://openalex.org/W3183451329","doi":"https://doi.org/10.1145/3558554","title":"Inapproximability of Counting Hypergraph Colourings","display_name":"Inapproximability of Counting Hypergraph Colourings","publication_year":2022,"publication_date":"2022-09-02","ids":{"openalex":"https://openalex.org/W3183451329","doi":"https://doi.org/10.1145/3558554","mag":"3183451329"},"language":"en","primary_location":{"id":"doi:10.1145/3558554","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3558554","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hdl.handle.net/20.500.11820/062783a3-ffb8-4db1-bd8d-2aba9e213067","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089713528","display_name":"Andreas Galanis","orcid":"https://orcid.org/0000-0003-3579-6531"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Andreas Galanis","raw_affiliation_strings":["University of Oxford, Oxford"],"affiliations":[{"raw_affiliation_string":"University of Oxford, Oxford","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100354396","display_name":"Heng Guo","orcid":"https://orcid.org/0000-0001-8199-5596"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Heng Guo","raw_affiliation_strings":["University of Edinburgh, Edinburgh, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh, Edinburgh, United Kingdom","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101984439","display_name":"Jiaheng Wang","orcid":"https://orcid.org/0000-0002-5191-545X"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Jiaheng Wang","raw_affiliation_strings":["University of Edinburgh, Edinburgh, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh, Edinburgh, United Kingdom","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5089713528"],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":1.4803,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.81695093,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"14","issue":"3-4","first_page":"1","last_page":"33"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9998000264167786,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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.9977999925613403,"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/hypergraph","display_name":"Hypergraph","score":0.8746293783187866},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7513824701309204},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6846693754196167},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.6416953802108765},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6319581270217896},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.62779301404953},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5747808218002319},{"id":"https://openalex.org/keywords/exponent","display_name":"Exponent","score":0.5697528123855591},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5668569803237915},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5665369033813477},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.5653172731399536},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.508569598197937},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.5067320466041565},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4995903968811035},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.49817728996276855},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4750347435474396},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4713442027568817},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.42542245984077454},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3991701602935791},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.3963261842727661},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.13169828057289124},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10730519890785217}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.8746293783187866},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7513824701309204},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6846693754196167},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.6416953802108765},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6319581270217896},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.62779301404953},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5747808218002319},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.5697528123855591},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5668569803237915},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5665369033813477},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.5653172731399536},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.508569598197937},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.5067320466041565},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4995903968811035},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.49817728996276855},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4750347435474396},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4713442027568817},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.42542245984077454},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3991701602935791},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3963261842727661},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13169828057289124},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10730519890785217},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3558554","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3558554","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:ff2bfdc2-1343-4ced-aeeb-7d45dea10fe5","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:ff2bfdc2-1343-4ced-aeeb-7d45dea10fe5","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symplectic Elements","raw_type":"Journal article"},{"id":"pmh:oai:pure.ed.ac.uk:publications/062783a3-ffb8-4db1-bd8d-2aba9e213067","is_oa":true,"landing_page_url":"https://hdl.handle.net/20.500.11820/062783a3-ffb8-4db1-bd8d-2aba9e213067","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:pure.ed.ac.uk:publications/062783a3-ffb8-4db1-bd8d-2aba9e213067","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/062783a3-ffb8-4db1-bd8d-2aba9e213067","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Galanis, A, Guo, H & Wang, J 2023, 'Inapproximability of counting hypergraph colourings', ACM Transactions on Computation Theory, vol. 14, no. 3-4, 10. https://doi.org/10.1145/3558554","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:publications/062783a3-ffb8-4db1-bd8d-2aba9e213067","is_oa":true,"landing_page_url":"https://hdl.handle.net/20.500.11820/062783a3-ffb8-4db1-bd8d-2aba9e213067","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W1531368347","https://openalex.org/W1539191226","https://openalex.org/W1728703596","https://openalex.org/W1776308369","https://openalex.org/W1986631610","https://openalex.org/W1987107795","https://openalex.org/W2000171675","https://openalex.org/W2000992447","https://openalex.org/W2012391569","https://openalex.org/W2016602690","https://openalex.org/W2022392080","https://openalex.org/W2036930319","https://openalex.org/W2037616236","https://openalex.org/W2048759201","https://openalex.org/W2060159282","https://openalex.org/W2084392902","https://openalex.org/W2099650681","https://openalex.org/W2104183200","https://openalex.org/W2109693504","https://openalex.org/W2128452148","https://openalex.org/W2170305306","https://openalex.org/W2171872921","https://openalex.org/W2395370258","https://openalex.org/W2536405182","https://openalex.org/W2549123310","https://openalex.org/W2913507641","https://openalex.org/W2914272038","https://openalex.org/W2938658492","https://openalex.org/W2952323594","https://openalex.org/W2962726369","https://openalex.org/W2963795759","https://openalex.org/W2966749622","https://openalex.org/W2982983336","https://openalex.org/W3005839441","https://openalex.org/W3035532193","https://openalex.org/W3101482641","https://openalex.org/W3102182509","https://openalex.org/W3111890340","https://openalex.org/W3157711583","https://openalex.org/W3168950915","https://openalex.org/W4214939553","https://openalex.org/W4238583669","https://openalex.org/W6609081089","https://openalex.org/W6647033434","https://openalex.org/W6711567417","https://openalex.org/W6729771797"],"related_works":["https://openalex.org/W3096775781","https://openalex.org/W2623778450","https://openalex.org/W2331597986","https://openalex.org/W2154044080","https://openalex.org/W3005925191","https://openalex.org/W4221160330","https://openalex.org/W4362715178","https://openalex.org/W3183451329","https://openalex.org/W1964923287","https://openalex.org/W2951030425"],"abstract_inverted_index":{"Recent":[0],"developments":[1],"in":[2,9,51,57,70,157,237,313,319,351],"approximate":[3,251],"counting":[4,86,134,212],"have":[5],"made":[6],"startling":[7],"progress":[8],"developing":[10],"fast":[11],"algorithmic":[12],"methods":[13,40],"for":[14,41,125,169,174,210,240,294],"approximating":[15],"the":[16,31,36,67,82,126,133,136,148,152,155,190,193,211,218,252,281,295,302,314,325,330,334,339,344,352,354,363,366,374],"number":[17,253],"of":[18,38,73,84,129,147,154,159,220,254,304,329,333,343,365,376],"solutions":[19,342],"to":[20,30,55,203,232,250,289,323,348],"constraint":[21],"satisfaction":[22],"problems":[23],"(CSPs)":[24],"with":[25,43,93],"large":[26],"arities,":[27],"using":[28],"connections":[29],"Lov\u00e1sz":[32,194],"Local":[33,195],"Lemma.":[34,196],"Nevertheless,":[35],"boundaries":[37],"these":[39],"CSPs":[42],"non-Boolean":[44],"domain":[45],"are":[46],"not":[47,122],"well-understood.":[48],"Our":[49,197,262],"goal":[50],"this":[52,58,71,163],"article":[53],"is":[54,121,138,144,202,228,247,264,277,322],"fill":[56],"gap":[59],"and":[60,142,199,224,360,372,380],"obtain":[61,204],"strong":[62],"inapproximability":[63],"results":[64],"by":[65,279],"studying":[66],"prototypical":[68],"problem":[69,83,128,213,368],"class":[72],"CSPs,":[74],"hypergraph":[75,284],"colourings.":[76,131],"More":[77],"precisely,":[78],"we":[79,165,226],"focus":[80],"on":[81,89,178,266,274],"approximately":[85],"q":[87,171,243,259],"-colourings":[88],"K":[90,160,186,282],"-uniform":[91],"hypergraphs":[92,180],"bounded":[94],"degree":[95],"\u0394.":[96],"An":[97],"efficient":[98],"algorithm":[99,191],"exists":[100],"if":[101],"\\({{\\Delta":[102],"\\lesssim":[103],"\\frac{q^{K/3-1}}{4^KK^2}}}\\)":[104],"[Jain":[105],"et":[106,111],"al.":[107,112],"25":[108],";":[109],"He":[110],"23":[113],"].":[114],"Somewhat":[115],"surprisingly":[116],"however,":[117],"a":[118,176,205,222],"hardness":[119,173,219],"bound":[120,209],"known":[123],"even":[124,139,242],"easier":[127],"finding":[130,175,221],"For":[132],"problem,":[135],"situation":[137],"less":[140],"clear":[141],"there":[143],"no":[145],"evidence":[146],"right":[149],"constant":[150,233],"controlling":[151],"growth":[153],"exponent":[156],"terms":[158],".":[161,261],"To":[162],"end,":[164],"first":[166],"establish":[167],"that":[168,214,239,309],"general":[170],"computational":[172],"colouring":[177,223],"simple/linear":[179],"occurs":[181],"at":[182],"\u0394":[183,257],"\u2273":[184,258],"Kq":[185],",":[187],"almost":[188],"matching":[189],"from":[192],"second":[198],"main":[200],"contribution":[201],"far":[206],"more":[207,370],"refined":[208],"goes":[215],"well":[216],"beyond":[217],"which":[225,276,298,337],"conjecture":[227],"asymptotically":[229],"tight":[230],"(up":[231],"factors).":[234],"We":[235],"show":[236],"particular":[238],"all":[241],"\u2265":[244],"4":[245],"it":[246],"NP":[248],"-hard":[249],"colourings":[255],"when":[256],"K/2":[260],"approach":[263],"based":[265],"considering":[267],"an":[268],"auxiliary":[269,355],"weighted":[270],"binary":[271],"CSP":[272,336,356],"model":[273],"graphs,":[275],"obtained":[278],"\u201chalving\u201d":[280],"-ary":[283],"constraints.":[285],"This":[286],"allows":[287],"us":[288],"utilise":[290],"reduction":[291],"techniques":[292],"available":[293],"graph":[296],"case,":[297],"hinge":[299],"upon":[300],"understanding":[301],"behaviour":[303],"random":[305],"regular":[306],"bipartite":[307],"graphs":[308],"serve":[310],"as":[311],"gadgets":[312],"reduction.":[315],"The":[316],"major":[317],"challenge":[318],"our":[320],"setting":[321],"analyse":[324],"induced":[326],"matrix":[327,332],"norm":[328],"interaction":[331],"new":[335],"captures":[338],"most":[340],"likely":[341],"system.":[345],"In":[346],"contrast":[347],"previous":[349],"analyses":[350],"literature,":[353],"demonstrates":[357],"both":[358],"symmetry":[359],"asymmetry,":[361],"making":[362],"analysis":[364],"optimisation":[367],"severely":[369],"complicated":[371],"demanding":[373],"combination":[375],"delicate":[377],"perturbation":[378],"arguments":[379],"careful":[381],"asymptotic":[382],"estimates.":[383]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}