scientific article; zbMATH DE number 1305313
Let \(K\) be a field of characteristic \(p\) (possible \(p=0\)). Let \(t,x\) be algebraically independent over \(K\). If \(f\in K[x] \setminus K[x^p]\) then the polynomial \(f(x)-t\) is irreducible and separable. Its Galois group will be denoted by \(G_f\) and will be called the monodromy group of \(f\). The author classifies all polynomials \(f\) with regular \(G_f\) and all \(f\) with abelian monodromy group. For example we get the following result: If \(G_f\) is regular then \(f= a(h+b)^e+c\) where \(a,b,c\in K\), \(p\nmid e\) and \(h\in K[x]\) is an additive polynomial, which means \(h= \sum a_i x^{p^i}\) for suitable \(a_i\in K\). It turns out that a regular monodromy group is solvable. In section 3 polynomials with a solvable monodromy group are investigated. For the entire collection see [Zbl 0911.00025].
- Schreier graphs of iterated monodromy groups of sub-hyperbolic quadratic polynomials.
- Quadratic factors of \(f(X)-g(Y)\)
- Optimal selection for good polynomials of degree up to five
- Polynomials with AGL-monodromy
- POLYNOMIALS ASSOCIATED WITH THE HYPERGEOMETRIC FUNCTIONS WITH FINITE MONODROMY GROUPS
- scientific article; zbMATH DE number 800817 (Why is no real title available?)
- scientific article; zbMATH DE number 848012 (Why is no real title available?)
- Low-degree permutation rational functions over finite fields
- Polynomials with \(\text{PSL}(2)\) monodromy
- Good polynomials for locally recoverable codes: classification results, asymptotics, and exact formulae
- Note on the deck transformations group and the monodromy group
- Iterated monodromy groups of quadratic polynomials. I.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252182)