Search Results for ""

The Bellman-Ford algorithm is an algorithm for solving the shortest path problem, i.e., finding a graph geodesic between two given vertices. Other algorithms that can be used ...

The zeros of the derivative P^'(z) of a polynomial P(z) that are not multiple zeros of P(z) are the positions of equilibrium in the field of force due to unit particles ...

The hyperbolic octahedron is a hyperbolic version of the Euclidean octahedron, which is a special case of the astroidal ellipsoid with a=b=c=1. It is given by the parametric ...

Cylindrical coordinates are a generalization of two-dimensional polar coordinates to three dimensions by superposing a height (z) axis. Unfortunately, there are a number of ...

The least common multiple of two numbers a and b, variously denoted LCM(a,b) (this work; Zwillinger 1996, p. 91; Råde and Westergren 2004, p. 54), lcm(a,b) (Gellert et al. ...

The polylogarithm Li_n(z), also known as the Jonquière's function, is the function Li_n(z)=sum_(k=1)^infty(z^k)/(k^n) (1) defined in the complex plane over the open unit ...

The study of angles and of the angular relationships of planar and three-dimensional figures is known as trigonometry. The trigonometric functions (also called the circular ...

The 57-cell, also called the pentacontaheptachoron, is a regular self-dual locally projective polytope with 57 hemidodecahedral facets described by Coxeter (1982) and also ...

A transformation which transforms from a two-dimensional continuous uniform distribution to a two-dimensional bivariate normal distribution (or complex normal distribution). ...

A CW-complex is a homotopy-theoretic generalization of the notion of a simplicial complex. A CW-complex is any space X which can be built by starting off with a discrete ...