{"id":"https://openalex.org/W7151559038","doi":"https://doi.org/10.48550/arxiv.2604.04656","title":"Subset Balancing and Generalized Subset Sum via Lattices","display_name":"Subset Balancing and Generalized Subset Sum via Lattices","publication_year":2026,"publication_date":"2026-04-06","ids":{"openalex":"https://openalex.org/W7151559038","doi":"https://doi.org/10.48550/arxiv.2604.04656"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.04656","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.04656","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.2604.04656","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016918814","display_name":"Yiming Gao","orcid":"https://orcid.org/0000-0003-4688-5839"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gao, Yiming","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133092343","display_name":"Yansong Feng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Feng, Yansong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5121205631","display_name":"Honggang Hu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hu, Honggang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5133079893","display_name":"Yanbin Pan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pan, Yanbin","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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.15440000593662262,"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.15440000593662262,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.15119999647140503,"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/T11830","display_name":"Point processes and geometric inequalities","score":0.09719999879598618,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"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/time-complexity","display_name":"Time complexity","score":0.5820000171661377},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5562999844551086},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5436999797821045},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4860999882221222},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.47999998927116394},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.4611000120639801},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.45019999146461487},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.43380001187324524},{"id":"https://openalex.org/keywords/subset-sum-problem","display_name":"Subset sum problem","score":0.40950000286102295}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6640999913215637},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5820000171661377},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5562999844551086},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5436999797821045},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4860999882221222},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.47999998927116394},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47780001163482666},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4681999981403351},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.4611000120639801},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.45019999146461487},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.43380001187324524},{"id":"https://openalex.org/C109275537","wikidata":"https://www.wikidata.org/wiki/Q1154420","display_name":"Subset sum problem","level":3,"score":0.40950000286102295},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4059000015258789},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4056999981403351},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.36500000953674316},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35910001397132874},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3303000032901764},{"id":"https://openalex.org/C119322782","wikidata":"https://www.wikidata.org/wiki/Q2662236","display_name":"VC dimension","level":2,"score":0.31630000472068787},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.3018999993801117},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.29280000925064087},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.27709999680519104},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.2689000070095062},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26249998807907104},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.25940001010894775},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.2572000026702881},{"id":"https://openalex.org/C188521023","wikidata":"https://www.wikidata.org/wiki/Q6795644","display_name":"Maximal set","level":3,"score":0.25440001487731934},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.25429999828338623},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2533999979496002}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.04656","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.04656","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.2604.04656","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.04656","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,62,157,197],"study":[1,159],"the":[2,88,130,153,160,189,226,236,248],"Subset":[3,67,162],"Balancing":[4,68],"problem:":[5],"given":[6],"$x":[7],"\\in":[8,22,168],"\\mathbb{Z}^n$":[9],"and":[10,38,46,51,98,253],"a":[11,18,64,76,94,99,123,147,216,241,255],"coefficient":[12,234],"set":[13],"$C":[14,70,178,184],"\\subseteq":[15],"\\mathbb{Z}$,":[16],"find":[17],"nonzero":[19],"vector":[20],"$c":[21,167,172],"C^n$":[23,169],"such":[24,170],"that":[25,171,199,231],"$c\\cdot":[26],"x":[27,174],"=":[28,71,175,179,185],"0$.":[29],"The":[30,103,126],"standard":[31],"meet-in-the-middle":[32,111],"algorithm":[33,97,219,257],"runs":[34],"in":[35,81,194,201,221,259],"time":[36,143,222,260],"$\\tilde{O}(|C|^{n/2})$,":[37],"recent":[39],"improvements":[40],"(SODA":[41],"2022,":[42],"Chen,":[43],"Jin,":[44],"Randolph,":[45],"Servedio;":[47],"STOC":[48],"2026,":[49],"Randolph":[50],"W\u0119grzycki)":[52],"beyond":[53],"this":[54,85],"barrier":[55],"apply":[56],"mainly":[57],"when":[58],"$d$":[59,119],"is":[60],"constant.":[61],"give":[63],"reduction":[65,86,127],"from":[66,129],"with":[69,87,244],"\\{-d,":[72,180],"\\dots,":[73,181],"d\\}$":[74,182],"to":[75,134,192],"single":[77],"instance":[78,239],"of":[79,155,165],"SVP$_{\\infty}$":[80],"dimension":[82,195],"$n+1$.":[83,196],"Instantiating":[84],"best":[89],"known":[90],"$\\ell_\\infty$-SVP":[91],"algorithms":[92],"yields":[93],"deterministic":[95,142,217,256],"$\\tilde{O}((6\\sqrt{2\u03c0e})^n)$-time":[96],"randomized":[100],"$\\tilde{O}(2^{2.443n})$-time":[101],"algorithm.":[102,125],"exponent":[104],"depends":[105],"only":[106,151,205],"on":[107,110,152],"$n$,":[108],"improving":[109],"for":[112,146,232],"all":[113],"$d\\ge":[114],"15$.":[115],"For":[116,177],"sufficiently":[117],"large":[118],"we":[120,187,229],"also":[121],"obtain":[122],"polynomial-time":[124],"extends":[128],"box":[131],"constraint":[132],"$[-d,d]^n$":[133],"any":[135],"centrally":[136],"symmetric":[137],"convex":[138],"body":[139],"$K\\subseteq\\mathbb{R}^n$,":[140],"giving":[141],"$\\tilde{O}(2^{c_K":[144],"n})$":[145],"constant":[148],"$c_K$":[149],"depending":[150],"shape":[154],"$K$.":[156],"further":[158],"Generalized":[161],"Sum":[163],"problem":[164,191],"finding":[166],"\\cdot":[173],"\u03c4$.":[176],"or":[183],"\\{-d,\\dots,d\\}\\setminus\\{0\\}$,":[186],"reduce":[188],"worst-case":[190,218],"CVP$_{\\infty}$":[193,211,238],"observe":[198],"distances":[200],"our":[202],"lattice":[203],"take":[204],"integer":[206],"values,":[207],"so":[208],"an":[209],"approximate":[210],"oracle":[212],"still":[213],"suffices,":[214],"yielding":[215],"running":[220,258],"$2^{O(n\\log\\log":[223],"d)}$.":[224],"In":[225],"average-case":[227],"setting,":[228],"demonstrate":[230],"both":[233],"sets":[235],"embedded":[237],"satisfies":[240],"bounded-distance":[242],"promise":[243],"high":[245],"probability,":[246],"removing":[247],"$\\log\\log":[249],"d$":[250],"factor":[251],"altogether":[252],"obtaining":[254],"$\\tilde{O}((18\\sqrt{2\u03c0e})^n)$.":[261]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-04-08T00:00:00"}