Search Results for ""

The function defined by U(p)=(p#)^(p#), where p is a prime number and p# is a primorial. The values for p=2, 3, ..., are 4, 46656, ...

A random number which lies within a specified range (which can, without loss of generality, be taken as [0, 1]), with a uniform distribution.

The number of graph edges meeting at a given node in a graph is called the order of that graph vertex.

x^n=sum_(k=0)^n<n; k>(x+k; n), where <n; k> is an Eulerian number and (n; k) is a binomial coefficient (Worpitzky 1883; Comtet 1974, p. 242).

The "contiguous USA graph" is the graph whose vertices represent the contiguous 48 states of the United States plus the District of Columbia (DC) and whose edges connect ...

Yahtzee is a game played with five 6-sided dice. Players take turns rolling the dice, and trying to get certain types of rolls, each with an assigned point value, as ...

Given a point set P={x_n}_(n=0)^(N-1) in the s-dimensional unit cube [0,1)^s, the local discrepancy is defined as D(J,P)=|(number of x_n in J)/N-Vol(J)|, Vol(J) is the ...

A quaternion with complex coefficients. The algebra of biquaternions is isomorphic to a full matrix ring over the complex number field (van der Waerden 1985).

A graph or directed graph together with a function which assigns a positive real number to each edge (Harary 1994, p. 52).

The rank polynomial R(x,y) of a general graph G is the function defined by R(x,y)=sum_(S subset= E(G))x^(r(S))y^(s(S)), (1) where the sum is taken over all subgraphs (i.e., ...