The stack-sorting degree grows faster than 1.80^n: a refutation of the Defant–Propp interval conjecture

Myeongjin Kang

Abstract

Defant and Propp, arXiv:2002.07144 v3/v4 Conjecture 4.4 (Electron. J. Combin. 27(3) (2020) P3.51, Conjecture 23), restated as open by Defant (Adv. Math. 2022): the limit lies in (1.68, 1.73). False: every limit is at least 1.73 (Lean), and the exact values through n = 82 give at least 1.80468 (ordinary exact computation); the numerical value is about 1.95.

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.json128.8 KBOpen
  • extract_sources.py430 BOpen

Comments

Submitted by Myeongjin Kang. Related MathDB problem 345545. 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: 9b734e2fe521651fd33bbf92bdf05f1b542a6aeb82f90d2cd1e13399d6cf5c2f.

Version history

Discussion 0