Search Results for ""

The circumsphere of given set of points, commonly the vertices of a solid, is a sphere that passes through all the points. A circumsphere does not always exist, but when it ...

A product of ANDs, denoted ^ _(k=1)^nA_k. The conjunctions of a Boolean algebra A of subsets of cardinality p are the 2^p functions A_lambda= union _(i in lambda)A_i, where ...

A topological space decomposes into its connected components. The connectedness relation between two pairs of points satisfies transitivity, i.e., if a∼b and b∼c then a∼c. ...

The word "degree" has many meanings in mathematics. The most common meaning is the unit of angle measure defined such that an entire rotation is 360 degrees. This unit harks ...

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 Drazin inverse is a matrix inverse-like object derived from a given square matrix. In particular, let the index k of a square matrix be defined as the smallest ...

The edge connectivity, also called the line connectivity, of a graph is the minimum number of edges lambda(G) whose deletion from a graph G disconnects G. In other words, it ...

The edge count of a graph g, commonly denoted M(g) or E(g) and sometimes also called the edge number, is the number of edges in g. In other words, it is the cardinality of ...

The set containing no elements, commonly denoted emptyset or emptyset, the former of which is used in this work. These correspond to Wolfram Language and TeX characters ...

The "imaginary error function" erfi(z) is an entire function defined by erfi(z)=-ierf(iz), (1) where erf(z) is the erf function. It is implemented in the Wolfram Language as ...