TOPICS
Search

Search Results for ""


2091 - 2100 of 2406 for Elliptic Curve Group LawSearch Results
Given two topological spaces M and N, place an equivalence relationship on the continuous maps f:M->N using homotopies, and write f_1∼f_2 if f_1 is homotopic to f_2. Roughly ...
The tangent space at a point p in an abstract manifold M can be described without the use of embeddings or coordinate charts. The elements of the tangent space are called ...
The inverse erf function is the inverse function erfc^(-1)(z) of erfc(x) such that erfc(erfc^(-1)(x))=erfc^(-1)(erfc(x)), (1) with the first identity holding for 0<x<2 and ...
An illusion named after the psychologist Joseph Jastrow. In the above figure, the left edges of the laminas A and B are colinear, creating an illusion of different size. ...
A real-valued univariate function f=f(x) has a jump discontinuity at a point x_0 in its domain provided that lim_(x->x_0-)f(x)=L_1<infty (1) and lim_(x->x_0+)f(x)=L_2<infty ...
If any set of points is displaced by X^idx_i where all distance relationships are unchanged (i.e., there is an isometry), then the vector field is called a Killing vector. ...
The Koolen-Riebeek graph is a weakly regular graph on 486 vertices with parameters (nu,k,lambda,mu)=(486,45,0,(0,9)). It is distance-regular but not distance-transitive with ...
The spherical harmonics form a complete orthogonal system, so an arbitrary real function f(theta,phi) can be expanded in terms of complex spherical harmonics by ...
Legendre's formula counts the number of positive integers less than or equal to a number x which are not divisible by any of the first a primes, (1) where |_x_| is the floor ...
The Leonard graph is a distance-regular graph on 288 vertices (Brouwer et al. 1989, p. 369) with intersection array {12,11,10,7;1,2,5,12}. It is however not ...
1 ... 207|208|209|210|211|212|213 ... 241 Previous Next

...