Search Results for ""

In Kepler's 1619 book Harmonice Mundi on tilings, he discussed a tiling built with pentagons, pentagrams, decagons, and "fused decagon pairs." He also called them "monsters." ...

Let G be a k-regular graph with girth 5 and graph diameter 2. (Such a graph is a Moore graph). Then, k=2, 3, 7, or 57. A proof of this theorem is difficult (Hoffman and ...

The conjugate gradient method is an algorithm for finding the nearest local minimum of a function of n variables which presupposes that the gradient of the function can be ...

Let c_1, c_2, and c_3 be the circles through the vertices A_2 and A_3, A_1 and A_3, and A_1 and A_2, respectively, which intersect in the first Brocard point Omega. ...

A two-player game, also called crosscram, in which player H has horizontal dominoes and player V has vertical dominoes. The two players alternately place a domino on a board ...

The graph sum of graphs G and H is the graph with adjacency matrix given by the sum of adjacency matrices of G and H. A graph sum is defined when the orders of G and H are ...

The generalized minimal residual (GMRES) method (Saad and Schultz 1986) is an extension of the minimal residual method (MINRES), which is only applicable to symmetric ...

An urelement contains no elements, belongs to some set, and is not identical with the empty set (Moore 1982, p. 3; Rubin 1967, p. 23). "Ur" is a German prefix which is ...

An azimuthal projection which is neither equal-area nor conformal. Let phi_1 and lambda_0 be the latitude and longitude of the center of the projection, then the ...

The inverse of the Laplace transform F(t) = L^(-1)[f(s)] (1) = 1/(2pii)int_(gamma-iinfty)^(gamma+iinfty)e^(st)f(s)ds (2) f(s) = L[F(t)] (3) = int_0^inftyF(t)e^(-st)dt. (4)