Search Results for ""

Consider three mutually tangent circles, and draw their inner Soddy circle. Then draw the inner Soddy circles of this circle with each pair of the original three, and ...

Given two positive integers n and k, the bipartite Kneser graph H(n,k) is the graph whose two bipartite sets of vertices represent the k-subsets and (n-k)-subsets of ...

The Dehn invariant is a constant defined using the angles and edge lengths of a three-dimensional polyhedron. It is significant because it remains constant under polyhedron ...

The simple continued fraction of the Euler-Mascheroni constant gamma is [0; 1, 1, 2, 1, 2, 1, 4, 3, 13, 5, 1, 1, 8, 1, 2, 4, 1, 1, 40, ...] (OEIS A002852). The first few ...

The finite group C_2×C_2 is one of the two distinct groups of group order 4. The name of this group derives from the fact that it is a group direct product of two C_2 ...

Fuglede (1974) conjectured that a domain Omega admits an operator spectrum iff it is possible to tile R^d by a family of translates of Omega. Fuglede proved the conjecture in ...

An algorithm for finding closed form hypergeometric identities. The algorithm treats sums whose successive terms have ratios which are rational functions. Not only does it ...

The set of graph eigenvalues of the adjacency matrix is called the spectrum of the graph. (But note that in physics, the eigenvalues of the Laplacian matrix of a graph are ...

In combinatorial logic minimization, a device known as a Karnaugh map is frequently used. It is similar to a truth table, but the various variables are represented along two ...

A theorem outlined by Kolmogorov (1954) which was subsequently proved in the 1960s by Arnol'd (1963) and Moser (1962; Tabor 1989, p. 105). It gives conditions under which ...