Search Results for ""

There are two different definitions of generalized Fermat numbers, one of which is more general than the other. Ribenboim (1996, pp. 89 and 359-360) defines a generalized ...

A generalized hexagon is a generalized polygon of order 6. GH(1,2) is more commonly known as the Heawood graph, but is also the (3,6)-cage graph, the cubic vertex-transitive ...

The generalized law of sines applies to a simplex in space of any dimension with constant Gaussian curvature. Let us work up to that. Initially in two-dimensional space, we ...

A generalized mobile automaton is a generalization of the mobile automaton in which the automaton may have more than one active cell. Generalized mobile automata allow for ...

A generalized octagon GO(n,k) is a generalized polygon of order 8. GO(1,2) is the (3,8)-cage graph, the incidence graph of the Cremona-Richmond configuration, the cubic ...

A genetic algorithm is a class of adaptive stochastic optimization algorithms involving search and optimization. Genetic algorithms were first used by Holland (1975). The ...

A geodesic is a locally length-minimizing curve. Equivalently, it is a path that a particle which is not accelerating would follow. In the plane, the geodesics are straight ...

The study of the probabilities involved in geometric problems, e.g., the distributions of length, area, volume, etc. for geometric objects under stated conditions. The ...

In continuum percolation theory, the so-called germ-grain model is an obvious generalization of both the Boolean and Boolean-Poisson models which is driven by an arbitrary ...

The Glaisher-Kinkelin constant A is defined by lim_(n->infty)(H(n))/(n^(n^2/2+n/2+1/12)e^(-n^2/4))=A (1) (Glaisher 1878, 1894, Voros 1987), where H(n) is the hyperfactorial, ...