Search Results for ""

A related rates problem is the determination of the rate at which a function defined in terms of other functions changes. Related rates problems can be solved by computing ...

A coloring of plane regions, link segments, etc., is an assignment of a distinct labeling (which could be a number, letter, color, etc.) to each component. Coloring problems ...

The operation of drilling a tubular neighborhood of a knot K in S^3 and then gluing in a solid torus so that its meridian curve goes to a (p,q)-curve on the torus boundary of ...

A semi-oriented 2-variable knot polynomial defined by F_L(a,z)=a^(-w(L))<|L|>, (1) where L is an oriented link diagram, w(L) is the writhe of L, |L| is the unoriented diagram ...

The Kauffman X-polynomial, also called the normalized bracket polynomial, is a 1-variable knot polynomial denoted X (Adams 1994, p. 153), L (Kauffman 1991, p. 33), or F ...

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

Let E be the largest and e the smallest power of l in the HOMFLY polynomial of an oriented link, and i be the braid index. Then the Morton-Franks-Williams inequality holds, ...

A crossing in a knot diagram for which there exists a circle in the projection plane meeting the diagram transversely at that crossing, but not meeting the diagram at any ...

If f:M->N, then the tangent map Tf associated to f is a vector bundle homeomorphism Tf:TM->TN (i.e., a map between the tangent bundles of M and N respectively). The tangent ...

An Eulerian path, also called an Euler chain, Euler trail, Euler walk, or "Eulerian" version of any of these variants, is a walk on the graph edges of a graph which uses each ...