{"id":"https://openalex.org/W7168281663","doi":"https://doi.org/10.48550/arxiv.2607.10479","title":"A Faster Closest-Point Algorithm for the $A_n^*$ Lattices","display_name":"A Faster Closest-Point Algorithm for the $A_n^*$ Lattices","publication_year":2026,"publication_date":"2026-07-11","ids":{"openalex":"https://openalex.org/W7168281663","doi":"https://doi.org/10.48550/arxiv.2607.10479"},"language":null,"primary_location":{"id":"pmh:oai:arXiv.org:2607.10479","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2607.10479","pdf_url":"https://arxiv.org/pdf/2607.10479","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2607.10479","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5140672308","display_name":"Yuriy A. Reznik","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Reznik, Yuriy A.","raw_affiliation_strings":["Massachusetts Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5140672308"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.2011999934911728,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.2011999934911728,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"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.1770000010728836,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.13490000367164612,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/lattice-quantization","display_name":"lattice vector quantization","score":0.8059999942779541},{"id":"https://openalex.org/keywords/bucket-sort","display_name":"bucket sort","score":0.6840000152587891},{"id":"https://openalex.org/keywords/integer-arithmetic","display_name":"integer arithmetic","score":0.4000000059604645},{"id":"https://openalex.org/keywords/histograms","display_name":"histograms","score":0.8949999809265137},{"id":"https://openalex.org/keywords/probability-distributions","display_name":"probability distributions","score":0.718999981880188},{"id":"https://openalex.org/keywords/root-lattice","display_name":"root lattice","score":0.796999990940094},{"id":"https://openalex.org/keywords/e8-lattice","display_name":"E8 lattice","score":0.5580000281333923}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6686000227928162},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5981000065803528},{"id":"https://openalex.org/C2781204021","wikidata":"https://www.wikidata.org/wiki/Q6497091","display_name":"Lattice (music)","level":2,"score":0.5708000063896179},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.47859999537467957},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.45660001039505005},{"id":"https://openalex.org/C150202949","wikidata":"https://www.wikidata.org/wiki/Q107602","display_name":"Pointer (user interface)","level":2,"score":0.4417000114917755},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.4154999852180481},{"id":"https://openalex.org/C53533937","wikidata":"https://www.wikidata.org/wiki/Q185020","display_name":"Histogram","level":3,"score":0.39899998903274536},{"id":"https://openalex.org/C151416825","wikidata":"https://www.wikidata.org/wiki/Q934791","display_name":"Quadtree","level":2,"score":0.3747999966144562},{"id":"https://openalex.org/C75930677","wikidata":"https://www.wikidata.org/wiki/Q1251950","display_name":"Ramer\u2013Douglas\u2013Peucker algorithm","level":3,"score":0.3610999882221222},{"id":"https://openalex.org/C125257309","wikidata":"https://www.wikidata.org/wiki/Q131752","display_name":"Greatest common divisor","level":2,"score":0.36090001463890076},{"id":"https://openalex.org/C68693459","wikidata":"https://www.wikidata.org/wiki/Q657586","display_name":"Hyperplane","level":2,"score":0.3386000096797943},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32679998874664307},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.3228999972343445},{"id":"https://openalex.org/C44274781","wikidata":"https://www.wikidata.org/wiki/Q6497132","display_name":"Lattice reduction","level":4,"score":0.3158000111579895},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.31380000710487366},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.30000001192092896},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27489998936653137},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.26829999685287476},{"id":"https://openalex.org/C155512373","wikidata":"https://www.wikidata.org/wiki/Q287450","display_name":"Residual","level":2,"score":0.260699987411499},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.250900000333786}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2607.10479","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2607.10479","pdf_url":"https://arxiv.org/pdf/2607.10479","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2607.10479","doi":"https://doi.org/10.48550/arxiv.2607.10479","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.10479","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2607.10479","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2607.10479","pdf_url":"https://arxiv.org/pdf/2607.10479","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7168281663.pdf","grobid_xml":"https://content.openalex.org/works/W7168281663.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,72,102,221],"dual":[1],"root":[2,235],"lattice":[3,8,24,66],"$A_n^*$":[4,38],"is":[5,77,105,224,245],"an":[6,200],"important":[7],"in":[9,247],"quantization,":[10],"coding,":[11],"and":[12,48,85,122,145,174,196,230,240],"estimation.":[13],"It":[14],"can":[15],"be":[16,135],"represented":[17],"as":[18,46,92],"the":[19,22,27,54,65,78,107,112,127,142,169,176,191,248],"projection":[20],"of":[21,81,148,168,206],"integer":[23,172],"$\\mathbb{Z}^{n+1}$":[25],"onto":[26],"$n$-dimensional":[28],"hyperplane":[29],"whose":[30],"coordinates":[31,178],"sum":[32],"to":[33,134,209],"zero.":[34],"This":[35,51,140],"representation":[36],"makes":[37,166],"particularly":[39],"natural":[40],"for":[41,57,185,213,233],"quantizing":[42],"simplex-constrained":[43],"data,":[44],"such":[45],"histograms":[47,187],"probability":[49],"distributions.":[50],"paper":[52],"studies":[53],"closest-point":[55,108],"problem":[56],"$A_n^*$:":[58],"given":[59],"a":[60,93,98,120,123,151,182],"query":[61],"vector":[62],"$y$,":[63],"find":[64],"point":[67],"$x\\in":[68],"A_n^*$":[69],"minimizing":[70],"$\\|y-x\\|^2$.":[71],"fastest":[73],"previously":[74],"known":[75],"method":[76],"linear-time":[79,100],"algorithm":[80,193,223],"McKilliam,":[82],"Clarkson,":[83],"Smith,":[84],"Quinn":[86],"(MCSQ),":[87],"which":[88],"employs":[89],"bucket":[90,131],"sort":[91],"core":[94],"operation.":[95],"We":[96],"present":[97],"faster":[99,227],"algorithm.":[101],"key":[103],"observation":[104],"that":[106],"objective":[109,164],"depends":[110],"on":[111,199],"rounding":[113],"residuals":[114],"only":[115],"through":[116],"two":[117,156],"prefix":[118],"aggregates:":[119],"count":[121],"residual":[124],"sum.":[125],"Hence":[126],"elements":[128],"inside":[129],"each":[130],"never":[132],"need":[133],"sorted,":[136],"stored,":[137],"or":[138,188],"traversed.":[139],"replaces":[141],"linked-list":[143],"traversal":[144],"pointer":[146],"chasing":[147],"MCSQ":[149,212],"with":[150,159,181,215],"single":[152],"bucketing":[153],"pass":[154],"over":[155,211],"flat":[157],"arrays":[158],"counting-sort-style":[160],"accumulates.":[161],"A":[162],"scaled":[163],"further":[165],"most":[167],"computation":[170],"exact":[171,195],"arithmetic,":[173],"when":[175],"input":[177],"are":[179],"rationals":[180],"common":[183],"denominator,":[184],"example,":[186],"empirical":[189],"distibutions,":[190],"entire":[192],"becomes":[194],"integer-only.":[197],"Experiments":[198],"Intel":[201],"Core":[202],"i9-13900H":[203],"show":[204],"speedups":[205],"about":[207],"$1.8\\times$":[208],"$3.0\\times$":[210],"$n=2,\\dots,100$,":[214],"larger":[216],"gains":[217],"at":[218],"higher":[219],"dimensions.":[220],"proposed":[222],"also":[225],"noticeably":[226],"than":[228],"Conway":[229],"Sloan":[231],"methods":[232],"other":[234],"lattices,":[236],"including":[237],"$A_n$,":[238],"$D_n^*$,":[239],"$E_8$.":[241],"An":[242],"open-source":[243],"implementation":[244],"available":[246],"\"fanstar\"":[249],"project.":[250]},"counts_by_year":[],"updated_date":"2026-09-30T09:27:27.532063","created_date":"2026-07-15T00:00:00"}