Search Results for ""

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 ...

The disdyakis dodecahedron is the dual polyhedron of the Archimedean great rhombicuboctahedron A_3 and Wenninger dual W_(15). It is also called the hexakis octahedron ...

The disdyakis triacontahedron is the dual polyhedron of the Archimedean great rhombicosidodecahedron A_2. It is also known as the hexakis icosahedron (Holden 1971, p. 55). It ...

The disjoint union of two sets A and B is a binary operator that combines all distinct elements of a pair of given sets, while retaining the original set membership as a ...