Stephan 2026: superlinear complexity of the (3/2)^n steering word
A minimal Lean 4 / Mathlib formalization of R. Stephan, Superlinear complexity of the (3/2)^n steering word (arXiv:2607.11648), built on the repository's libraries ArithmeticHeights and DiophantineApproximation, whose p-adic Subspace Theorem it uses. Write (3/2)^n = m_n + ε_n with m_n the nearest integer and t_n = 2 m_{n+1} − 3 m_n. The library Stephan2026a is sorry-free and within Lean's three standard axioms. It proves Theorem 1.1, the subword complexity p_T(k) of the steering word T = (t_n) satisfies p_T(k)/k → ∞, together with the numbered results on its proof path: the repetition…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-10-20-000014
curl -X POST /api/v1/records/palomar/PALOMAR-2026-10-20-000014/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-10-20-000014/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'