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

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

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

The inverse function of the Gudermannian y=gd^(-1)phi gives the vertical position y in the Mercator projection in terms of the latitude phi and may be defined for 0<=x<pi/2 ...

The inverse haversine function hav^(-1)(z) is defined by hav^(-1)(z)=2sin^(-1)(sqrt(z)). (1) The inverse haversine is implemented in the Wolfram Language as ...

The inverse limit of a family of R-modules is the dual notion of a direct limit and is characterized by the following mapping property. For a directed set I and a family of ...