Search Results for ""

The Bron-Kerbosch algorithm is an efficient method for finding all maximal cliques in a graph.

For a fractal process with values y(t-Deltat) and y(t+Deltat), the correlation between these two values is given by the Brown function r=2^(2H-1)-1, also known as the ...

A sequence {nu_i} of nondecreasing positive integers is complete iff 1. nu_1=1. 2. For all k=2, 3, ..., s_(k-1)=nu_1+nu_2+...+nu_(k-1)>=nu_k-1. A corollary states that a ...

An extension of the secant method of root finding to higher dimensions.

A Brunnian link is a set of n linked loops such that each proper sublink is trivial, so that the removal of any component leaves a set of trivial unlinked unknots. The ...

Brun's sieve was refined by J. B. Rosser, G. Ricci, and others.

The system of ordinary differential equations u^' = A+u^2v-(B+1)u (1) v^' = Bu-u^2v (2) (Hairer et al. 1987, p. 112; Zwillinger 1997, p. 136). The so-called full Brusselator ...

A paradox arising in the use of comparative adjectives. Suppose you have exactly two brothers, both of whom are older than you are. Then the following apparently false ...

The Buchstab function omega(u) is defined by the delay differential equation {uomega(u)=1 for 1<=u<=2; (uomega(u))^'=omega(u-1) for u>2 (1) (Panario 1998). It approaches the ...

A highly structured geometric object used to study groups which act upon them.