Search Results for ""

Does there exist an algorithm for deciding whether or not a specific mathematical assertion does or does not have a proof? The decision problem is also known as the ...

Given binomial coefficient (N; k), write N-k+i=a_ib_i, for 1<=i<=k, where b_i contains only those prime factors >k. Then the number of i for which b_i=1 (i.e., for which all ...

The operation of drilling a tubular neighborhood of a knot K in S^3 and then gluing in a solid torus so that its meridian curve goes to a (p,q)-curve on the torus boundary of ...

An embedding of a 1-sphere in a 3-manifold which exists continuously over the 2-disk also extends over the disk as an embedding. An alternate phrasing is that if a knot group ...

Also known as "Laplacian" determinant expansion by minors, expansion by minors is a technique for computing the determinant of a given square matrix M. Although efficient for ...

A useful determinant identity allows the following determinant to be expressed using vector operations, |x_1 y_1 z_1 1; x_2 y_2 z_2 1; x_3 y_3 z_3 1; x_4 y_4 z_4 ...

A real function is said to be differentiable at a point if its derivative exists at that point. The notion of differentiability can also be extended to complex functions ...

As a part of the study of Waring's problem, it is known that every positive integer is a sum of no more than 9 positive cubes (g(3)=9), that every "sufficiently large" ...

The direct limit, also called a colimit, of a family of R-modules is the dual notion of an inverse limit and is characterized by the following mapping property. For a ...

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