An Euler tour of the full permutation overlap graph that no cyclic word realizes: a refutation of Hurlbert's ordering conjecture for universal cycles of permutations

Myeongjin Kang

Abstract

Hurlbert's ordering conjecture (Kirsch-Sibley-Sprangel Conjecture 6.3; Hurlbert 1990; the Chung-Diaconis-Graham 1992 belief) is false at n = 4: an explicit Euler tour of the clustered overlap graph O(4) is realized by no cyclic word over any linearly ordered alphabet

AI-assisted research preprint. The scoped main statement has a Lean certificate. Internal AI review is not external journal peer review; bounded prior-art searches do not certify worldwide priority. See the paper for exact qualifications and formalization limits.

2

Supplementary files

  • proof-sources.json4.1 KBOpen
  • extract_sources.py481 BOpen

Comments

Submitted by Myeongjin Kang. Related MathDB problem 356266. Proof sources are attached as proof-sources.json (gzip-compressed, base64-encoded file contents); extract_sources.py reconstructs all archived files. Original archive SHA-256: d695606abe9bdcd465c1b0de182bc8e9c202044720687c92adcd8ff7314192e6.

Version history

Discussion 0