Search Results for ""

A scale-free network is a connected graph or network with the property that the number of links k originating from a given node exhibits a power law distribution ...

A partition whose conjugate partition is equivalent to itself. The Ferrers diagrams corresponding to the self-conjugate partitions for 3<=n<=10 are illustrated above. The ...

Let a simple graph G have n vertices, chromatic polynomial P(x), and chromatic number chi. Then P(G) can be written as P(G)=sum_(i=0)^ha_i·(x)_(p-i), where h=n-chi and (x)_k ...

A sparse matrix is a matrix that allows special techniques to take advantage of the large number of "background" (commonly zero) elements. The number of zeros a matrix needs ...

Triskaidekaphobia is the fear of 13, a number commonly associated with bad luck in Western culture. While fear of the number 13 can be traced back to medieval times, the word ...

Wolfram's iteration is an algorithm for computing the square root of a rational number 1<=r<4 using properties of the binary representation of r. The algorithm begins with ...

A game played with two heaps of counters in which a player may take any number from either heap or the same number from both. The player taking the last counter wins. The rth ...

Van der Corput sequences are a means of generating sequences of points that are maximally self-avoiding (a.k.a. quasirandom sequences). In the one-dimensional case, the ...

A diamond-shaped neighborhood that can be used to define a set of cells surrounding a given cell (x_0,y_0) that may affect the evolution of a two-dimensional cellular ...

A formula for the Bell polynomial and Bell numbers. The general formula states that B_n(x)=e^(-x)sum_(k=0)^infty(k^n)/(k!)x^k, (1) where B_n(x) is a Bell polynomial (Roman ...