Search Results for ""

Discrepancy is a measure of the deviation of a point set from a uniform distribution. In general, the computation of the discrepancy of a point set is computationally ...

Given a point set P={x_n}_(n=0)^(N-1) in the s-dimensional unit cube [0,1)^s, the star discrepancy is defined as D_N^*(P)=sup_(J in Upsilon^*)D(J,P), (1) where the local ...

The metric g defined on a nonempty set X by g(x,x) = 0 (1) g(x,y) = 1 (2) if x!=y for all x,y in X. It follows that the open ball of radius r>0 and center at x_0 B(x_0,r)={x ...

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

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 term in logic used to describe the operation commonly known as OR. A literal is considered a (degenerate) disjunction (Mendelson 1997, p. 30). The Wolfram Language ...

A disjunctive syllogism is a valid argument form in propositional calculus, where p and q are propositions: (p v q; ¬p)/(∴q). For example, if someone is going to study law or ...

The disorder number of a simple connected graph on n vertices is defined as the maximum length of a walk along the edges of the graph taken over all ordering of its vertices ...

Any pair of equations giving the real part of a function as an integral of its imaginary part and the imaginary part as an integral of its real part. Dispersion relationships ...