Search Results for ""

Euclidean n-space, sometimes called Cartesian space or simply n-space, is the space of all n-tuples of real numbers, (x_1, x_2, ..., x_n). Such n-tuples are sometimes called ...

The expectation value of a function f(x) in a variable x is denoted <f(x)> or E{f(x)}. For a single discrete variable, it is defined by <f(x)>=sum_(x)f(x)P(x), (1) where P(x) ...

An extremum is a maximum or minimum. An extremum may be local (a.k.a. a relative extremum; an extremum in a given region which is not the overall maximum or minimum) or ...

Functional analysis is a branch of mathematics concerned with infinite-dimensional vector spaces (mainly function spaces) and mappings between them. The spaces may be of ...

A topologically invariant property of a surface defined as the largest number of nonintersecting simple closed curves that can be drawn on the surface without separating it. ...

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 assignment of labels or colors to the edges or vertices of a graph. The most common types of graph colorings are edge coloring and vertex coloring.

The great dodecahemidodecahedron is the uniform polyhedron with Maeder index 70 (Maeder 1997), Wenninger index 107 (Wenninger 1989), Coxeter index 86 (Coxeter et al. 1954), ...

Poisson's equation is del ^2phi=4pirho, (1) where phi is often called a potential function and rho a density function, so the differential operator in this case is L^~=del ...