TOPICS
Search

Search Results for ""


7151 - 7160 of 13135 for Computational GeometrySearch Results
F(x) = Li_2(1-x) (1) = int_(1-x)^0(ln(1-t))/tdt, (2) where Li_2(x) is the dilogarithm.
The maximum cardinal number of a collection of subsets of a t-element set T, none of which contains another, is the binomial coefficient (t; |_t/2_|), where |_x_| is the ...
The placement of n points on a sphere so as to minimize the maximum distance of any point on the sphere from the closest one of the n points.
The sum of the absolute squares of the spherical harmonics Y_l^m(theta,phi) over all values of m is sum_(m=-l)^l|Y_l^m(theta,phi)|^2=(2l+1)/(4pi). (1) The double sum over m ...
A spheroidal harmonic is a special case of an ellipsoidal harmonic that satisfies the differential equation d/(dx)[(1-x^2)(dS)/(dx)]+(lambda-c^2x^2-(m^2)/(1-x^2))S=0 on the ...
The 6-polyiamond illustrated above, named for its resemblance to the Great Sphinx of Egypt.
A spigot algorithm is an algorithm which generates digits of a quantity one at a time without using or requiring previously computed digits. Amazingly, spigot algorithms are ...
A fixed point for which the eigenvalues are complex conjugates.
A polynomial p(x)=sumc_ix^i is said to split over a field K if p(x)=aproduct_(i)(x-alpha_i) where a and alpha_i are in K. Then the polynomial is said to split into linear ...
A link L is said to be splittable if a plane can be embedded in R^3 such that the plane separates one or more components of L from other components of L and the plane is ...
1 ... 713|714|715|716|717|718|719 ... 1314 Previous Next

...