Search Results for ""

A discrete space is simply a topological space equipped with the discrete topology. A discrete space is always a metric space, namely the metric space with the same ...

A topology is given by a collection of subsets of a topological space X. The smallest topology has two open sets, the empty set emptyset and X. The largest topology contains ...

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

A discriminant is a quantity (usually invariant under certain classes of transformations) which characterizes certain properties of a quantity's roots. The concept of the ...

The disdyakis dodecahedral graph is Archimedean dual graph which is the skeleton of the disdyakis dodecahedron. It is implemented in the Wolfram Language as ...

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 triacontahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...

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

Two sets A_1 and A_2 are disjoint if their intersection A_1 intersection A_2=emptyset, where emptyset is the empty set. n sets A_1, A_2, ..., A_n are disjoint if A_i ...

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