Search Results for ""

A two-dimensional generalization of the Haar transform which is used for the compression of astronomical images. The algorithm consists of dividing the 2^N×2^N image into ...

With three cuts, dissect an equilateral triangle into a square. The problem was first proposed by Dudeney in 1902, and subsequently discussed in Dudeney (1958), and Gardner ...

Given integers a and b with close to 2n bits each, the half-GCD of a and b is a 2×2 matrix [u v; u^' v^'] with determinant equal to -1 or 1 such that ua+vb=r and ...

The Hermite constant is defined for dimension n as the value gamma_n=(sup_(f)min_(x_i)f(x_1,x_2,...,x_n))/([discriminant(f)]^(1/n)) (1) (Le Lionnais 1983). In other words, ...

Given a nonzero finitely generated module M over a commutative Noetherian local ring R with maximal ideal M and a proper ideal I of R, the Hilbert-Samuel function of M with ...

Given a finitely generated Z-graded module M over a graded ring R (finitely generated over R_0, which is an Artinian local ring), define the Hilbert function of M as the map ...

A rule for polynomial computation which both reduces the number of necessary multiplications and results in less numerical instability due to potential subtraction of one ...

By way of analogy with the eban numbers, iban numbers are defined as numbers whose English names do not contain the letter "i" (i.e., "i" is banned). The first few are 1, 2, ...

A matrix is ill-conditioned if the condition number is too large (and singular if it is infinite).

The Ivanov-Ivanov-Faradjev graph is a distance-regular graph on 990 vertices (Brouwer et al. 1989, p. 369). It has intersection array {7,6,4,4,4,1,1,1;1,1,1,2,4,4,6,7} and is ...