Search Results for ""

A series suma(n)e^(-lambda(n)z), where a(n) and z are complex and {lambda(n)} is a monotonic increasing sequence of real numbers. The numbers lambda(n) are called the ...

kappa(d)={(2lneta(d))/(sqrt(d)) for d>0; (2pi)/(w(d)sqrt(|d|)) for d<0, (1) where eta(d) is the fundamental unit and w(d) is the number of substitutions which leave the ...

A.k.a. the pigeonhole principle. Given n boxes and m>n objects, at least one box must contain more than one object. This statement has important applications in number theory ...

Dirichlet's principle, also known as Thomson's principle, states that there exists a function u that minimizes the functional D[u]=int_Omega|del u|^2dV (called the Dirichlet ...

A graph G is said to be disconnected if it is not connected, i.e., if there exist two nodes in G such that no path in G has those nodes as endpoints. The numbers of ...

A topological space that is not connected, i.e., which can be decomposed as the disjoint union of two nonempty open subsets. Equivalently, it can be characterized as a space ...

A statistical distribution whose variables can take on only discrete values. Abramowitz and Stegun (1972, p. 929) give a table of the parameters of most common discrete ...

The term discrete percolation is used to describe models of percolation theory whose media are discrete sets like sets of regular lattice points (e.g., bond percolation and ...

A set S is discrete in a larger topological space X if every point x in S has a neighborhood U such that S intersection U={x}. The points of S are then said to be isolated ...

The discrete uniform distribution is also known as the "equally likely outcomes" distribution. Letting a set S have N elements, each of them having the same probability, then ...