Search Results for ""

A fast Fourier transform-like algorithm which produces a hologram of an image.

Let A=a_(ik) be an arbitrary n×n nonsingular matrix with real elements and determinant |A|, then |A|^2<=product_(i=1)^n(sum_(k=1)^na_(ik)^2).

Hadamard's maximum determinant problem asks to find the largest possible determinant (in absolute value) for any n×n matrix whose elements are taken from some set. Hadamard ...

Let |A| be an n×n determinant with complex (or real) elements a_(ij), then |A|!=0 if |a_(ii)|>sum_(j=1; j!=i)^n|a_(ij)|.

Hadjicostas's formula is a generalization of the unit square double integral gamma=int_0^1int_0^1(x-1)/((1-xy)ln(xy))dxdy (1) (Sondow 2003, 2005; Borwein et al. 2004, p. 49), ...

The Hadwiger-Nelson problem asks for the chromatic number of the plane, i.e., the minimum number of colors needed to color the plane if no two points at unit distance one ...

The Hadwiger conjecture is a generalization of the four-color theorem which states that for any loopless graph G with h(G) the Hadwiger number and chi(G) the chromatic ...

The Hadwiger number of a graph G, variously denoted eta(G) (Zelinka 1976, Ivančo 1988) or h(G) (Stiebitz 1990), is the number of vertices in the largest complete minor of G ...

What is the largest number of subcubes (not necessarily different) into which a cube cannot be divided by plane cuts? The answer is 47 (Gardner 1992, pp. 297-298). The ...

The vectors +/-a_1, ..., +/-a_n in a three-space form a normalized eutactic star iff Tx=x for all x in the three-space.