Search Results for ""

The all-pairs shortest path problem is the determination of the shortest graph distances between every pair of vertices in a given graph. The problem can be solved using n ...

The alternating group graph AG_n is the undirected Cayley graph of the set of 2(n-2) generators of the alternating group A_n given by g_3^-, g_3^+, g_4^-, g_4^+, ..., g_n^-, ...

A technique used by André (1887) to provide an elegant solution to the ballot problem (Hilton and Pederson 1991) and in study of Wiener processes (Doob 1953; Papoulis 1984, ...

The Andrews-Schur identity states sum_(k=0)^nq^(k^2+ak)[2n-k+a; k]_q =sum_(k=-infty)^inftyq^(10k^2+(4a-1)k)[2n+2a+2; n-5k]_q([10k+2a+2]_q)/([2n+2a+2]_q) (1) where [n; m]_q is ...

The second-order ordinary differential equation y^('')+(y^')/x+(1-(nu^2)/(x^2))y=(x-nu)/(pix^2)sin(pinu) whose solutions are Anger functions.

A topological two-sphere in three-space whose exterior is not simply connected. The outer complement of Antoine's horned sphere is not simply connected. Furthermore, the ...

Given a ship with a known constant direction and speed v, what course should be taken by a chase ship in pursuit (traveling at speed V) in order to intercept the other ship ...

A sequence s_n^((lambda))(x)=[h(t)]^lambdas_n(x), where s_n(x) is a Sheffer sequence, h(t) is invertible, and lambda ranges over the real numbers is called a Steffensen ...

The Archimedean duals in general have many stellations. The following table extracted from Webb gives a partial enumeration. In the table, E denotes counts of enantiomorphous ...

Let a_n and b_n be the perimeters of the circumscribed and inscribed n-gon and a_(2n) and b_(2n) the perimeters of the circumscribed and inscribed 2n-gon. Then a_(2n) = ...