Search Results for ""

The term "gradient" has several meanings in mathematics. The simplest is as a synonym for slope. The more general gradient, called simply "the" gradient in vector analysis, ...

Let a Gram point g_n be called "good" if (-1)^nZ(g_n)>0, and "bad" otherwise (Rosser et al. 1969; Edwards 2001, p. 180). Then the interval between two consecutive good Gram ...

Gram's law (Hutchinson 1925; Edwards 2001, pp. 125, 127, and 171) is the tendency for zeros of the Riemann-Siegel function Z(t) to alternate with Gram points. Stated more ...

The granny knot is a composite knot of six crossings consisting of a knot sum of two left-handed trefoils with the same orientation (Rolfsen 1976, p. 220). The granny knot ...

Given a "good" graph G (i.e., one for which all intersecting graph edges intersect in a single point and arise from four distinct graph vertices), the crossing number is the ...

In Season 4 episode "Black Swan" of the television crime drama NUMB3RS, the character Amita Ramanujan refers to graph entropies when studying a map of the Los Angeles while ...

The genus gamma(G) of a graph G is the minimum number of handles that must be added to the plane to embed the graph without any crossings. A graph with genus 0 is embeddable ...

An (m+1)-dimensional subspace W of an (n+1)-dimensional vector space V can be specified by an (m+1)×(n+1) matrix whose rows are the coordinates of a basis of W. The set of ...

The polyhedron compound of the great icosahedron (U_(53)) and the small stellated dodecahedron (U_(34)), sometimes known as the great cid. Four faces meet at each edge of the ...

700 The great dodecahemicosahedron is the uniform polyhedron with Maeder index 65 (Maeder 1997), Wenninger index 102 (Wenninger 1989), Coxeter index 81 (Coxeter et al. 1954), ...