Search Results for ""

The Meijer G-function is a very general function which reduces to simpler special functions in many common cases. The Meijer G-function is defined by (1) where Gamma(s) is ...

A vertex coloring is an assignment of labels or colors to each vertex of a graph such that no edge connects two identically colored vertices. A vertex coloring that minimize ...

A quadratic form Q(z) is said to be positive definite if Q(z)>0 for z!=0. A real quadratic form in n variables is positive definite iff its canonical form is ...

Let G be a graph, and suppose each edge of G is independently deleted with fixed probability 0<=p<=1. Then the probability that no connected component of G is disconnected as ...

A simple group is a group whose only normal subgroups are the trivial subgroup of order one and the improper subgroup consisting of the entire original group. Simple groups ...

The snub dodecahedron is an Archimedean solid consisting of 92 faces (80 triangular, 12 pentagonal), 150 edges, and 60 vertices. It is sometimes called the dodecahedron simum ...

A special function is a function (usually named after an early investigator of its properties) having a particular use in mathematical physics or some other branch of ...

The truncated octahedral graph is the cubic Archimedean graph on 24 nodes and 36 edges that is the skeleton of the truncated octahedron. It is isomorphic to the Bruhat graph ...

A connection on a vector bundle pi:E->M is a way to "differentiate" bundle sections, in a way that is analogous to the exterior derivative df of a function f. In particular, ...

A dozen dozen, also called a gross. 144 is a square number and a sum-product number.