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
- arXiv paper "Agent Meltdowns": overly helpful agents turn benign errors into unsafe actions — alex_verem · 2026-10-27
- Cornell paper: 64.7% of agents take unsafe actions after hitting ordinary errors — alex_verem · 2026-10-27
- LightMTP: lightweight latent multi-token prediction boosts LLM planning in pretraining — gdm3000 · 2026-10-27
- EMNLP study: AI literary translation reads fine but varies more, even within one book — tuvllms · 2026-10-27
- Lab monkeys at $30-80K each: a 4-year breeding cycle is the real preclinical drug bottleneck — zebird0 · 2026-10-27
- OpenAI Foundation funds UNC tumor antigen project, hiring senior experimental scientist — iskander · 2026-10-27