Search Results for ""

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 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.

Two points which are collinear with respect to a similitude center but are not homologous points. Four interesting theorems from Johnson (1929) follow. 1. Two pairs of ...

The arithmetic-geometric matrix A_(AG) of a simple graph is a weighted adjacency matrix with weight f(d_i,d_j)=sqrt(d_i^2+d_j^2), (1) where d_i are the vertex degrees of the ...

Consider an infinite repository containing balls of n different types. Then the following table summarizes the number of distinct ways in which k balls can be picked for four ...

There are least two Bang's theorems, one concerning tetrahedra (Bang 1897), and the other with widths of convex domains (Bang 1951). The theorem of Bang (1897) states that ...

Barban's constant is defined as C_(Barban) = product_(p)[1+(3p^2-1)/(p(p+1)(p^2-1))] (1) = 2.596536... (2) (OEIS A175640), where the product is over the primes p.

Let G be an open subset of the complex plane C, and let L_a^2(G) denote the collection of all analytic functions f:G->C whose complex modulus is square integrable with ...

If f(x) is piecewise continuous and has a generalized Fourier series sum_(i)a_iphi_i(x) (1) with weighting function w(x), it must be true that ...

A bicolorable graph G is a graph with chromatic number chi(G)<=2. A graph is bicolorable iff it has no odd graph cycles (König 1950, p. 170; Skiena 1990, p. 213; Harary 1994, ...