Search Results for ""

The m×n knight graph is a graph on mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a knight (which may ...

The application of an apodization function.

The Narayan number N(n,k) for n=1, 2, ... and k=1, ..., n gives a solution to several counting problems in combinatorics. For example, N(n,k) gives the number of expressions ...

Consider a star graph S_(n+1) consisting of a central hub vertex and n spokes, but instead of placing a single point at the end of each spoke, place k points along it (in ...

The operator B^~ defined by B^~f(z)=int_D((1-|z|^2)^2)/(|1-zw^_|^4)f(w)dA(w) for z in D, where D is the unit open disk and w^_ is the complex conjugate (Hedenmalm et al. ...

A two-sided (doubly infinite) Laplace transform, L_t[f(t)](s)=int_(-infty)^inftyf(t)e^(-st)dt. While some authors use this as the primary definition of "the" Laplace ...

f(x)=C_psiint_(-infty)^inftyint_(-infty)^infty<f,psi^(a,b)>psi^(a,b)(x)a^(-2)dadb, where psi^(a,b)(x)=|a|^(-1/2)psi((x-b)/a). This result was originally derived using ...

Given a Jacobi amplitude phi in an elliptic integral, the argument u is defined by the relation phi=am(u,k). It is related to the elliptic integral of the first kind F(u,k) ...

Let f(x) be a positive definite, measurable function on the interval (-infty,infty). Then there exists a monotone increasing, real-valued bounded function alpha(t) such that ...

The Fourier transform of e^(-k_0|x|) is given by F_x[e^(-k_0|x|)](k)=int_(-infty)^inftye^(-k_0|x|)e^(-2piikx)dx = ...