Search Results for ""

The inverse hyperbolic secant sech^(-1)z (Beyer 1987, p. 181; Zwillinger 1995, p. 481), sometimes called the area hyperbolic secant (Harris and Stocker 1998, p. 271) and ...

The inverse hyperbolic sine sinh^(-1)z (Beyer 1987, p. 181; Zwillinger 1995, p. 481), sometimes called the area hyperbolic sine (Harris and Stocker 1998, p. 264) is the ...

The m×n king graph is a graph with mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a king. The number ...

The Laplacian matrix, sometimes also called the admittance matrix (Cvetković et al. 1998, Babić et al. 2002) or Kirchhoff matrix, of a graph G, where G=(V,E) is an ...

A k×n Latin rectangle is a k×n matrix with elements a_(ij) in {1,2,...,n} such that entries in each row and column are distinct. If k=n, the special case of a Latin square ...

A 24-dimensional Euclidean lattice. An automorphism of the Leech lattice modulo a center of two leads to the Conway group Co_1. Stabilization of the one- and two-dimensional ...

Consider the Euler product zeta(s)=product_(k=1)^infty1/(1-1/(p_k^s)), (1) where zeta(s) is the Riemann zeta function and p_k is the kth prime. zeta(1)=infty, but taking the ...

An elliptic curve of the form y^2=x^3+n for n an integer. This equation has a finite number of solutions in integers for all nonzero n. If (x,y) is a solution, it therefore ...

A noncayley graph is a graph which is not a Cayley graph. All graphs that are not vertex-transitive are noncayley graphs. However, some vertex-transitive graph are noncayley. ...

A nonhamiltonian graph is a graph that is not Hamiltonian. All disconnected graphs are therefore nonhamiltoinian, as are acylic graphs. Classes of connected graphs that are ...