Search Results for ""

The edge connectivity, also called the line connectivity, of a graph is the minimum number of edges lambda(G) whose deletion from a graph G disconnects G. In other words, it ...

The set containing no elements, commonly denoted emptyset or emptyset, the former of which is used in this work. These correspond to Wolfram Language and TeX characters ...

The "imaginary error function" erfi(z) is an entire function defined by erfi(z)=-ierf(iz), (1) where erf(z) is the erf function. It is implemented in the Wolfram Language as ...

The even part Ev(n) of a positive integer n is defined by Ev(n)=2^(b(n)), where b(n) is the exponent of the exact power of 2 dividing n. The values for n=1, 2, ..., are 1, 2, ...

The Fourier transform of a Gaussian function f(x)=e^(-ax^2) is given by F_x[e^(-ax^2)](k) = int_(-infty)^inftye^(-ax^2)e^(-2piikx)dx (1) = ...

A topologically invariant property of a surface defined as the largest number of nonintersecting simple closed curves that can be drawn on the surface without separating it. ...

The half-normal distribution is a normal distribution with mean 0 and parameter theta limited to the domain x in [0,infty). It has probability and distribution functions ...

An apodization function chosen to minimize the height of the highest sidelobe (Hamming and Tukey 1949, Blackman and Tukey 1959). The Hamming function is given by ...

The grouping of data into bins (spaced apart by the so-called class interval) plotting the number of members in each bin versus the bin number. The above histogram shows the ...

A complex line bundle is a vector bundle pi:E->M whose fibers pi^(-1)(m) are a copy of C. pi is a holomorphic line bundle if it is a holomorphic map between complex manifolds ...