Search Results for ""
1921 - 1930 of 3197 for chess mathSearch Results

Given a knot diagram, it is possible to construct a collection of variables and equations, and given such a collection, a group naturally arises that is known as the group of ...
An operation on a knot or link diagram which preserves its crossing number. Thistlethwaite used 13 different moves in generating a list of 16-crossing alternating knots ...
Knuth's up-arrow notation is a notation invented by Knuth (1976) to represent large numbers in which evaluation proceeds from the right (Conway and Guy 1996, p. 60): m^n ...
Knuth's series is given by S = sum_(k=1)^(infty)((k^k)/(k!e^k)-1/(sqrt(2pik))) (1) = -2/3-1/(sqrt(2pi))zeta(1/2) (2) = -0.08406950872765599646... (3) (OEIS A096616), where ...
For every ring containing p spheres, there exists a ring of q spheres, each touching each of the p spheres, where 1/p+1/q=1/2, (1) which can also be written (p-2)(q-2)=4. (2) ...
Let alpha(x) be a step function with the jump j(x)=(N; x)p^xq^(N-x) (1) at x=0, 1, ..., N, where p>0,q>0, and p+q=1. Then the Krawtchouk polynomial is defined by ...
The Kreisel conjecture is a conjecture in proof theory that postulates that, if phi(x) is a formula in the language of arithmetic for which there exists a nonnegative integer ...
An algorithm for finding a graph's spanning tree of minimum length. It sorts the edges of a graph in order of increasing cost and then repeatedly adds edges that bridge ...
The Kuratowski reduction theorem states that very nonplanar graph contains either the utility graph UG=K_(3,3) or the pentatope graph K_5 as a graph minor. The graphs K_(3,3) ...
The ordinary differential equation (1) (Byerly 1959, p. 255). The solution is denoted E_m^p(x) and is known as an ellipsoidal harmonic of the first kind, or Lamé function. ...

...