Search Results for ""

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

Let S be a semigroup and alpha a positive real-valued function on S such that alpha(st)<=alpha(s)alpha(t) (s,t in S). If l^1(S,alpha) is the set of all complex-valued ...

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

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