Search Results for ""

A graph is said to be H^*-connected if it is either Hamilton-connected or Hamilton-laceable. S. Wagon (pers. comm., May. 20, 2013; Dupuis and Wagon 2014) conjecture that all ...

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

A set of vectors in Euclidean n-space is said to satisfy the Haar condition if every set of n vectors is linearly independent (Cheney 1999). Expressed otherwise, each ...

Define psi(x)={1 0<=x<1/2; -1 1/2<x<=1; 0 otherwise (1) and psi_(jk)(x)=psi(2^jx-k) (2) for j a nonnegative integer and 0<=k<=2^j-1. So, for example, the first few values of ...

Any locally compact Hausdorff topological group has a unique (up to scalars) nonzero left invariant measure which is finite on compact sets. If the group is Abelian or ...

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

Hackenbush is a game in combinatorial game theory in which player Left can delete any bLue edge, player Right can delete any Red edge, and either player can delete Green ...

The Hadamard product is a representation for the Riemann zeta function zeta(s) as a product over its nontrivial zeros rho, ...

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

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