Search Results for ""
521 - 530 of 1837 for Klein Gordon EquationSearch Results
L_nu(z) = (1/2z)^(nu+1)sum_(k=0)^(infty)((1/2z)^(2k))/(Gamma(k+3/2)Gamma(k+nu+3/2)) (1) = (2(1/2z)^nu)/(sqrt(pi)Gamma(nu+1/2))int_0^(pi/2)sinh(zcostheta)sin^(2nu)thetadtheta, ...
An oval is a curve resembling a squashed circle but, unlike the ellipse, without a precise mathematical definition. The word oval derived from the Latin word "ovus" for egg. ...
Schur's partition theorem lets A(n) denote the number of partitions of n into parts congruent to +/-1 (mod 6), B(n) denote the number of partitions of n into distinct parts ...
In general, a topological index, sometimes also known as a graph-theoretic index, is a numerical invariant of a chemical graph (Plavšić et al. 1993). Particular topological ...
The McLaughlin graph is a 112-regular graph on 275 nodes and 15400 edges that can be constructed from the Witt design. It is distance-regular with intersection array ...
A (0,2)-graph is a connected graph such that any two vertices have 0 or 2 common neighbors. (0,2)-graphs are regular, and the numbers of (0,2)-graphs with vertex degree 0, 1, ...
257 is a Fermat prime, and the 257-gon is therefore a constructible polygon using compass and straightedge, as proved by Gauss. An illustration of the 257-gon is not included ...
Betti numbers are topological objects which were proved to be invariants by Poincaré, and used by him to extend the polyhedral formula to higher dimensional spaces. ...
Construct a square equal in area to a circle using only a straightedge and compass. This was one of the three geometric problems of antiquity, and was perhaps first attempted ...
Cube duplication, also called the Delian problem, is one of the geometric problems of antiquity which asks, given the length of an edge of a cube, that a second cube be ...
...
View search results from all Wolfram sites (23118 matches)

