Search Results for ""

There are certain optimization problems that become unmanageable using combinatorial methods as the number of objects becomes large. A typical example is the traveling ...

In algebraic topology, a p-skeleton is a simplicial subcomplex of K that is the collection of all simplices of K of dimension at most p, denoted K^((p)). The graph obtained ...

For a braid with M strands, R components, P positive crossings, and N negative crossings, {P-N<=U_++M-R if P>=N; P-N<=U_-+M-R if P<=N, (1) where U_+/- are the smallest number ...

The small rhombicosidodecahedral graph is a quartic graph on 60 nodes and 120 edges that corresponds to the skeleton of the small rhombicosidodecahedron, as well as the great ...

The small rhombicuboctahedral graph is a quartic graph on 24 nodes and 48 edges that corresponds to the skeleton of the small rhombicuboctahedron. It has graph diameter 5, ...

A smooth function is a function that has continuous derivatives up to some desired order over some domain. A function can therefore be said to be smooth over a restricted ...

A number taken to the power 2 is said to be squared, so x^2 is called "x squared." This terminology derives from the fact that the area of a square of edge length x is given ...

The number of staircase walks on a grid with m horizontal lines and n vertical lines is given by (m+n; m)=((m+n)!)/(m!n!) (Vilenkin 1971, Mohanty 1979, Narayana 1979, Finch ...

There are at least two distinct notions of when a point process is stationary. The most commonly utilized terminology is as follows: Intuitively, a point process X defined on ...

The survival function describes the probability that a variate X takes on a value greater than a number x (Evans et al. 2000, p. 6). The survival function is therefore ...