Search Results for ""

Pascal's triangle is a number triangle with numbers arranged in staggered rows such that a_(nr)=(n!)/(r!(n-r)!)=(n; r), (1) where (n; r) is a binomial coefficient. The ...

The resistance distance between vertices i and j of a graph G is defined as the effective resistance between the two vertices (as when a battery is attached across them) when ...

Every planar graph (i.e., graph with graph genus 0) has an embedding on a torus. In contrast, toroidal graphs are embeddable on the torus, but not in the plane, i.e., they ...

There are four varieties of Airy functions: Ai(z), Bi(z), Gi(z), and Hi(z). Of these, Ai(z) and Bi(z) are by far the most common, with Gi(z) and Hi(z) being encountered much ...

The Alexander polynomial is a knot invariant discovered in 1923 by J. W. Alexander (Alexander 1928). The Alexander polynomial remained the only known knot polynomial until ...

The number obtained by adding the reciprocals of the odd twin primes, B=(1/3+1/5)+(1/5+1/7)+(1/(11)+1/(13))+(1/(17)+1/(19))+.... (1) By Brun's theorem, the series converges ...

A contingency table, sometimes called a two-way frequency table, is a tabular mechanism with at least two rows and two columns used in statistics to present categorical data ...

An algebraic surface of order 3. Schläfli and Cayley classified the singular cubic surfaces. On the general cubic, there exists a curious geometrical structure called double ...

Dawson's integral (Abramowitz and Stegun 1972, pp. 295 and 319), also sometimes called Dawson's function, is the entire function given by the integral F(x) = ...

The finite difference is the discrete analog of the derivative. The finite forward difference of a function f_p is defined as Deltaf_p=f_(p+1)-f_p, (1) and the finite ...