TOPICS
Search

Search Results for ""


3551 - 3560 of 3853 for Point Plane DistanceSearch Results
One of the three standard tori given by the parametric equations x = (c+acosv)cosu (1) y = (c+acosv)sinu (2) z = asinv (3) with c>a. This is the torus which is generally ...
The maximal number of regions into which space can be divided by n planes is f(n)=1/6(n^3+5n+6) (Yaglom and Yaglom 1987, pp. 102-106). For n=1, 2, ..., these give the values ...
The number of regions into which space can be divided by n mutually intersecting spheres is N=1/3n(n^2-3n+8), giving 2, 4, 8, 16, 30, 52, 84, ... (OEIS A046127) for n=1, 2, ...
The spherical Hankel function of the first kind h_n^((1))(z) is defined by h_n^((1))(z) = sqrt(pi/(2z))H_(n+1/2)^((1))(z) (1) = j_n(z)+in_n(z), (2) where H_n^((1))(z) is the ...
The spherical Hankel function of the second kind h_n^((1))(z) is defined by h_n^((2))(z) = sqrt(pi/(2x))H_(n+1/2)^((2))(z) (1) = j_n(z)-in_n(z), (2) where H_n^((2))(z) is the ...
With n cuts of a torus of genus 1, the maximum number of pieces which can be obtained is N(n)=1/6(n^3+3n^2+8n). The first few terms are 2, 6, 13, 24, 40, 62, 91, 128, 174, ...
A transformation consisting of a constant offset with no rotation or distortion. In n-dimensional Euclidean space, a translation may be specified simply as a vector giving ...
A triple of three arbitrary vectors with common vertex (Altshiller-Court 1979), often called a trihedral angle since it determines three planes. The vectors are often taken ...
In machine learning theory, the Vapnik-Chervonenkis dimension or VC-dimension of a concept class C is the cardinality of the largest set S which can be shattered by C. If ...
An ascending chain of subspaces of a vector space. If V is an n-dimensional vector space, a flag of V is a filtration V_0 subset V_1 subset ... subset V_r, (1) where all ...
1 ... 353|354|355|356|357|358|359 ... 386 Previous Next

...