{"id":"https://openalex.org/W7216565629","doi":"https://doi.org/10.48550/arxiv.2610.01240","title":"A proof of Lehmer's permutation conjecture for neighbor-swap graphs","display_name":"A proof of Lehmer's permutation conjecture for neighbor-swap graphs","publication_year":2026,"publication_date":"2026-10-01","ids":{"openalex":"https://openalex.org/W7216565629","doi":"https://doi.org/10.48550/arxiv.2610.01240"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2610.01240","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.01240","pdf_url":"https://arxiv.org/pdf/2610.01240","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","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2610.01240","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103729667","display_name":"T Tom Verhoeff","orcid":"https://orcid.org/0000-0002-5114-5985","observed_orcids":["https://orcid.org/0000-0002-5114-5985"]},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Verhoeff, Tom","raw_affiliation_strings":["Department of Mathematics and Computer Science Eindhoven University of Technology ( TU/e) Eindhoven , The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science Eindhoven University of Technology ( TU/e) Eindhoven , The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5103729667"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"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.8705999851226807,"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.8705999851226807,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.07989999651908875,"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/T11567","display_name":"semigroups and automata theory","score":0.01899999938905239,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hamiltonian-cycles","display_name":"Hamiltonian cycles","score":0.8790000081062317},{"id":"https://openalex.org/keywords/multiset-permutations","display_name":"multiset permutations","score":0.7490000128746033},{"id":"https://openalex.org/keywords/hamiltonicity","display_name":"Hamiltonicity","score":0.4869999885559082},{"id":"https://openalex.org/keywords/lean-4-formalization","display_name":"Lean 4 formalization","score":0.6449999809265137}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7515000104904175},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7468000054359436},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5859000086784363},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5321000218391418},{"id":"https://openalex.org/C2779623528","wikidata":"https://www.wikidata.org/wiki/Q864377","display_name":"Multiset","level":2,"score":0.5109999775886536},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.4846000075340271},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.47279998660087585},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.42410001158714294},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.3767000138759613},{"id":"https://openalex.org/C68965932","wikidata":"https://www.wikidata.org/wiki/Q7169369","display_name":"Permutation graph","level":3,"score":0.3734000027179718},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.3443000018596649},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.34220001101493835},{"id":"https://openalex.org/C156004811","wikidata":"https://www.wikidata.org/wiki/Q2228257","display_name":"Multiplicity (mathematics)","level":2,"score":0.3237000107765198},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3043999969959259},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.303600013256073},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.2978000044822693},{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.2897000014781952},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.2718000113964081},{"id":"https://openalex.org/C92957085","wikidata":"https://www.wikidata.org/wiki/Q1412905","display_name":"Permutation group","level":3,"score":0.26170000433921814},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.2531999945640564}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:arXiv.org:2610.01240","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.01240","pdf_url":"https://arxiv.org/pdf/2610.01240","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":"pmh:oai:pure.tue.nl:openaire/2a525257-b692-4834-8f8e-2d2ca16af7e5","doi":null,"is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/2a525257-b692-4834-8f8e-2d2ca16af7e5","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Verhoeff, T 2026 'A proof of Lehmer's permutation conjecture for neighbor-swap graphs' arXiv.org. https://doi.org/10.48550/arXiv.2610.01240","raw_type":"info:eu-repo/semantics/preprint"},{"id":"doi:10.48550/arxiv.2610.01240","doi":"https://doi.org/10.48550/arxiv.2610.01240","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2610.01240","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":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2610.01240","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.01240","pdf_url":"https://arxiv.org/pdf/2610.01240","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":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7216565629.pdf","grobid_xml":"https://content.openalex.org/works/W7216565629.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3183799986","https://openalex.org/W7073640192","https://openalex.org/W2556925879","https://openalex.org/W7019647704","https://openalex.org/W4401455509","https://openalex.org/W6995604408","https://openalex.org/W2494026100","https://openalex.org/W2004470343","https://openalex.org/W101814861","https://openalex.org/W3128417874"],"abstract_inverted_index":{"In":[0],"1965,":[1],"D.":[2],"H.":[3],"Lehmer":[4],"conjectured":[5],"that":[6,26,111],"the":[7,23,61,72,81,84,87,91,106,122,137,141,151,159,163,174,195,205,243],"permutations":[8,107],"of":[9,55,86,108,136,148,173,188,202,226],"every":[10,28,66,167],"multiset":[11],"admit":[12,112],"an":[13,48,102],"imperfect":[14],"Hamiltonian":[15,114,171],"traversal":[16],"by":[17],"adjacent":[18],"swaps:":[19],"a":[20,39,69,113,134,156,179,200],"walk":[21],"in":[22,35,52,64,235,247],"neighbor-swap":[24],"graph":[25,88],"visits":[27],"word,":[29],"with":[30,94,101,126,150,182],"some":[31],"words":[32,73,138,149],"visited":[33],"twice":[34],"order":[36],"to":[37,74,194,199],"reach":[38],"neighbor":[40],"and":[41,79,105,125,158,198,228,237,242],"return.":[42],"The":[43,130,186,218],"question":[44],"is":[45,68,133,169,233,245],"posed":[46],"as":[47,71,83],"unsolved":[49],"research":[50],"problem":[51],"Knuth's":[53],"Art":[54],"Computer":[56],"Programming.":[57],"Verhoeff":[58],"(2017)":[59],"chose":[60],"stutter":[62],"words,":[63,93],"which":[65,210],"domino":[67,153],"double,":[70],"be":[75],"reached":[76],"this":[77],"way,":[78],"reformulated":[80,123],"conjecture":[82],"Hamiltonicity":[85,208],"$N(S)$":[89],"on":[90],"non-stutter":[92],"two":[95,213,223],"exceptional":[96],"families":[97],"---":[98,110],"binary":[99],"signatures":[100],"odd":[103,191,216],"multiplicity,":[104],"$(2k,1,1)$":[109],"path":[115],"but":[116],"no":[117,183],"cycle.":[118],"This":[119],"article":[120],"proves":[121],"conjecture,":[124],"it":[127],"Lehmer's":[128],"conjecture.":[129],"key":[131],"structure":[132],"partition":[135],"into":[139,155],"hypercubes:":[140],"swaps":[142],"inside":[143],"dominoes":[144],"turn":[145],"each":[146],"class":[147],"same":[152],"contents":[154],"hypercube,":[157],"stutters":[160],"are":[161,176,222],"exactly":[162,189],"$0$-dimensional":[164],"classes.":[165],"When":[166],"multiplicity":[168,192],"even,":[170],"cycles":[172],"hypercubes":[175],"glued":[177],"along":[178],"spanning":[180],"tree,":[181],"finite":[184,220],"check.":[185],"case":[187,197],"one":[190,206],"reduces":[193],"all-even":[196],"theorem":[201],"Stachowiak":[203],"(1992),":[204],"inherited":[207],"input,":[209],"also":[211],"settles":[212],"or":[214],"more":[215],"multiplicities.":[217],"only":[219],"ingredients":[221],"explicit":[224],"cycles,":[225],"28":[227],"84":[229],"words.":[230],"Every":[231],"construction":[232],"implemented":[234],"Python":[236],"checked":[238],"against":[239],"brute-force":[240],"graphs,":[241],"proof":[244],"formalized":[246],"Lean":[248],"4":[249],"over":[250],"Mathlib.":[251]},"counts_by_year":[],"updated_date":"2026-10-12T09:40:04.860316","created_date":"2026-10-03T00:00:00"}