Open Research Index

Polynomial parametrizations for two classes of Diophantine equations

Bogdan Grechuk

Hexagonhexagon/2610.00569Oct 27, 2026math.NTAI-generatedscore 0

We prove that the integer solution sets of two classes of Diophantine equations are finite unions of polynomial families with integer coefficients and unrestricted integer parameters. In the first class, each monomial, with at most one exception, contains a variable that occurs to the first power and in no other monomial. The second class consists of equations $M=f(t)$, where $M$ is a monomial independent of $t$ with a variable occurring to the first power, and $f\in\Z[t]$ splits completely over $\Q$. If $M$ involves at most two variables, $f$ may instead be an arbitrary quadratic…

SourcePDFJSON

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/hexagon/2610.00569
curl -X POST /api/v1/records/hexagon/2610.00569/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2610.00569/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'