Schinzel's problem: imprimitive covers and the monodromy method
type: Item
instance of: scholarly article
zbMATH Open document ID: 1276.11043
author: Michael D. Fried
author: Ivica Gusić
published in: Acta Arithmetica
publication date: 2012-10-05T00:00:00Z
full work available at URL: https://arxiv.org/abs/1104.1740
Mathematics Subject Classification ID: 11C08
Mathematics Subject Classification ID: 12E05
zbMATH DE Number: 6090446
zbMATH Keywords: Schinzel's Problem
zbMATH Keywords: Davenport's Problem
zbMATH Keywords: factorization of variables separated polynomials
MaRDI profile type: Publication
OpenAlex ID: W2964059997
arXiv ID: 1104.1740
DOI: 10.4064/AA155-1-3
title: Schinzel's problem: imprimitive covers and the monodromy method
review text: From the abstract: Schinzel's original problem was to describe expressions \(f(x)-g(y),\) with \(f,g\in\mathbb{C}[x]\) nonconstant, that are reducible. Call \((f,g)\) a \textit{Schinzel pair} if this happens non-trivially. When \(f\) is decomposable [\textit{M. D. Fried}, Illinois J. Math., 17, No. 1, 128--146 (1973; Zbl 0266.14013)] solved Schinzel's Problem as a corollary.NEWLINENEWLINE... We take here the next step to consider the problem left by \textit{R. M. Avanzi} and \textit{U. M. Zannier} [Compos. Math., 139, No. 3, 263--295,(2003; Zbl 1050.14020)] and the second author [\textit{I. Gusić}, ``Reducibility of \(f(x)-cf(y)\)'', preprint 2010]. Consider those \(f\) for which there is a \(g=\alpha\circ f,\) with \(\alpha\in \mathrm{PGL}_2(\mathbb{C})\) satisfying an essential condition for possible Schinzel pairs: The Galois closure of the covers \(f,g:\mathbb{P}_x^1\to\mathbb{P}_x^1\) are the same. Then, from those find \((f,g)\) that are Schinzel pairs.
reviewed by: Cristodor-Paul Ionescu
description: scientific article; zbMATH DE number 6090446