When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Ramification (mathematics) - Wikipedia

    en.wikipedia.org/wiki/Ramification_(mathematics)

    In a covering map the Euler–Poincaré characteristic should multiply by the number of sheets; ramification can therefore be detected by some dropping from that. The z → z n mapping shows this as a local pattern: if we exclude 0, looking at 0 < |z| < 1 say, we have (from the homotopy point of view) the circle mapped to itself by the n-th power map (Euler–Poincaré characteristic 0), but ...

  3. Computational complexity of mathematical operations - Wikipedia

    en.wikipedia.org/wiki/Computational_complexity...

    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.

  4. Nottingham group - Wikipedia

    en.wikipedia.org/wiki/Nottingham_group

    The group multiplication is not abelian. The group was studied by number theorists as the group of wild automorphisms of the local field F p ((t)) and by group theorists including D. Johnson (1988) and the name "Nottingham group" refers to his former domicile. This group is a finitely generated pro-p-group, of finite width. For every finite ...

  5. Riemann–Hurwitz formula - Wikipedia

    en.wikipedia.org/wiki/Riemann–Hurwitz_formula

    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.

  6. Schönhage–Strassen algorithm - Wikipedia

    en.wikipedia.org/wiki/Schönhage–Strassen...

    Applications of the Schönhage–Strassen algorithm include large computations done for their own sake such as the Great Internet Mersenne Prime Search and approximations of π, as well as practical applications such as Lenstra elliptic curve factorization via Kronecker substitution, which reduces polynomial multiplication to integer ...

  7. Ramification group - Wikipedia

    en.wikipedia.org/wiki/Ramification_group

    In number theory, more specifically in local class field theory, the ramification groups are a filtration of the Galois group of a local field extension, which gives detailed information on the ramification phenomena of the extension.

  8. Conductor of an elliptic curve - Wikipedia

    en.wikipedia.org/wiki/Conductor_of_an_elliptic_curve

    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 ...

  9. Splitting of prime ideals in Galois extensions - Wikipedia

    en.wikipedia.org/wiki/Splitting_of_prime_ideals...

    There, given a Galois ramified cover, all but finitely many points have the same number of preimages. The splitting of primes in extensions that are not Galois may be studied by using a splitting field initially, i.e. a Galois extension that is somewhat larger. For example, cubic fields usually are 'regulated' by a degree 6 field containing them.