Search Results for ""

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

The Newton-Cotes formulas are an extremely useful and straightforward family of numerical integration techniques. To integrate a function f(x) over some interval [a,b], ...

A run is a sequence of more than one consecutive identical outcomes, also known as a clump. Let R_p(r,n) be the probability that a run of r or more consecutive heads appears ...

A spanning tree of a graph on n vertices is a subset of n-1 edges that form a tree (Skiena 1990, p. 227). For example, the spanning trees of the cycle graph C_4, diamond ...

The spherical harmonics Y_l^m(theta,phi) are the angular portion of the solution to Laplace's equation in spherical coordinates where azimuthal symmetry is not present. Some ...

The Bernoulli numbers B_n are a sequence of signed rational numbers that can be defined by the exponential generating function x/(e^x-1)=sum_(n=0)^infty(B_nx^n)/(n!). (1) ...

The dodecahedral graph is the Platonic graph corresponding to the connectivity of the vertices of a dodecahedron, illustrated above in four embeddings. The left embedding ...

"The" octahedral graph is the 6-node 12-edge Platonic graph having the connectivity of the octahedron. It is isomorphic to the circulant graph Ci_6(1,2), the cocktail party ...

"The" tetrahedral graph is the Platonic graph that is the unique polyhedral graph on four nodes which is also the complete graph K_4 and therefore also the wheel graph W_4. ...