Search Results for ""

The Suetake graph is a weakly regular Hamiltonian graph on 231 vertices with parameters (nu,k,lambda,mu)=(72,(12),(0),(0,4)). It is distance-regular with intersection array ...

In the tabu search category of meta-heuristics, the essential idea is to 'forbid' search moves to points already visited in the (usually discrete) search space, at least for ...

Given a circular table of diameter 9 feet, which is the minimal number of planks (each 1 foot wide and length greater than 9 feet) needed in order to completely cover the ...

The skeleton of the tesseract, commonly denoted Q_4, is a quartic symmetric graph with girth 4 and diameter 4. The automorphism group of the tesseract is of order 2^7·3=384 ...

Whitehead and Russell (1927) devised a hierarchy of "types" in order to eliminate self-referential statements from Principia Mathematica, which purported to derive all of ...

Let [arg(f(z))] denote the change in the complex argument of a function f(z) around a contour gamma. Also let N denote the number of roots of f(z) in gamma and P denote the ...

The Weierstrass elliptic functions (or Weierstrass P-functions, voiced "p-functions") are elliptic functions which, unlike the Jacobi elliptic functions, have a second-order ...

A version of set theory which is a formal system expressed in first-order predicate logic. Zermelo-Fraenkel set theory is based on the Zermelo-Fraenkel axioms. ...

The Van Lint-Schrijver Graph graph is a weakly regular Hamiltonian graph on 162 vertices with parameters (nu,k,lambda,mu)=(162,(6),(0),(0,1)). It is distance-regular with ...

A continuous distribution defined on the range x in [0,2pi) with probability density function P(x)=(e^(bcos(x-a)))/(2piI_0(b)), (1) where I_0(x) is a modified Bessel function ...