arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2001.03630math.NTmath.GR
收藏

Reducible Fibers of Polynomial Maps

Joachim König, Danny Neftin

英文摘要:

For a degree $n$ polynomial $f$ over the rationals, the elements in the fiber $f^{-1}(a)$ are of degree $n$ over $\mathbb Q$ for most rational values $a$ by Hilbert's irreducibility theorem. Determining the set of exceptional $a$'s without this property is a long standing open problem that is closely related to the Davenport--Lewis--Schinzel problem (1959) on reducibility of separated polynomials. As opposed to previous work which mostly concerns indecomposable $f$, we answer both problems for decomposable $f=f_1\circ\cdots\circ f_r$, as long as the indecomposable factors $f_i\in\mathbb Q[x]$ are of degree at least $5$ and are not $x^n$ or a Chebyshev polynomial composed with linear polynomials.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑