TOPICS
Search

Search Results for ""


2641 - 2650 of 4217 for Strong Lawof Small NumbersSearch Results
A path constructed by repeatedly finding a path of positive capacity from a source to a sink and then adding it to the flow (Skiena 1990, p. 237). An augmenting path for a ...
An Aztec diamond of order n is the region obtained from four staircase shapes of height n by gluing them together along the straight edges. It can therefore be defined as the ...
A 1-variable unoriented knot polynomial Q(x). It satisfies Q_(unknot)=1 (1) and the skein relationship Q_(L_+)+Q_(L_-)=x(Q_(L_0)+Q_(L_infty)). (2) It also satisfies ...
Consider an infinite repository containing balls of n different types. Then the following table summarizes the number of distinct ways in which k balls can be picked for four ...
First stated in 1924, the Banach-Tarski paradox states that it is possible to decompose a ball into six pieces which can be reassembled by rigid motions to form two balls of ...
An (n,k)-banana tree, as defined by Chen et al. (1997), is a graph obtained by connecting one leaf of each of n copies of an k-star graph with a single root vertex that is ...
A column-convex self-avoiding polygon which contains the bottom edge of its minimal bounding rectangle. The anisotropic perimeter and area generating function ...
The Barth decic is a decic surface in complex three-dimensional projective space having the maximum possible number of ordinary double points, namely 345. It is given by the ...
The Barth sextic is a sextic surface in complex three-dimensional projective space having the maximum possible number of ordinary double points, namely 65. The surface was ...
The binary logarithm log_2x is the logarithm to base 2. The notation lgx is sometimes used to denote this function in number theoretic literature. However, because Russian ...
1 ... 262|263|264|265|266|267|268 ... 422 Previous Next

...