Search Results for ""

Given a distance-regular graph G with integers b_i,c_i,i=0,...,d such that for any two vertices x,y in G at distance i=d(x,y), there are exactly c_i neighbors of y in ...

An array A=a_(ij), i,j>=1 of positive integers is called an interspersion if 1. The rows of A comprise a partition of the positive integers, 2. Every row of A is an ...

A partially ordered set P=(X,<=) is an interval order if it is isomorphic to some set of intervals on the real line ordered by left-to-right precedence. Formally, P is an ...

A point process N on R is said to be interval stationary if for every r=1,2,3,... and for all integers i_i,...,i_r, the joint distribution of {tau_(i_1+k),...,tau_(i_r+k)} ...

An intrinsically linked graph is a graph having the property that any embedding of it in three dimensions contains a nontrivial link. A graph is intrinsically linked iff it ...

An invariant set S subset R^n is said to be a C^r (r>=1) invariant manifold if S has the structure of a C^r differentiable manifold (Wiggins 1990, p. 14). When stable and ...

The notion of an inverse is used for many types of mathematical constructions. For example, if f:T->S is a function restricted to a domain S and range T in which it is ...

The inverse erf function is the inverse function erfc^(-1)(z) of erfc(x) such that erfc(erfc^(-1)(x))=erfc^(-1)(erfc(x)), (1) with the first identity holding for 0<x<2 and ...

Inverse function integration is an indefinite integration technique. While simple, it is an interesting application of integration by parts. If f and f^(-1) are inverses of ...

The inverse Gaussian distribution, also known as the Wald distribution, is the distribution over [0,infty) with probability density function and distribution function given ...