Search Results for ""

If a real algebraic curve has no singularities except nodes and cusps, bitangents, and inflection points, then n+2tau_2^'+iota^'=m+2delta_2^'+kappa^', where n is the order, ...

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

Given a sum and a set of weights, find the weights which were used to generate the sum. The values of the weights are then encrypted in the sum. This system relies on the ...

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