Math 2.0

Resources / preprint

A proof of Lehmer's permutation conjecture for neighbor-swap graphs XD5HCP8DHF

URIm2://res/XD5HCP8DHF
Kindpreprint
CreatorsTom Verhoeff
Date2026-10-01
MSC05-XX
Subjectsarxiv math.CO, arxiv cs.DM, arxiv cs.LO
Scopein

Expressions

e1: version, preprint

Languageen
Date2026-10-01
IdsarXiv 2610.01240, zbl_id 903193786

Items in this resource

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

ItemKindWhereSource
$\sig{2k,1,1}$ is path-onlystatementproposition 5arxiv
2AQNBSEQ7Ystatementlemma 30arxiv
Multi-odd signatures; Stachowiak {\rm}, as recorded by Verhoeff {\rmstatementtheorem 14arxiv
Stutters are far apart; Verhoeff {\rmstatementlemma 2arxiv
8CXE7C30HRstatementlemma 20arxiv
9ACQ0RPJX3statementtheoremarxiv
9Q5XXVWGQ2statementproposition 31arxiv
Gluing a parallel pair; Verhoeff {\rm}, Stachowiak {\rmstatementlemma 7arxiv
Reformulated Lehmer conjecture; Verhoeff {\rmconjectureconjecture 4arxiv
Shifted stuttersstatementlemma 25arxiv
Verhoeff {\rmstatementtheorem 3arxiv
Gluing along a treestatementlemma 8arxiv
Parallel pairsstatementlemma 24arxiv
One-odd theoremstatementtheorem 22arxiv
Parallel edgesdefinitiondefinition 6arxiv
All-even theoremstatementtheorem 19arxiv
Anchored wordsstatementlemma 28arxiv
Property \textup{(Pstatementproposition 21arxiv
Stitchesdefinitiondefinition 10arxiv
No stitch meets an anchored wordstatementlemma 12arxiv
Hypercubesstatementlemma 9arxiv
Last-color blocksstatementlemma 23arxiv
Routingstatementproposition 29arxiv
Spanning matching treesstatementlemma 18arxiv
Boustrophedon hypercube cyclesstatementlemma 17arxiv
Rungs, anchored wordsdefinitiondefinition 11arxiv
Binary classification; Verhoeff {\rmstatementtheorem 13arxiv
Parity census; Ruskeystatementlemma 1arxiv
Assemblystatementproposition 26arxiv

Catalogue records