Search Results for ""

Define the nome by q=e^(-piK^'(k)/K(k))=e^(ipitau), (1) where K(k) is the complete elliptic integral of the first kind with modulus k, K^'(k)=K(sqrt(1-k^2)) is the ...

A q-analog of the Saalschütz theorem due to Jackson is given by where _3phi_2 is the q-hypergeometric function (Koepf 1998, p. 40; Schilling and Warnaar 1999).

The van der Grinten projection is a map projection given by the transformation x = (1) y = sgn(phi)(pi|PQ-Asqrt((A^2+1)(P^2+A^2)-Q^2)|)/(P^2+A^2), (2) where A = ...

A diamond-shaped neighborhood that can be used to define a set of cells surrounding a given cell (x_0,y_0) that may affect the evolution of a two-dimensional cellular ...

A graph G is distance transitive if its automorphism group is transitive on pairs of vertices at each pairwise distance in the graph. Distance-transitivity is a ...

A square number, also called a perfect square, is a figurate number of the form S_n=n^2, where n is an integer. The square numbers for n=0, 1, ... are 0, 1, 4, 9, 16, 25, 36, ...

A Pythagorean triple is a triple of positive integers a, b, and c such that a right triangle exists with legs a,b and hypotenuse c. By the Pythagorean theorem, this is ...

Bertrand's postulate, also called the Bertrand-Chebyshev theorem or Chebyshev's theorem, states that if n>3, there is always at least one prime p between n and 2n-2. ...

A bipartite graph, also called a bigraph, is a set of graph vertices decomposed into two disjoint sets such that no two graph vertices within the same set are adjacent. A ...

The chromatic number of a graph G is the smallest number of colors needed to color the vertices of G so that no two adjacent vertices share the same color (Skiena 1990, p. ...