Search Results for ""

A convex polyhedron can be defined algebraically as the set of solutions to a system of linear inequalities mx<=b, where m is a real s×3 matrix and b is a real s-vector. ...

Given a planar graph G, a geometric dual graph and combinatorial dual graph can be defined. Whitney showed that these are equivalent (Harary 1994), so that one may speak of ...

Let the elliptic modulus k satisfy 0<k^2<1, and the Jacobi amplitude be given by phi=amu with -pi/2<phi<pi/2. The incomplete elliptic integral of the first kind is then ...

Erfc is the complementary error function, commonly denoted erfc(z), is an entire function defined by erfc(z) = 1-erf(z) (1) = 2/(sqrt(pi))int_z^inftye^(-t^2)dt. (2) It is ...

The Gaussian integral, also called the probability integral and closely related to the erf function, is the integral of the one-dimensional Gaussian function over ...

The Hamiltonian number h(n) of a connected graph G is the length of a Hamiltonian walk G. In other words, it is the minimum length of a closed spanning walk in the graph. For ...

Consider two mutually tangent (externally) spheres A and B together with a larger sphere C inside which A and B are internally tangent. Then construct a chain of spheres each ...

Homology is a concept that is used in many branches of algebra and topology. Historically, the term "homology" was first used in a topological sense by Poincaré. To him, it ...

The hypersine (n-dimensional sine function) is a function of a vertex angle of an n-dimensional parallelotope or simplex. If the content of the parallelotope is P and the ...

Applying the stellation process to the icosahedron gives 20+30+60+20+60+120+12+30+60+60 cells of 11 different shapes and sizes (including the icosahedron itself). The ...