Search Results for ""

Direct search factorization is the simplest (and most simple-minded) prime factorization algorithm. It consists of searching for factors of a number by systematically ...

kappa(d)={(2lneta(d))/(sqrt(d)) for d>0; (2pi)/(w(d)sqrt(|d|)) for d<0, (1) where eta(d) is the fundamental unit and w(d) is the number of substitutions which leave the ...

A topological space that is not connected, i.e., which can be decomposed as the disjoint union of two nonempty open subsets. Equivalently, it can be characterized as a space ...

A coordinate system defined by the transformation equations x = a/Lambdacnmucnnucospsi (1) y = a/Lambdacnmucnnusinpsi (2) z = a/Lambdasnmudnmusnnudnnu, (3) where ...

The Drazin inverse is a matrix inverse-like object derived from a given square matrix. In particular, let the index k of a square matrix be defined as the smallest ...

The edge connectivity, also called the line connectivity, of a graph is the minimum number of edges lambda(G) whose deletion from a graph G disconnects G. In other words, it ...

For any Abelian group G and any natural number n, there is a unique space (up to homotopy type) such that all homotopy groups except for the nth are trivial (including the ...

The elliptic logarithm is generalization of integrals of the form int_infty^x(dt)/(sqrt(t^2+at)), for a real, which can be expressed in terms of logarithmic and inverse ...

Elliptic rational functions R_n(xi,x) are a special class of rational functions that have nice properties for approximating other functions over the interval x in [-1,1]. In ...

A surface S is n-embeddable if it can be placed in R^n-space without self-intersections, but cannot be similarly placed in any R^k for k<n. A surface so embedded is said to ...