Search Results for ""

The prime link 05-0201, illustrated above, with braid word sigma_1^2sigma_2^2sigma_1^(-1)sigma_2^(-2) or sigma_1sigma_2^(-1)sigma_1sigma_2^(-2) and Jones polynomial ...

Let V be a real symmetric matrix of large order N having random elements v_(ij) that for i<=j are independently distributed with equal densities, equal second moments m^2, ...

WireWorld is a two-dimensional four-color cellular automaton introduced by Brian Silverman in 1987. The rule for the automaton uses the cell's old value a together with the ...

A prime p is called a Wolstenholme prime if the central binomial coefficient (2p; p)=2 (mod p^4), (1) or equivalently if B_(p-3)=0 (mod p), (2) where B_n is the nth Bernoulli ...

The Wong graph is one of the four (5,5)-cage graphs. Like the other (5,5)-cages, the Wong graph has 30 nodes. It has 75 edges, girth 5, diameter 3, chromatic number 4, and is ...

A knot property, also called the twist number, defined as the sum of crossings p of a link L, w(L)=sum_(p in C(L))epsilon(p), (1) where epsilon(p) defined to be +/-1 if the ...

Wynn's epsilon-method is a method for numerical evaluation of sums and products that samples a number of additional terms in the series and then tries to extrapolate them by ...

In the English language, the probability of encountering the rth most common word is given roughly by P(r)=0.1/r for r up to 1000 or so. The law breaks down for less frequent ...

Let a random n×n (0,1)-matrix have entries which are 1 (with probability p) or 0 (with probability q=1-p) and numbers are assigned to the edges of a grid. A b-cluster is an ...

Two distinct theorems are referred to as "the de Bruijn-Erdős theorem." One of them (de Bruijn and Erdős 1951) concerns the chromatic number of infinite graphs; the other (de ...