On the equation $f(g(x)) =f(x)h^m(x)$ for composite polynomials
Bibliographic record
Abstract
In this paper we solve the equation $f(g(x))=f(x)h^m(x)$ where $f(x)$, $g(x)$ and $h(x)$ are unknown polynomials with coefficients in an arbitrary field $K$, $f(x)$ is non-constant and separable, $°g \geq 2$, the polynomial $g(x)$ has non-zero derivative $g'(x) \ne 0$ in $K[x]$ and the integer $m \geq 2$ is not divisible by the characteristic of the field $K$. We prove that this equation has no solutions if $°f \geq 3$. If $°f = 2$, we prove that $m = 2$ and give all solutions explicitly in terms of Chebyshev polynomials. The diophantine applications for such polynomials $f(x)$, $g(x)$, $h(x)$ with coefficients in $\Q$ or $\Z$ are considered in the context of the conjecture of Cassaign et. al on the values of Louiville's $λ$ function at points $f(r)$, $r \in \Q$.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.005 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".