Search Results for ""

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

A knot move illustrated above. Two knots cannot be distinguished using Vassiliev invariants of order <=n iff they are related by a sequence of such moves (Habiro 2000). There ...

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 hacovercosine, also known as the hacoversed cosine and cohavercosine, is a little-used trigonometric function defined by hacovercos(z) = covercosz (1) = 1/2(1+sinz), (2) ...

The hacoversine, also known as the hacoversed sine and cohaversine, is a little-used trigonometric function defined by hacoversin(z) = coversinz (1) = 1/2(1-sinz), (2) where ...

A symmetric block design (4n+3, 2n+1, n) which is equivalent to a Hadamard matrix of order 4n+4. It is conjectured that Hadamard designs exist for all integers n>0, but this ...

Let f be an entire function of finite order lambda and {a_j} the zeros of f, listed with multiplicity, then the rank p of f is defined as the least positive integer such that ...

An n-Hadamard graph is a graph on 4n vertices defined in terms of a Hadamard matrix H_n=(h)_(ij) as follows. Define 4n symbols r_i^+, r_i^-, c_i^+, and c_i^-, where r stands ...

A Hadamard matrix is a type of square (-1,1)-matrix invented by Sylvester (1867) under the name of anallagmatic pavement, 26 years before Hadamard (1893) considered them. In ...

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