{"id":"https://openalex.org/W7170145948","doi":"https://doi.org/10.4230/lipics.ccc.2026.22","title":"Multilinear Algebraic Branching Programs and the Min-Partition Rank Method","display_name":"Multilinear Algebraic Branching Programs and the Min-Partition Rank Method","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7170145948","doi":"https://doi.org/10.4230/lipics.ccc.2026.22"},"language":"en","primary_location":{"id":"doi:10.4230/lipics.ccc.2026.22","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2026.22","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"type":"conference-paper","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.4230/lipics.ccc.2026.22","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5121157476","display_name":"Th\u00e9o Bor\u00e9m Fabris","orcid":null},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Fabris, Th\u00e9o Bor\u00e9m","raw_affiliation_strings":["University of Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0000-0002-1294-5103","affiliations":[{"raw_affiliation_string":"University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083072245","display_name":"Nutan Limaye","orcid":"https://orcid.org/0000-0002-0238-1674"},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Limaye, Nutan","raw_affiliation_strings":["IT University of Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0000-0002-0238-1674","affiliations":[{"raw_affiliation_string":"IT University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I83467386"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025305994","display_name":"Srikanth Srinivasan","orcid":"https://orcid.org/0000-0001-6491-124X"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Srinivasan, Srikanth","raw_affiliation_strings":["University of Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0000-0001-6491-124X","affiliations":[{"raw_affiliation_string":"University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041051779","display_name":"Amir Yehudayoff","orcid":"https://orcid.org/0000-0002-0177-1814"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]},{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["DK","IL"],"is_corresponding":false,"raw_author_name":"Yehudayoff, Amir","raw_affiliation_strings":["University of Copenhagen, Denmark","Technion-ITT, Haifa, Israel"],"raw_orcid":"https://orcid.org/0000-0002-0177-1814","affiliations":[{"raw_affiliation_string":"University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]},{"raw_affiliation_string":"Technion-ITT, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"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":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/multilinear-map","display_name":"Multilinear map","score":0.9162999987602234},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.6279000043869019},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5871999859809875},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5371999740600586},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.5203999876976013},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47909998893737793},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.43799999356269836}],"concepts":[{"id":"https://openalex.org/C84392682","wikidata":"https://www.wikidata.org/wiki/Q1952404","display_name":"Multilinear map","level":2,"score":0.9162999987602234},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7804999947547913},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.6279000043869019},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5871999859809875},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5371999740600586},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5210000276565552},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.5203999876976013},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5077999830245972},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47909998893737793},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.43799999356269836},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.3398999869823456},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.3181000053882599},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.2973000109195709},{"id":"https://openalex.org/C2988809283","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Combinatorial algorithms","level":2,"score":0.2903999984264374},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2842999994754791},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2770000100135803},{"id":"https://openalex.org/C153046414","wikidata":"https://www.wikidata.org/wiki/Q12482","display_name":"Set theory","level":3,"score":0.2531000077724457}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4230/lipics.ccc.2026.22","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2026.22","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"doi:10.4230/lipics.ccc.2026.22","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2026.22","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"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":{"It":[0],"is":[1,53,229],"a":[2,39,108,122,151,159,178,194,274,296],"long-standing":[3],"open":[4],"problem":[5],"in":[6,210,340],"algebraic":[7,15,277],"complexity":[8,278],"to":[9,55,66,88,107,252,306],"prove":[10,56,67,89,150,329],"lower":[11,22,60,69,90,137,257,326],"bounds":[12,23,70,91,216,258],"against":[13],"multilinear":[14,59,184],"branching":[16],"programs":[17],"(mlABPs),":[18],"however":[19],"the":[20,34,42,72,81,84,93,99,113,126,135,144,156,281,290,303],"best":[21,136],"are":[24,217,335],"still":[25],"quadratic":[26],"(Alon,":[27],"Kumar":[28],"and":[29,97,183,189,248,254,280,319],"Volk":[30],"(Combinatorica":[31],"2020)).":[32],"At":[33],"same":[35],"time,":[36],"it":[37],"remains":[38],"possibility":[40],"that":[41,139,224,244,330],"\"min-partition":[43],"rank\"":[44],"method":[45,87,106],"introduced":[46],"by":[47],"Raz":[48],"(Theory":[49],"Comput.":[50],"2006),":[51],"which":[52,214],"used":[54,65],"all":[57],"known":[58,218,256],"bounds,":[61],"can":[62,140],"also":[63,249],"be":[64,141],"superpolynomial":[68,179],"on":[71,92,155,302],"size":[73,94,115,157],"of":[74,83,95,116,128,158,170,206,261,283,299],"mlABPs.":[75],"In":[76,125],"this":[77,105,131,163,176],"paper,":[78],"we":[79,201,328],"analyze":[80],"potential":[82],"min-partition":[85,145],"rank":[86,146],"mlABPs,":[96],"show":[98,223],"following":[100],"results:":[101],"1)":[102],"We":[103,149,222],"relate":[104],"purely":[109],"combinatorial":[110,132,164,204,242],"question":[111],"regarding":[112],"minimum":[114],"set":[117,160,174,227],"systems":[118],"whose":[119],"chains":[120],"satisfy":[121],"discrepancy":[123],"condition.":[124],"case":[127],"set-multilinear":[129,263],"ABPs,":[130],"measure":[133],"characterizes":[134],"bound":[138,154,288],"achieved":[142],"via":[143,193,219],"method.":[147],"2)":[148],"non-trivial":[152],"upper":[153,287],"system":[161,228],"satisfying":[162,233],"property.":[165,235],"Together":[166],"with":[167,293],"our":[168,234,239,325],"construction":[169],"full-rank":[171],"mlABPs":[172,182],"from":[173,232,337],"systems,":[175],"recovers":[177],"separation":[180],"between":[181,276],"formulas":[185],"(Dvir,":[186],"Malod,":[187],"Perifel":[188],"Yehudayoff":[190],"(STOC":[191],"2012))":[192],"conceptually":[195],"different":[196],"proof.":[197],"3)":[198],"The":[199],"property":[200],"study":[202],"extends":[203],"notions":[205],"\"balancing":[207],"sets\"":[208],"considered":[209],"previous":[211,246],"works,":[212],"for":[213,259,324],"near-tight":[215],"intervals":[220,226],"families.":[221],"any":[225],"very":[230],"far":[231],"This":[236],"showcases":[237],"how":[238],"methods":[240],"capture":[241],"structures":[243],"evade":[245],"techniques,":[247],"allows":[250],"us":[251],"improve":[253],"generalize":[255],"sum":[260],"ordered":[262],"ABPs":[264],"(Chatterjee,":[265],"Kush,":[266],"Saraf,":[267],"Shpilka":[268],"(CCC":[269],"2024)).":[270],"These":[271],"results":[272],"build":[273],"bridge":[275],"theory":[279],"behavior":[282],"random":[284,297,333],"walks.":[285],"Our":[286],"uses":[289],"fact":[291],"that,":[292],"noticeable":[294],"probability,":[295],"walk":[298],"length":[300],"n":[301,315],"integers":[304],"returns":[305],"its":[307],"starting":[308],"point":[309],"at":[310],"least":[311],"once":[312],"every":[313],"n/log":[314],"steps":[316],"(Cs\u00e1ki,":[317],"Erd\u0151s,":[318],"R\u00e9v\u00e9sz":[320],"(PTRF":[321],"1985)),":[322],"while,":[323],"bound,":[327],"two":[331],"independent":[332],"walks":[334],"\"far\"":[336],"each":[338],"other":[339],"discrete":[341],"Fr\u00e9chet":[342],"distance.":[343]},"counts_by_year":[],"updated_date":"2026-07-24T06:07:23.975819","created_date":"2026-07-24T00:00:00"}