Search Results for ""

The Cauchy principal value of a finite integral of a function f about a point c with a<=c<=b is given by ...

erf(z) is the "error function" encountered in integrating the normal distribution (which is a normalized form of the Gaussian function). It is an entire function defined by ...

The Cameron graph is a strongly regular Hamiltonian graph on 231 vertices with parameters (nu,k,lambda,mu)=(231,30,9,3). It is distance-regular with intersection array ...

The constant a_(-1) in the Laurent series f(z)=sum_(n=-infty)^inftya_n(z-z_0)^n (1) of f(z) about a point z_0 is called the residue of f(z). If f is analytic at z_0, its ...

The Conway-Smith graph is a distance-transitive graph on 63 vertices having intersection array {10,6,4,1;1,2,6,10} (Hall 1980). It is also distance-transitive. It is denoted ...

The Doob graph D(m,n) is the graph given by the graph Cartesian product of m>=1 copies of the Shrikhande graph with a Hamming graph H(n,4). Doob graphs are distance-regular ...

A curve also known as the Gerono lemniscate. It is given by Cartesian coordinates x^4=a^2(x^2-y^2), (1) polar coordinates, r^2=a^2sec^4thetacos(2theta), (2) and parametric ...

If a complex function is analytic at all finite points of the complex plane C, then it is said to be entire, sometimes also called "integral" (Knopp 1996, p. 112). Any ...

In the most commonly used convention (e.g., Apostol 1967, pp. 202-204), the first fundamental theorem of calculus, also termed "the fundamental theorem, part I" (e.g., Sisson ...

The Gosset graph is a 27-regular graph on 56 vertices which is the skeleton of the Gosset polytope 3_(21). It is a distance-regular graph with intersection array ...