{"id":"https://openalex.org/W7131095762","doi":"https://doi.org/10.48550/arxiv.2602.17942","title":"Convergent Gate Elimination and Constructive Circuit Lower Bounds","display_name":"Convergent Gate Elimination and Constructive Circuit Lower Bounds","publication_year":2026,"publication_date":"2026-02-20","ids":{"openalex":"https://openalex.org/W7131095762","doi":"https://doi.org/10.48550/arxiv.2602.17942"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.17942","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111992439","display_name":"Marco Carmosino","orcid":"https://orcid.org/0009-0007-1118-1352"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Carmosino, Marco","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003564826","display_name":"Ngu Dang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dang, Ngu","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5076242505","display_name":"Tim Jackman","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jackman, Tim","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5111992439"],"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6334999799728394,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6334999799728394,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.16500000655651093,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.0746999979019165,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/constructive","display_name":"Constructive","score":0.6500999927520752},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6391000151634216},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.599399983882904},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5637999773025513},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.552299976348877},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.5486999750137329},{"id":"https://openalex.org/keywords/constructive-proof","display_name":"Constructive proof","score":0.47049999237060547},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.46889999508857727},{"id":"https://openalex.org/keywords/term","display_name":"Term (time)","score":0.45660001039505005},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4242999851703644}],"concepts":[{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.6500999927520752},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6391000151634216},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.599399983882904},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.599399983882904},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5637999773025513},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.552299976348877},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.5486999750137329},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5097000002861023},{"id":"https://openalex.org/C202854965","wikidata":"https://www.wikidata.org/wiki/Q3044470","display_name":"Constructive proof","level":2,"score":0.47049999237060547},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.46889999508857727},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.45660001039505005},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4242999851703644},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.42239999771118164},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4156999886035919},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.37770000100135803},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3596000075340271},{"id":"https://openalex.org/C32946077","wikidata":"https://www.wikidata.org/wiki/Q618079","display_name":"Network analysis","level":2,"score":0.35749998688697815},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.3537999987602234},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.34619998931884766},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3382999897003174},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.33340001106262207},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.3077999949455261},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.29919999837875366},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.29820001125335693},{"id":"https://openalex.org/C9429942","wikidata":"https://www.wikidata.org/wiki/Q1781698","display_name":"Product term","level":5,"score":0.2849999964237213},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.2809000015258789},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27469998598098755},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.2727999985218048},{"id":"https://openalex.org/C167528306","wikidata":"https://www.wikidata.org/wiki/Q5508776","display_name":"Function representation","level":3,"score":0.2727000117301941},{"id":"https://openalex.org/C188183281","wikidata":"https://www.wikidata.org/wiki/Q2898309","display_name":"Parity function","level":4,"score":0.266400009393692},{"id":"https://openalex.org/C182359184","wikidata":"https://www.wikidata.org/wiki/Q1756942","display_name":"Partial function","level":2,"score":0.2662000060081482},{"id":"https://openalex.org/C2776639384","wikidata":"https://www.wikidata.org/wiki/Q840396","display_name":"Ideal (ethics)","level":2,"score":0.26019999384880066},{"id":"https://openalex.org/C190560348","wikidata":"https://www.wikidata.org/wiki/Q3245116","display_name":"Circuit design","level":2,"score":0.2596000134944916},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.2590999901294708},{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.2538999915122986},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2533999979496002},{"id":"https://openalex.org/C94992772","wikidata":"https://www.wikidata.org/wiki/Q6667469","display_name":"Circuit minimization for Boolean functions","level":4,"score":0.25279998779296875},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2515999972820282}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.17942","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.17942","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.17942","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.17942","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Towards":[0],"better":[1],"understanding":[2],"of":[3,45,105,113,125,243],"gate":[4,226,259],"elimination,":[5],"the":[6,67,111,129,152,163,189],"only":[7],"method":[8],"known":[9],"that":[10,56,83,118,151,179,198],"can":[11,235],"prove":[12],"complexity":[13,210],"lower":[14,48,145,168,223,245,253],"bounds":[15,224],"for":[16,183,220],"explicit":[17],"functions":[18],"against":[19],"unrestricted":[20],"Boolean":[21,80],"circuits,":[22],"this":[23,51,249],"work":[24],"contributes:":[25],"(1)":[26],"formalizing":[27],"circuit":[28,57,94,126,144,222,244],"simplifications":[29],"as":[30],"a":[31,40,46,60,142,177,201],"convergent":[32,61,123,233],"term":[33,62],"graph":[34,63],"rewriting":[35,64,77],"system":[36,65,139],"and":[37,42,69,131,195,239],"(2)":[38],"giving":[39],"simple":[41],"constructive":[43,143,167,221,252],"proof":[44],"classical":[47,149],"bound":[49,169,254],"using":[50,232],"system.":[52],"First,":[53],"we":[54,116,135],"show":[55,117],"simplification":[58,85,127,138,234],"is":[59,120,216],"over":[66,128],"DeMorgan":[68,164],"$\\{\\land,":[70],"\\lor,":[71],"\\oplus\\}$":[72],"bases.":[73,133],"We":[74],"define":[75],"local":[76],"rules":[78],"from":[79,225],"identities":[81],"such":[82],"every":[84,184],"sequence":[86],"yields":[87],"an":[88,174],"identical":[89],"final":[90],"result":[91,150],"(up":[92],"to":[93,140,160,187,218,237],"isomorphism":[95],"or":[96],"bisimulation).":[97],"Convergence":[98],"enables":[99],"rigorous":[100],"reasoning":[101],"about":[102,209],"structural":[103],"properties":[104],"simplified":[106],"circuits":[107],"without":[108],"dependence":[109],"on":[110],"order":[112],"simplification.":[114],"Then,":[115,134],"there":[119],"\\emph{no":[121],"similar}":[122],"formalization":[124],"$U_2$":[130],"$B_2$":[132],"use":[136],"our":[137],"give":[141],"bound,":[146],"generalizing":[147],"Schnorr's":[148],"XOR":[153],"function":[154,190],"requires":[155],"$3(n":[156],"-":[157],"1)$":[158],"gates":[159],"compute":[161,188],"in":[162,204],"basis.":[165],"A":[166],"$f":[170],"\\not\\in":[171],"C$":[172],"gives":[173],"algorithm":[175],"(called":[176],"\"refuter\")":[178],"efficiently":[180],"finds":[181],"counter-examples":[182],"$C$-circuit":[185],"trying":[186],"$f$.":[191],"Chen,":[192],"Jin,":[193],"Santhanam,":[194],"Williams":[196],"showed":[197],"constructivity":[199],"plays":[200],"central":[202],"role":[203],"many":[205],"longstanding":[206],"open":[207],"problems":[208],"theory":[211],"(FOCS":[212],"2021),":[213],"so":[214],"it":[215],"natural":[217],"ask":[219],"elimination":[227],"arguments.":[228],"This":[229],"demonstrates":[230],"how":[231],"lead":[236],"shorter":[238],"more":[240],"modular":[241],"proofs":[242],"bounds.":[246],"Furthermore,":[247],"until":[248],"work,":[250],"no":[251],"had":[255],"been":[256],"proved":[257],"via":[258],"elimination.":[260]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-24T00:00:00"}