Reducible fibers of polynomials over integers: the Hilbert-Siegel problem over Q and its applications
math.NT
Submitted: 2026-11-02
Updated: 2026-11-02
Terminology
Sources
- The Davenport-Lewis-Schinzel problem on the reducibility of $f(X)-g(Y)$
- Monodromy groups of polynomials of composition length 2
- Decompositions of Laurent polynomials
- On Ritt's polynomial decomposition theorems
Related papers
- K ab has the Bogomolov property for canonical heights
- Quasi-Jacobi forms, Appell-Lerch functions, and false theta functions as q-brackets of functions on partitions
- Wasserstein rates of all orders for the Sato-Tate law of Kloosterman sums
- Riemann functions for almost primes and their counting errors
- Topological flatness of orthogonal spin local models
- Asymptotic counting of integers with prime factors p r a s b