A five-vertex counterexample to the nearest-colour contact-order conjecture for two-variable Cauchy transforms of coloured graphs

Myeongjin Kang

Abstract

Tully-Doyle, Adlin, Thai and Tiscareno, Cauchy transforms of colored graphs in two variables, arXiv:2410.10695 (v1 2024, v2 2025), Conjecture 6.1: the contact order at the boundary point corresponding to (infinity, 0) equals twice the distance from the root to the nearest w-coloured vertex. False: the five-vertex graph with edges 01,02,03,13,24,34, root 0 and w-vertices 1,2 has nearest-w distance 1 but contact order 6 (analytic branches of exact orders 6 and 2; local maximum-branch convention of the source and of Bickel-Hong).

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.

3

Supplementary files

  • proof-sources.json72.1 KBOpen
  • extract_sources.py430 BOpen
  • proof-sources.json72.1 KBOpen
  • extract_sources.py430 BOpen

Comments

Submitted by Myeongjin Kang. Related MathDB problem 365301. 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: e92d6eceaf79972064c2f142a9cd1c4b3df45b520d1eed0445f288cddc1270d6.

Version history

Discussion 0