We give an algorithm for the determination of the finitely many primes such that the image of the modular Galois representations attached to a weight 2 newform on Ξ 0 (N ) without complex multiplication or inner twists may not be "as large as possible". We apply the algorithm to suitable newforms a
Connected Linear Groups as Differential Galois Groups
β Scribed by C. Mitschi; M.F. Singer
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 272 KB
- Volume
- 184
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The construction starts with a polynomial with Galois group the given group and is based on representation theory.
We give an algorithm to calculate a presentation of the Picard-Vessiot extension associated to a completely reducible linear differential equation (i.e. an equation whose Galois group is reductive). Using this, we show how to compute the Galois group of such an equation as well as properties of the
## Abstract According to the classical SkitovichβDarmois theorem the independence of two linear forms of independent random variables implies that the random variables are Gaussian. We prove an analog of this theorem for some locally compact Abelian groups. It turns out that in the considered case
In this paper, we consider nonsplit Galois theoretical embedding problems with cyclic kernel of prime order p, in the case where the ground field has characteristic / p. It is shown that such an embedding problem can always be reduced to another embedding problem, in which the ground field contains