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

    The complexity of an elementary function is equivalent to that of its inverse, since all elementary functions are analytic and hence invertible by means of Newton's method. In particular, if either exp {\displaystyle \exp } or log {\displaystyle \log } in the complex domain can be computed with some complexity, then that complexity is ...

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

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

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

  7. List of arbitrary-precision arithmetic software - Wikipedia

    en.wikipedia.org/wiki/List_of_arbitrary...

    Python: the built-in int (3.x) / long (2.x) integer type is of arbitrary precision. The Decimal class in the standard library module decimal has user definable precision and limited mathematical operations (exponentiation, square root, etc. but no trigonometric functions).

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

  9. Conductor of an abelian variety - Wikipedia

    en.wikipedia.org/wiki/Conductor_of_an_abelian...

    If + and F is a finite extension of of ramification degree (/), there is an upper bound expressed in terms of the function (), which is defined as follows: Write n = ∑ k ≥ 0 c k p k {\displaystyle n=\sum _{k\geq 0}c_{k}p^{k}} with 0 ≤ c k < p {\displaystyle 0\leq c_{k}<p} and set L p ( n ) = ∑ k ≥ 0 k c k p k {\displaystyle L_{p}(n ...