Search Results for ""

Klee's identity is the binomial sum sum_(k=0)^n(-1)^k(n; k)(n+k; m)=(-1)^n(n; m-n), where (n; k) is a binomial coefficient. For m=0, 1, ... and n=0, 1,..., the following ...

Kloosterman's sum is defined by S(u,v,n)=sum_(h)exp[(2pii(uh+vh^_))/n], (1) where h runs through a complete set of residues relatively prime to n and h^_ is defined by hh^_=1 ...

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 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 ...

A knot diagram is a picture of a projection of a knot onto a plane. Usually, only double points are allowed (no more than two points are allowed to be superposed), and the ...

In general, it is possible to link two n-dimensional hyperspheres in (n+2)-dimensional space in an infinite number of inequivalent ways. In dimensions greater than n+2 in the ...

Two oriented knots (or links) can be summed by placing them side by side and joining them by straight bars so that orientation is preserved in the sum. The knot sum is also ...

The Krackhardt kite is the simple graph on 10 nodes and 18 edges illustrated above. It arises in social network theory. It is implemented in the Wolfram Language as ...

Let (a)_i and (b)_i be sequences of complex numbers such that b_j!=b_k for j!=k, and let the lower triangular matrices F=(f)_(nk) and G=(g)_(nk) be defined as ...

The Kronecker-Weber theorem, sometimes known as the Kronecker-Weber-Hilbert theorem, is one of the earliest known results in class field theory. In layman's terms, the ...