Search Results for ""

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

For every positive integer n, there exists a square in the plane with exactly n lattice points in its interior. This was extended by Schinzel and Kulikowski to all plane ...

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

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

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

Although the inner shaded region has the same area as the outer shaded annulus, it appears to be larger. Since the rings are equally spaced, A_(inner) = pi·3^2=9pi (1) ...

The 6-polyiamond illustrated above.

A Mandelbrot set-like fractal obtained by iterating the map z_(n+1)=z_n^3+(z_0-1)z_n-z_0.

A function f mapping a set X->X/R (X modulo R), where R is an equivalence relation in X, is called a canonical map.

The points on a line can be put into a one-to-one correspondence with the real numbers.