Search Results for ""

For P and Q polynomials in n variables, |P·Q|_2^2=sum_(i_1,...,i_n>=0)(|P^((i_1,...,i_n))(D_1,...,D_n)Q(x_1,...,x_n)|_2^2)/(i_1!...i_n!), where D_i=partial/partialx_i, |X|_2 ...

A hash function H projects a value from a set with many (or even an infinite number of) members to a value from a set with a fixed number of (fewer) members. Hash functions ...

Let d_G(k) be the number of dominating sets of size k in a graph G, then the domination polynomial D_G(x) of G in the variable x is defined as ...

An obtuse triangle is a triangle in which one of the angles is an obtuse angle. (Obviously, only a single angle in a triangle can be obtuse or it wouldn't be a triangle.) A ...

Baud rate is a measure of the number of times per second a signal in a communications channel changes state. The state is usually voltage level, frequency, or phase angle.

A complex rotation is a map of the form z|->ze^(itheta), where theta is a real number, which corresponds to counterclockwise rotation by theta radians about the origin of ...

The Dürer graph is the skeleton of Dürer's solid, which is the generalized Petersen graph GP(6,2). It is illustrated above in a number of embeddings. It is implemented in the ...

A finite geometry is a geometry with a finite number of points. When confined to a plane, all finite geometries are either projective plane geometries (with no parallel ...

A mental device used to aid memorization. Common mnemonics for mathematical constants such as e and pi consist of sentences in which the number of letters in each word give ...

Given a convex plane region with area A and perimeter p, A-1/2p<N<=A+1/2p+1, where N is the number of enclosed lattice points (Nosarzewska 1948). This improves on Jarnick's ...