Search Results for ""

Another name for the confluent hypergeometric function of the second kind, defined by where Gamma(x) is the gamma function and _1F_1(a;b;z) is the confluent hypergeometric ...

A loop of an graph is degenerate edge that joins a vertex to itself, also called a self-loop. A simple graph cannot contain any loops, but a pseudograph can contain both ...

The rank of a graph G is defined as r(G)=n-c, where n is the number of vertices on G and c is the number of connected components (Biggs 1993, p. 25).

The great rhombicuboctahedral graph is the cubic Archimedean graph on 48 nodes and 72 edges that is the skeleton of the great rhombicuboctahedron as well as the great ...

A group set is a set whose elements are acted on by a group. If the group G acts on the set S, then S is called a G-set. Let G be a group and let S be a G-set. Then for every ...

There exists a system of distinct representatives for a family of sets S_1, S_2, ..., S_m iff the union of any k of these sets contains at least k elements for all k from 1 ...

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

The 6-polyiamond illustrated above.

Hilbert-Schmidt theory is the study of linear integral equations of the Fredholm type with symmetric integral kernels K(x,t)=K(t,x).

Let Gamma be an algebraic curve in a projective space of dimension n, and let p be the prime ideal defining Gamma, and let chi(p,m) be the number of linearly independent ...