Related Experiment Video
Updated: May 8, 2026

06:42
Generation and Coherent Control of Pulsed Quantum Frequency Combs
Published on: June 8, 2018
Wild Galois representations: elliptic curves with wild cyclic reduction
1Dipartimento di Matematica, Università di Padova, Via Trieste 63, 35121 Padova, Italy.
Summary
This study completes the computation of Galois representations for elliptic curves over non-archimedean fields, specifically addressing "wild" cases with residue characteristics of 2 or 3. The findings extend previous work on non-abelian inertia images, offering a comprehensive analysis.
Area of Science:
- Number Theory
- Algebraic Geometry
- Galois Representations
Background:
- Kraus classified inertia images of l-adic Galois representations for elliptic curves over non-archimedean fields in 1990.
- Previous work computed Galois representations for elliptic curves with non-abelian inertia images, occurring when residue characteristic is 2 or 3.
Purpose of the Study:
- To complete the computation of Galois representations in remaining "wild" cases.
- To analyze elliptic curves with residue characteristic p=2 or 3 and good reduction over extensions with p-divisible ramification degree.
Main Methods:
- Explicit computation of Galois representations.
- Analysis of elliptic curves over non-archimedean local fields.
- Building upon previous classifications and computations of inertia images.
Main Results:
- The computation of Galois representations is completed for all remaining wild cases.
- This work addresses scenarios where the ramification degree is divisible by the residue characteristic (p=2 or 3).
- The condition of a non-abelian inertia image is not assumed, broadening the scope of analysis.
Conclusions:
- The study provides a comprehensive understanding of Galois representations for elliptic curves in specific wild ramification scenarios.
- This research contributes to the explicit computation of Galois representations in algebraic number theory.
- The findings are based on Chapter V of the author's PhD thesis.
Related Concept Videos
Synthetic Disvision of Polynomials
Synthetic division is an efficient algorithmic approach for dividing a polynomial by a linear binomial of the form x - c, where c is a real number. This method is helpful due to its streamlined process, which avoids the more cumbersome steps involved in the traditional long division of polynomials. It simplifies computation and serves as a practical tool for evaluating polynomials and identifying their factors.To perform synthetic division, one begins by listing the coefficients of the...
Fundamental Theorem of Algebra
The Fundamental Theorem of Algebra is central to the study of polynomial equations, asserting that every non-constant polynomial with complex coefficients has at least one complex zero. This means that a polynomial of degree n ≥ 1, written as: with an ≠ 0, has at least one solution in the complex number system. Since the set of real numbers is a subset of complex numbers, this theorem applies equally to polynomials with real coefficients.Building on this result, the Complete Factorization...
Graphs of Polar Equations
The polar coordinate system represents points using a distance from a central point (the pole) and an angle from a reference direction (the polar axis). Unlike rectangular coordinates, polar coordinates are ideal for graphing curves with radial symmetry or periodic behavior.Some general forms of graphs in polar coordinates include the following:Equation of a Circle (Centered at the Pole):A graph where the radius remains constant for all angles traces a circle centered at the pole:Equation of a...
SFG Algebra
In Signal Flow Graph (SFG) algebra, the value a node represents is determined by the sum of all signals entering that node. This summed value is then transmitted through every branch leaving the node, making the SFG a powerful tool for visualizing and analyzing control systems.
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...
Real Zeros of Polynomials
Polynomials are algebraic expressions of terms with variables raised to non-negative integer powers. A central aspect of analyzing polynomial functions is determining their real zeros—values of the variable for which the polynomial evaluates to zero. These values represent the x-intercepts of the polynomial’s graph.The Rational Zeros Theorem lists possible rational solutions for a polynomial equation with integer coefficients. If f(x)=anxn+....+a0, then every rational zero is of the form p/q,...
Theorems of Pappus and Guldinus
The two theorems developed by Pappus and Guldinus are widely used in mathematics, engineering, and physics to find the surface area and volume of any body of revolution. This is done by revolving a plane curve around an axis that does not intersect the curve to find its surface area or revolving a plane area around a non-intersecting axis to calculate its volume.
For finding the surface area, consider a differential line element that generates a ring with surface area dA when revolved.
For finding the surface area, consider a differential line element that generates a ring with surface area dA when revolved.