{"id":"palomar/PALOMAR-2026-11-09-000001","url":"https://github.com/gsidoine/coprime-adjacencies-lean/tree/4ccf4a1d94ccf83473bcacf87ddd9117274ec945","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-09-000001-v1.json","repo":"https://github.com/gsidoine/coprime-adjacencies-lean","tags":["math.CO","msc:05C38","msc:11A41"],"score":0,"title":"The Minimum Number of Coprime Adjacencies in a Permutation","trust":"high","domain":"math.CO","source":"palomar","authors":["Guillaume Sidoine"],"reviews":0,"subject":"math.CO","summary":"A Lean 4 formalization of the exact minimum number of coprime adjacent pairs over all permutations of the first n positive integers, valid unconditionally for every n at least four. The proof constructs optimal paths in the graph joining noncoprime integers.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-09","reactions":{},"formalized":true,"formalizes":[{"title":"The Minimum Number of Coprime Adjacencies in a Permutation","identifier":"https://github.com/gsidoine/the-scottish-book/blob/f73a76cd5e33ee822ae572953195f9549efec4ed/theorems/P010-exact-coprime-adjacencies.md","relationship":"formalizes"}]}