Search Results for ""

The Wormald graph is a unit-distance 4-chromatic graph with girth 5 on 13+5(13; 5)=6448 vertices.

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 wreath graph W(n,k) is the graph obtained by taking n collections of k nodes and arranging around a circle such that all nodes in adjacent collections are connected. ...

The entire function phi(rho,beta;z)=sum_(k=0)^infty(z^k)/(k!Gamma(rhok+beta)), where rho>-1 and beta in C, named after the British mathematician E. M. Wright.

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

The Wronskian of a set of n functions phi_1, phi_2, ... is defined by W(phi_1,...,phi_n)=|phi_1 phi_2 ... phi_n; phi_1^' phi_2^' ... phi_n^'; | | ... |; phi_1^((n-1)) ...

An equilibrium minimal surface for a crystal or drop which has the least anisotropic surface free energy for a given volume. It is the anisotropic analog of a sphere. In the ...

An illusion invented by the German psychologist Wilhelm Wundt in the 19th century. In the figure above, the two red horizontal lines are both straight, but they look as if ...

Wyler's constant is defined as alpha_W = 9/(8pi^4)((pi^5)/(2^4·5!))^(1/4) (1) = 0.0072973... (2) = 1/(137.0360824...) (3) (Wyler 1969, 1971; OEIS A180872 and A180873), which ...

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