{"id":"https://openalex.org/W7165045704","doi":"https://doi.org/10.48550/arxiv.2606.17991","title":"Greedy Vector Balancing","display_name":"Greedy Vector Balancing","publication_year":2026,"publication_date":"2026-06-16","ids":{"openalex":"https://openalex.org/W7165045704","doi":"https://doi.org/10.48550/arxiv.2606.17991"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.17991","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.17991","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":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.17991","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5138774308","display_name":"Wojciech Czerwi\u0144ski","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Czerwi\u0144ski, Wojciech","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044591096","display_name":"Daniel Dadush","orcid":"https://orcid.org/0000-0001-5577-5012"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dadush, Daniel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102569675","display_name":"Ekin Ergen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ergen, Ekin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110694812","display_name":"Ashis Ghosh","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ghosh, Arka","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102789796","display_name":"S\u0142awomir Lasota","orcid":"https://orcid.org/0000-0001-8674-4470"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lasota, S\u0142awomir","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5058137701","display_name":"\u0141ukasz Orlikowski","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Orlikowski, \u0141ukasz","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"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":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.8108999729156494,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.8108999729156494,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.04179999977350235,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.025100000202655792,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/linear-subspace","display_name":"Linear subspace","score":0.675599992275238},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6151000261306763},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5157999992370605},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.49129998683929443},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.47909998893737793},{"id":"https://openalex.org/keywords/vector-space","display_name":"Vector space","score":0.45500001311302185},{"id":"https://openalex.org/keywords/unit-vector","display_name":"Unit vector","score":0.44699999690055847},{"id":"https://openalex.org/keywords/ball","display_name":"Ball (mathematics)","score":0.44510000944137573},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.42160001397132874}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6822999715805054},{"id":"https://openalex.org/C12362212","wikidata":"https://www.wikidata.org/wiki/Q728435","display_name":"Linear subspace","level":2,"score":0.675599992275238},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6693000197410583},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6151000261306763},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5157999992370605},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.49129998683929443},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.47909998893737793},{"id":"https://openalex.org/C13336665","wikidata":"https://www.wikidata.org/wiki/Q125977","display_name":"Vector space","level":2,"score":0.45500001311302185},{"id":"https://openalex.org/C84316537","wikidata":"https://www.wikidata.org/wiki/Q36255","display_name":"Unit vector","level":2,"score":0.44699999690055847},{"id":"https://openalex.org/C122041747","wikidata":"https://www.wikidata.org/wiki/Q838611","display_name":"Ball (mathematics)","level":2,"score":0.44510000944137573},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.42160001397132874},{"id":"https://openalex.org/C171739935","wikidata":"https://www.wikidata.org/wiki/Q726210","display_name":"Normed vector space","level":2,"score":0.40560001134872437},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.40290001034736633},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37860000133514404},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.35519999265670776},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.3513000011444092},{"id":"https://openalex.org/C65236422","wikidata":"https://www.wikidata.org/wiki/Q173740","display_name":"Cartesian product","level":2,"score":0.3425999879837036},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.32260000705718994},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.31700000166893005},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3125},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.30809998512268066},{"id":"https://openalex.org/C191948623","wikidata":"https://www.wikidata.org/wiki/Q1307800","display_name":"Unit sphere","level":2,"score":0.28209999203681946},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.28189998865127563},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.27399998903274536},{"id":"https://openalex.org/C150397156","wikidata":"https://www.wikidata.org/wiki/Q591310","display_name":"General position","level":2,"score":0.2669999897480011},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25839999318122864},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.25529998540878296}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.17991","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.17991","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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.17991","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.17991","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":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,44],"online":[1,25,242,254],"vector":[2,53,238,243],"balancing,":[3],"vectors":[4,134,141,157,225],"$t_1,\\dots,t_n$":[5,248],"arrive":[6],"one":[7,9],"by":[8,118,140,179,224],"from":[10],"a":[11,163,171,184,208,213,264,268,277],"given":[12],"set":[13,165,209],"$T$":[14,100,136,166],"and":[15,137,194],"the":[16,31,49,63,84,90,95,114,129,150,176,181,246,292],"goal":[17],"is":[18,66,83,101,128,170,189,287,296],"to":[19,29,241],"assign":[20],"signs":[21],"$s_1,\\dots,s_n\\in\\{\\pm1\\}$":[22],"in":[23,135,142,158,212,226,252],"an":[24,204,253,260],"manner":[26,255],"so":[27,68],"as":[28],"minimize":[30],"largest":[32],"norm":[33,122],"of":[34,89,97,108,154,183,207,215,221,231,267,270,280,294],"any":[35],"signed":[36,115],"prefix":[37],"sum":[38],"$\\sum_{i=1}^ks_i":[39],"t_i$,":[40],"$k":[41],"\\in":[42],"[n]$.":[43],"this":[45,57],"paper,":[46],"we":[47,111,262],"analyze":[48,175],"natural":[50],"Euclidean":[51,121],"greedy":[52,98,119,177,237],"balancing":[54,239],"algorithm":[55,178],"for":[56,167],"problem:":[58],"at":[59,123],"each":[60],"step":[61],"$k$,":[62],"sign":[64],"$s_k\\in\\{\\pm1\\}$":[65],"chosen":[67],"that":[69,113,188,276],"$s_k":[70],"t_k$":[71],"has":[72],"non-positive":[73],"inner":[74],"product":[75],"with":[76],"$\\sum_{i=1}^{k-1}":[77],"s_i\\cdot":[78],"t_i$.":[79],"Our":[80],"main":[81],"result":[82],"first":[85],"finite":[86],"bound,":[87],"independent":[88,232],"sequence":[91,247],"length":[92],"$n$,":[93],"on":[94,219],"performance":[96],"whenever":[99],"finite.":[102],"When":[103],"$T":[104],"\\subset":[105],"\\mathbb{R}^d$":[106],"consists":[107],"unit":[109],"vectors,":[110],"prove":[112,263],"sums":[116],"produced":[117],"have":[120],"most":[124],"$(2/\u03b4_T)^{d-1}$,":[125,217],"where":[126,245],"$\u03b4_T$":[127],"minimum":[130],"non-zero":[131],"distance":[132],"between":[133],"subspaces":[138,222],"spanned":[139,223],"$T$.":[143,159],"The":[144],"same":[145],"upper":[146],"bound":[147,240],"holds":[148],"when":[149,291],"sequences":[151],"are":[152],"composed":[153],"scaled":[155],"down":[156],"We":[160,174,202,234],"also":[161],"provide":[162],"simple":[164],"which":[168,228],"$\u03a9(\\sqrt{d}/\u03b4_T)$":[169],"lower":[172],"bound.":[173],"proving":[180],"existence":[182],"bounded":[185],"convex":[186],"$K_T$":[187,210],"$T$-absorbing:":[190],"$\\forall":[191],"x\\in":[192],"K_T$":[193],"$t":[195],"\\in\\pm":[196],"T$,":[197],"$\\langle":[198],"x,t\\rangle\\leq0\\Rightarrow":[199],"x+t\\in":[200],"K_T$.":[201],"give":[203],"explicit":[205],"construction":[206],"contained":[211],"ball":[214],"radius":[216],"based":[218],"chains":[220],"$T$,":[227],"may":[229],"be":[230,250],"interest.":[233],"generalize":[235],"our":[236],"partitioning,":[244],"must":[249],"partitioned":[251],"into":[256],"$p$":[257],"subsequences.":[258],"As":[259],"application,":[261],"special":[265],"case":[266],"conjecture":[269],"Bosman":[271],"et":[272],"al.":[273],"(arxiv:2402.19259),":[274],"showing":[275],"lexicographic":[278],"version":[279],"total":[281],"completion":[282],"time":[283,289],"scheduling":[284],"under":[285],"scenarios":[286,295],"polynomial":[288],"solvable":[290],"number":[293],"fixed.":[297]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-18T00:00:00"}