Search Results for ""

Given a sum and a set of weights, find the weights which were used to generate the sum. The values of the weights are then encrypted in the sum. This system relies on the ...

For every k>=1, let C_k be the set of composite numbers n>k such that if 1<a<n, GCD(a,n)=1 (where GCD is the greatest common divisor), then a^(n-k)=1 (mod n). Special cases ...

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

Given a knot diagram, it is possible to construct a collection of variables and equations, and given such a collection, a group naturally arises that is known as the group of ...

A knot invariant is a function from the set of all knots to any other set such that the function does not change as the knot is changed (up to isotopy). In other words, a ...

An operation on a knot or link diagram which preserves its crossing number. Thistlethwaite used 13 different moves in generating a list of 16-crossing alternating knots ...

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

The mathematical study of knots. Knot theory considers questions such as the following: 1. Given a tangled loop of string, is it really knotted or can it, with enough ...

The numbers defined by the recurrence relation K_(n+1)=1+min(2K_(|_n/2_|),3K_(|_n/3_|)), with K_0=1. The first few values for n=0, 1, 2, ... are 1, 3, 3, 4, 7, 7, 7, 9, 9, ...