Search Results for ""

The thinnest sequence which contains 1, and whenever it contains x, also contains 2x, 3x+2, and 6x+3: 1, 2, 4, 5, 8, 9, 10, 14, 15, 16, 17, ... (OEIS A005658).

Let R^3 be the space in which a knot K sits. Then the space "around" the knot, i.e., everything but the knot itself, is denoted R^3-K and is called the knot complement of K ...

The least genus of any Seifert surface for a given knot. The unknot is the only knot with genus 0. Usually, one denotes by g(K) the genus of the knot K. The knot genus has ...

The signature s(K) of a knot K can be defined using the skein relationship s(unknot)=0 (1) s(K_+)-s(K_-) in {0,2}, (2) and 4|s(K)<->del (K)(2i)>0, (3) where del (K) is the ...

Knuth's up-arrow notation is a notation invented by Knuth (1976) to represent large numbers in which evaluation proceeds from the right (Conway and Guy 1996, p. 60): m^n ...

The first few numbers whose abundance absolute values are odd squares (excluding the trivial cases of powers of 2) are 98, 2116, 4232, 49928, 80656, 140450, 550564, 729632, ...

The most general form of this theorem states that in a commutative unit ring R, the height of every proper ideal I generated by n elements is at most n. Equality is attained ...

An algorithm for finding a graph's spanning tree of minimum length. It sorts the edges of a graph in order of increasing cost and then repeatedly adds edges that bridge ...

A theorem which plays a fundamental role in computer science because it is one of the main tools for showing that certain orderings on trees are well-founded. These orderings ...

A problem related to the continuum hypothesis which was solved by Solovay (1970) using the inaccessible cardinals axiom. It has been proven by Shelah and Woodin (1990) that ...