Search Results for ""

The inverse function of the logarithm, defined such that log_b(antilog_bz)=z=antilog_b(log_bz). The antilogarithm in base b of z is therefore b^z.

rho_(2s)(n)=(pi^s)/(Gamma(s))n^(s-1)sum_(p,q)((S_(p,q))/q)^(2s)e^(2nppii/q), where S_(p,q) is a Gaussian sum, and Gamma(s) is the gamma function.

The apodization function A(x)=(1-(x^2)/(a^2))^2. Its full width at half maximum is sqrt(4-2sqrt(2))a. Its instrument function is ...

The interesting function defined by the definite integral G(x)=int_0^xsin(tsint)dt, illustrated above (Glasser 1990). The integral cannot be done in closed form, but has a ...

Guy's conjecture, which has not yet been proven or disproven, states that the graph crossing number for a complete graph K_n is ...

A weakly binary tree is a planted tree in which all nonroot graph vertices are adjacent to at most three graph vertices. Let g(z)=sum_(i=0)^inftyg_iz^i, (1) be the generating ...

A weighted adjacency matrix A_f of a simple graph is defined for a real positive symmetric function f(d_i,d_j) on the vertex degrees d_i of a graph as ...

Zarankiewicz's conjecture asserts that graph crossing number for a complete bipartite graph K_(m,n) is Z(m,n)=|_n/2_||_(n-1)/2_||_m/2_||_(m-1)/2_|, (1) where |_x_| is the ...

The shortest path-spanning tree from a graph vertex of a graph.

A graph vertex in a graph is said to be an even node if its vertex degree is even.