Search Results for ""

An urelement contains no elements, belongs to some set, and is not identical with the empty set (Moore 1982, p. 3; Rubin 1967, p. 23). "Ur" is a German prefix which is ...

Vardi's integral is the beautiful definite integral int_(pi/4)^(pi/2)lnlntanxdx = pi/2ln[sqrt(2pi)(Gamma(3/4))/(Gamma(1/4))] (1) = pi/4ln[(4pi^3)/(Gamma^4(1/4))] (2) = ...

Although the multiplication of one vector by another is not uniquely defined (cf. scalar multiplication, which is multiplication of a vector by a scalar), several types of ...

The vertex set of a graph is simply a set of all vertices of the graph. The cardinality of the vertex set for a given graph g is known as the vertex count of g. The vertex ...

Vizing's theorem states that a graph can be edge-colored in either Delta or Delta+1 colors, where Delta is the maximum vertex degree of the graph. This partitions graphs into ...

Let J_nu(z) be a Bessel function of the first kind, Y_nu(z) a Bessel function of the second kind, and K_nu(z) a modified Bessel function of the first kind. Also let R[z]>0 ...

Let X=(X,tau) be a topological vector space whose continuous dual X^* may or may not separate points (i.e., may or may not be T2). The weak-* (pronounced "weak star") ...

An analytic function approaches any given value arbitrarily closely in any epsilon-neighborhood of an essential singularity.

Let sum_(n=1)^(infty)u_n(x) be a series of functions all defined for a set E of values of x. If there is a convergent series of constants sum_(n=1)^inftyM_n, such that ...

The word weight has many uses in mathematics. It can refer to a function w(x) (also called a weighting function or weighting function) used to normalize orthogonal functions. ...