Search Results for ""

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

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 function f_theta(z)=z/((1+e^(itheta)z)^2) (1) defined on the unit disk |z|<1. For theta in [0,2pi), the Köbe function is a schlicht function f(z)=z+sum_(j=2)^inftya_jz^j ...

If f is a schlicht function and D(z_0,r) is the open disk of radius r centered at z_0, then f(D(0,1)) superset= D(0,1/4), where superset= denotes a (not necessarily proper) ...

The König-Egeváry theorem, sometimes simply called König's theorem, asserts that the matching number (i.e., size of a maximum independent edge set) is equal to the vertex ...

A tree with a finite number of branches at each fork and with a finite number of leaves at the end of each branch is called a finitely branching tree. König's lemma states ...