Search Results for ""

The infinite product identity Gamma(1+v)=2^(2v)product_(m=1)^infty[pi^(-1/2)Gamma(1/2+2^(-m)v)], where Gamma(x) is the gamma function.

Let J_nu(z) be a Bessel function of the first kind, N_nu(z) a Bessel function of the second kind, and j_(nu,n)(z) the zeros of z^(-nu)J_nu(z) in order of ascending real part. ...

The Kneser graphs are a class of graph introduced by Lovász (1978) to prove Kneser's conjecture. Given two positive integers n and k, the Kneser graph K(n,k), often denoted ...

A combinatorial conjecture formulated by Kneser (1955). It states that whenever the n-subsets of a (2n+k)-set are divided into k+1 classes, then two disjoint subsets end up ...

The m×n knight graph is a graph on mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a knight (which may ...

The problem of determining how many nonattacking knights K(n) can be placed on an n×n chessboard. For n=8, the solution is 32 (illustrated above). In general, the solutions ...

The Knödel graph W_(Delta,n) is a regular bipartite graph of vertex degree Delta on n nodes for even n>=2 and 1<=Delta<=|_log_2n_| with edges defined as follows. Label the ...

For every k>=1, let C_k be the set of composite numbers n>k such that if 1<a<n, GCD(a,n)=1 (where GCD is the greatest common divisor), then a^(n-k)=1 (mod n). Special cases ...

In mathematics, a knot is defined as a closed, non-self-intersecting curve that is embedded in three dimensions and cannot be untangled to produce a simple loop (i.e., the ...

Let R^3 be the space in which a knot K sits. Then the space "around" the knot, i.e., everything but the knot itself, is denoted R^3-K and is called the knot complement of K ...