Search Results for ""

Let a random n×n (0,1)-matrix have entries which are 1 (with probability p) or 0 (with probability q=1-p). An s-cluster is an isolated group of s adjacent (i.e., horizontally ...

Calculating the 13th root of a large number (that is a perfect 13th power) is a famous mental calculation challenge. However, because of difficulties in standardizing the ...

A function representable as a generalized Fourier series. Let R be a metric space with metric rho(x,y). Following Bohr (1947), a continuous function x(t) for (-infty<t<infty) ...

Take K a number field and L an Abelian extension, then form a prime divisor m that is divided by all ramified primes of the extension L/K. Now define a map phi_(L/K) from the ...

A 1-variable unoriented knot polynomial Q(x). It satisfies Q_(unknot)=1 (1) and the skein relationship Q_(L_+)+Q_(L_-)=x(Q_(L_0)+Q_(L_infty)). (2) It also satisfies ...

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

The Barth decic is a decic surface in complex three-dimensional projective space having the maximum possible number of ordinary double points, namely 345. It is given by the ...

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

A binary bracketing is a bracketing built up entirely of binary operations. The number of binary bracketings of n letters (Catalan's problem) are given by the Catalan numbers ...

Cantor dust is a fractal that can be constructed using string rewriting beginning with a cell [0] and iterating the rules {0->[0 0 0; 0 0 0; 0 0 0],1->[1 0 1; 0 0 0; 1 0 1]}. ...