Search Results for ""

The Steiner tree of some subset of the vertices of a graph G is a minimum-weight connected subgraph of G that includes all the vertices. It is always a tree. Steiner trees ...

The Struve function, denoted H_n(z) or occasionally H_n(z), is defined as H_nu(z)=(1/2z)^(nu+1)sum_(k=0)^infty((-1)^k(1/2z)^(2k))/(Gamma(k+3/2)Gamma(k+nu+3/2)), (1) where ...

By analogy with the sinc function, define the tanc function by tanc(z)={(tanz)/z for z!=0; 1 for z=0. (1) Since tanz/z is not a cardinal function, the "analogy" with the sinc ...

The traveling salesman problem is a problem in graph theory requiring the most efficient (i.e., least total distance) Hamiltonian cycle a salesman can take through each of n ...

The problem of finding the mean triangle area of a triangle with vertices picked inside a triangle with unit area was proposed by Watson (1865) and solved by Sylvester. It ...

The Wallis formula follows from the infinite product representation of the sine sinx=xproduct_(n=1)^infty(1-(x^2)/(pi^2n^2)). (1) Taking x=pi/2 gives ...

The one-dimensional wave equation is given by (partial^2psi)/(partialx^2)=1/(v^2)(partial^2psi)/(partialt^2). (1) In order to specify a wave, the equation is subject to ...

Topology

The number 24 is equal to 4! (four factorial). A number puzzle asks to construct 24 in as many ways possible using elementary mathematical operations on three copies of the ...

An Abelian variety which is canonically attached to an algebraic variety which is the solution to a certain universal problem. The Albanese variety is dual to the Picard ...