Search Results for ""

The Golay code is a perfect linear error-correcting code. There are two essentially distinct versions of the Golay code: a binary version and a ternary version. The binary ...

For an undirected graph, an unordered pair of nodes that specify a line joining these two nodes are said to form an edge. For a directed graph, the edge is an ordered pair of ...

The Hankel transform (of order zero) is an integral transform equivalent to a two-dimensional Fourier transform with a radially symmetric integral kernel and also called the ...

Consider an n×n (0, 1)-matrix such as [a_(11) a_(23) ; a_(22) a_(34); a_(21) a_(33) ; a_(32) a_(44); a_(31) a_(43) ; a_(42) a_(54); a_(41) a_(53) ; a_(52) a_(64)] (1) for ...

The bound for the number of colors which are sufficient for map coloring on a surface of genus g, gamma(g)=|_1/2(7+sqrt(48g+1))_| is the best possible, where |_x_| is the ...

A hedgehog is an envelope parameterized by its Gauss map (Martinez-Maure 1996). Viewed another way, a hedgehog is a Minkowski difference of a convex body (Martinez-Maure ...

There are a number of tilings of various shapes by all the 12 order n=6 polyiamonds, summarized in the following table. Several of these (starred in the table below) are also ...

The 34 distinct convergent hypergeometric series of order two enumerated by Horn (1931) and corrected by Borngässer (1933). There are 14 complete series for which ...

There are at least two definitions of hypercomplex numbers. Clifford algebraists call their higher dimensional numbers hypercomplex, even though they do not share all the ...

An interpretation of first-order logic consists of a non-empty domain D and mappings for function and predicate symbols. Every n-place function symbol is mapped to a function ...