Search Results for ""

In a network with three graph edges at each graph vertex, the number of Hamiltonian cycles through a specified graph edge is 0 or even.

A condition used in the definition of a mathematical object, commonly denoted : or |. For example, the rationals Q can be defined by Q={p/q:q!=0,p,q in Z}, read as "the set ...

A random number which lies within a specified range (which can, without loss of generality, be taken as [0, 1]), with a uniform distribution.

A zero tensor is a tensor of any rank and with any pattern of covariant and contravariant indices all of whose components are equal to 0 (Weinberg 1972, p. 38).

A trinomial coefficient is a coefficient of the trinomial triangle. Following the notation of Andrews (1990), the trinomial coefficient (n; k)_2, with n>=0 and -n<=k<=n, is ...

A bounded lattice is an algebraic structure L=(L, ^ , v ,0,1), such that (L, ^ , v ) is a lattice, and the constants 0,1 in L satisfy the following: 1. for all x in L, x ^ ...

A branch point of an analytic function is a point in the complex plane whose complex argument can be mapped from a single point in the domain to multiple points in the range. ...

A Banach space X has the approximation property (AP) if, for every epsilon>0 and each compact subset K of X, there is a finite rank operator T in X such that for each x in K, ...

A completely monotonic function is a function f(x) such that (-1)^(-n)f^((n))(x)>=0 for n=0, 1, 2, .... Such functions occur in areas such as probability theory (Feller ...

z(1-z)(d^2y)/(dz^2)+[c-(a+b+1)z](dy)/(dz)-aby=0. It has regular singular points at 0, 1, and infty. Every second-order ordinary differential equation with at most three ...