Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 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

Galois groups arising from families with big orthogonal monodromy (2001.07273v1)

Published 20 Jan 2020 in math.NT

Abstract: We study the Galois groups of polynomials arising from a compatible family of representations with big orthogonal monodromy. We show that the Galois groups are usually as large as possible given the constraints imposed on them by a functional equation and discriminant considerations. As an application, we consider the Frobenius polynomials arising from the middle \'etale cohomology of hypersurfaces in $\mathbb{P}_{\mathbb{F}_q}{2n+1}$ of degree at least $3$. We also consider the $L$-functions of quadratic twists of fixed degree of an elliptic curve over a function field $\mathbb{F}_q(t)$. To determine the typical Galois group in the elliptic curve setting requires using some known cases of the Birch and Swinnerton-Dyer conjecture. This extends and generalizes work of Chavdarov, Katz and Jouve.

Summary

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