Search Results for ""

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

Given a sequence of values {a_k}_(k=1)^n, the high-water marks are the values at which the running maximum increases. For example, given a sequence (3,5,7,8,8,5,7,9,2,5) with ...

A Hilbert space is a vector space H with an inner product <f,g> such that the norm defined by |f|=sqrt(<f,f>) turns H into a complete metric space. If the metric defined by ...

The prime HP(n) reached starting from a number n, concatenating its prime factors, and repeating until a prime is reached. For example, for n=9, 9=3·3->33=3·11->311, so 311 ...

Any partition of the plane into regions of equal area has perimeter at least that of the regular hexagonal grid (i.e., the honeycomb, illustrated above). Pappus refers to the ...

The Hungarian algorithm finds a maximum independent edge set on a graph. The algorithm starts with any matching M and constructs a tree via a breadth-first search to find an ...

Let X be a set of urelements that contains the set N of natural numbers, and let V(X) be a superstructure whose individuals are in X. Let V(^*X) be an enlargement of V(X), ...

The hyperbolic octahedron is a hyperbolic version of the Euclidean octahedron, which is a special case of the astroidal ellipsoid with a=b=c=1. It is given by the parametric ...

An identity graph, sometimes also known as an asymmetric graph or rigid graph (Albertson and Collins 1996), is a graph possessing a single graph automorphism. The numbers of ...

A class of illusion in which an object which is physically unrealizable is apparently depicted. More than 100 papers have been written about impossible figures (Kulpa 1987), ...