Thread claims GPT-5.6 Sol helped build a new counterexample factory for the Jacobian conjecture
LucaAmb · x · 2026-07-21
A thread claims GPT-5.6 Sol helped turn the Jacobian conjecture discussion into a “counterexample factory.”
- It starts from an explicit polynomial map \(F0: \mathbb{C}^3 \to \mathbb{C}^3\) with Jacobian determinant \(-2\).
- The author says one more “push” leads to a general construction where denominators cancel and the resulting \(R\) is still a polynomial.
- The thread gives parameterized families (with choices of \(m, r, C\), and \(h(A)\)) and claims the generic fiber degree becomes \(r(m+1)+1\).
- Several named examples are listed, including nonlinear-divisor branches such as N2, N3, and N4.
More from Research
- Could 10k agents discover learning methods beyond backprop, or just tweak existing ones? — SeunghyunSEO7 · 2026-09-11
- Cognition's SWE-2 uses a KKT duality argument in RL to shift the effort Pareto curve — YouJiacheng · 2026-09-11
- VidMap uses RoMa coarse matching on all frames, fine-scale only for keyframes — ducha_aiki · 2026-09-11
- Bug Hunt Bench author: leaderboard noise is about 2-3 points — PawelHuryn · 2026-09-11
- PNAS paper shows a tiny billiard-ball system is a universal computer — undecidability lives in two dimensions — eigensteve · 2026-09-11
- New paper: Absolute pose estimation from affine cues and gravity direction — ducha_aiki · 2026-09-11