Search Results for ""

Let a spherical triangle be drawn on the surface of a sphere of radius R, centered at a point O=(0,0,0), with vertices A, B, and C. The vectors from the center of the sphere ...

Watson (1939) considered the following three triple integrals, I_1 = 1/(pi^3)int_0^piint_0^piint_0^pi(dudvdw)/(1-cosucosvcosw) (1) = (4[K(1/2sqrt(2))]^2)/(pi^2) (2) = ...

As a consequence of Matiyasevich's refutation of Hilbert's 10th problem, it can be proved that there does not exist a general algorithm for solving a general quartic ...

A harmonic number is a number of the form H_n=sum_(k=1)^n1/k (1) arising from truncation of the harmonic series. A harmonic number can be expressed analytically as ...

A generalized hypergeometric function _pF_q(a_1,...,a_p;b_1,...,b_q;x) is a function which can be defined in the form of a hypergeometric series, i.e., a series for which the ...

The angles mpi/n (with m,n integers) for which the trigonometric functions may be expressed in terms of finite root extraction of real numbers are limited to values of m ...

The cubical graph is the Platonic graph corresponding to the connectivity of the cube. It is isomorphic to the generalized Petersen graph GP(4,1), bipartite Kneser graph ...

A connected graph G is distance-regular if for any vertices x and y of G and any integers i,j=0, 1, ...d (where d is the graph diameter), the number of vertices at distance i ...

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