Search results
Results From The WOW.Com Content Network
The ramification is tame when the ramification indices are all relatively prime to the residue characteristic p of , otherwise wild. This condition is important in Galois module theory. A finite generically étale extension B / A {\displaystyle B/A} of Dedekind domains is tame if and only if the trace Tr : B → A {\displaystyle \operatorname ...
In mathematics, the ramification theory of valuations studies the set of extensions of a valuation v of a field K to an extension L of K. It is a generalization of the ramification theory of Dedekind domains. [1] [2] The structure of the set of extensions is known better when L/K is Galois.
The tame ramification part ε is defined in terms of the reduction type: ε=0 for good reduction, ε=1 for multiplicative reduction and ε=2 for additive reduction. The wild ramification term δ is zero unless p divides 2 or 3, and in the latter cases it is defined in terms of the wild ramification of the extensions of K by the division points ...
The following procedure (Neukirch, p. 47) solves this problem in many cases. The strategy is to select an integer θ in O L so that L is generated over K by θ (such a θ is guaranteed to exist by the primitive element theorem), and then to examine the minimal polynomial H(X) of θ over K; it is a monic polynomial with coefficients in O K.
with the summation taken over four ramification points. The formula may also be used to calculate the genus of hyperelliptic curves. As another example, the Riemann sphere maps to itself by the function z n, which has ramification index n at 0, for any integer n > 1. There can only be other ramification at the point at infinity.
Graphs of functions commonly used in the analysis of algorithms, showing the number of operations versus input size for each function. The following tables list the computational complexity of various algorithms for common mathematical operations.
In mathematics, the Néron–Ogg–Shafarevich criterion states that if A is an elliptic curve or abelian variety over a local field K and ℓ is a prime not dividing the characteristic of the residue field of K then A has good reduction if and only if the ℓ-adic Tate module T ℓ of A is unramified.
Horner's method is a fast, code-efficient method for multiplication and division of binary numbers on a microcontroller with no hardware multiplier. One of the binary numbers to be multiplied is represented as a trivial polynomial, where (using the above notation) a i = 1 {\displaystyle a_{i}=1} , and x = 2 {\displaystyle x=2} .