Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Permuting the roots of univariate polynomials whose coefficients depend on parameters (2204.14235v4)

Published 29 Apr 2022 in math.AG and math.GN

Abstract: We address two interrelated problems concerning permutation of roots of univariate polynomials whose coefficients depend on parameters. First, we compute the Galois group of polynomials $\varphi(x)\in\mathbb{C}[t_1,\cdots,t_k][x]$ over $\mathbb{C}(t_1,\cdots,t_k)$. Provided that the corresponding multivariate polynomial $\varphi(x,t_1,\cdots,t_k)$ is generic with respect to its support $A\subset \mathbb{Z}{k+1}$, we determine the latter Galois group for any $A$. Second, we determine the Galois group of systems of polynomial equations of the form $p(x,t)=q(t)=0 $ where $p$ and $q$ have prescribed support sets $A_1\subset \mathbb{Z}2$ and $A_2\subset {0}\times \mathbb{Z}$ respectively. For each problem, we determine the image of an appropriate braid monodromy map in order to compute the sought Galois group. Among the applications, we compute the Galois group of any rational function that is generic with respect to its support. We also provide general obstructions on the Galois group of enumerative problems over algebraic groups.

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com