Planar Diagrams: Difference between revisions
DrorsRobot (talk | contribs) No edit summary |
DrorsRobot (talk | contribs) No edit summary |
||
Line 16: | Line 16: | ||
{{HelpAndAbout| |
{{HelpAndAbout| |
||
n = 1 | |
n = 1 | |
||
n1 = 2 | |
|||
in = <nowiki>PD</nowiki> | |
in = <nowiki>PD</nowiki> | |
||
out= <nowiki>PD[v1, v2, ...] represents a planar diagram whose vertices are v1, v2, .... PD also acts as a "type caster", so for example, PD[K] where K is is a named knot (or link) returns the PD presentation of that knot.</nowiki> | |
out= <nowiki>PD[v1, v2, ...] represents a planar diagram whose vertices are v1, v2, .... PD also acts as a "type caster", so for example, PD[K] where K is is a named knot (or link) returns the PD presentation of that knot.</nowiki> | |
||
Line 24: | Line 25: | ||
<!--Robot Land, no human edits to "END"--> |
<!--Robot Land, no human edits to "END"--> |
||
{{HelpLine| |
{{HelpLine| |
||
n = |
n = 3 | |
||
in = <nowiki>X</nowiki> | |
in = <nowiki>X</nowiki> | |
||
out= <nowiki>X[i,j,k,l] represents a crossing between the edges labeled i, j, k and l starting from the incoming lower strand i and going counterclockwise through j, k and l. The (sometimes ambiguous) orientation of the upper strand is determined by the ordering of {j,l}.</nowiki>}} |
out= <nowiki>X[i,j,k,l] represents a crossing between the edges labeled i, j, k and l starting from the incoming lower strand i and going counterclockwise through j, k and l. The (sometimes ambiguous) orientation of the upper strand is determined by the ordering of {j,l}.</nowiki>}} |
||
Line 33: | Line 34: | ||
<!--$$K = PD[X[1,9,2,8], X[3,10,4,11], X[5,3,6,2], X[7,1,8,12], X[9,4,10,5], X[11,7,12,6]];$$--> |
<!--$$K = PD[X[1,9,2,8], X[3,10,4,11], X[5,3,6,2], X[7,1,8,12], X[9,4,10,5], X[11,7,12,6]];$$--> |
||
<!--Robot Land, no human edits to "END"--> |
<!--Robot Land, no human edits to "END"--> |
||
{{In1|n= |
{{In1|n=4}} |
||
<pre style="color: red; border: 0px; padding: 0em"><nowiki>K = PD[X[1,9,2,8], X[3,10,4,11], X[5,3,6,2], X[7,1,8,12], X[9,4,10,5], X[11,7,12,6]];</nowiki></pre> |
<pre style="color: red; border: 0px; padding: 0em"><nowiki>K = PD[X[1,9,2,8], X[3,10,4,11], X[5,3,6,2], X[7,1,8,12], X[9,4,10,5], X[11,7,12,6]];</nowiki></pre> |
||
{{In2}} |
{{In2}} |
||
Line 41: | Line 42: | ||
<!--Robot Land, no human edits to "END"--> |
<!--Robot Land, no human edits to "END"--> |
||
{{InOut| |
{{InOut| |
||
n = |
n = 5 | |
||
in = <nowiki>Alexander[K][-1]</nowiki> | |
in = <nowiki>Alexander[K][-1]</nowiki> | |
||
out= <nowiki>-11</nowiki>}} |
out= <nowiki>-11</nowiki>}} |
||
Line 53: | Line 54: | ||
<!--Robot Land, no human edits to "END"--> |
<!--Robot Land, no human edits to "END"--> |
||
{{HelpLine| |
{{HelpLine| |
||
n = |
n = 6 | |
||
in = <nowiki>Xp</nowiki> | |
in = <nowiki>Xp</nowiki> | |
||
out= <nowiki>Xp[i,j,k,l] represents a positive (right handed) crossing between the edges labeled i, j, k and l starting from the incoming lower strand i and going counter clockwise through j, k and l. The upper strand is therefore oriented from l to j regardless of the ordering of {j,l}. Presently Xp is only lightly supported.</nowiki>}} |
out= <nowiki>Xp[i,j,k,l] represents a positive (right handed) crossing between the edges labeled i, j, k and l starting from the incoming lower strand i and going counter clockwise through j, k and l. The upper strand is therefore oriented from l to j regardless of the ordering of {j,l}. Presently Xp is only lightly supported.</nowiki>}} |
||
Line 61: | Line 62: | ||
<!--Robot Land, no human edits to "END"--> |
<!--Robot Land, no human edits to "END"--> |
||
{{HelpLine| |
{{HelpLine| |
||
n = |
n = 7 | |
||
in = <nowiki>Xm</nowiki> | |
in = <nowiki>Xm</nowiki> | |
||
out= <nowiki>Xm[i,j,k,l] represents a negative (left handed) crossing between the edges labeled i, j, k and l starting from the incoming lower strand i and going counter clockwise through j, k and l. The upper strand is therefore oriented from j to l regardless of the ordering of {j,l}. Presently Xm is only lightly supported.</nowiki>}} |
out= <nowiki>Xm[i,j,k,l] represents a negative (left handed) crossing between the edges labeled i, j, k and l starting from the incoming lower strand i and going counter clockwise through j, k and l. The upper strand is therefore oriented from j to l regardless of the ordering of {j,l}. Presently Xm is only lightly supported.</nowiki>}} |
||
Line 69: | Line 70: | ||
<!--Robot Land, no human edits to "END"--> |
<!--Robot Land, no human edits to "END"--> |
||
{{HelpLine| |
{{HelpLine| |
||
n = |
n = 8 | |
||
in = <nowiki>P</nowiki> | |
in = <nowiki>P</nowiki> | |
||
out= <nowiki>P[i,j] represents a bivalent vertex whose adjacent edges are i and j (i.e., a "Point" between the segment i and the segment j). Presently P is only lightly supported.</nowiki>}} |
out= <nowiki>P[i,j] represents a bivalent vertex whose adjacent edges are i and j (i.e., a "Point" between the segment i and the segment j). Presently P is only lightly supported.</nowiki>}} |
||
Line 78: | Line 79: | ||
<!--$$K1 = PD[X[1,9,2,8], X[3,10,4,11], X[5,3,6,2], X[7,1,8,13], X[9,4,10,5], X[11,7,12,6], P[12,13]];$$--> |
<!--$$K1 = PD[X[1,9,2,8], X[3,10,4,11], X[5,3,6,2], X[7,1,8,13], X[9,4,10,5], X[11,7,12,6], P[12,13]];$$--> |
||
<!--Robot Land, no human edits to "END"--> |
<!--Robot Land, no human edits to "END"--> |
||
{{In1|n= |
{{In1|n=9}} |
||
<pre style="color: red; border: 0px; padding: 0em"><nowiki>K1 = PD[X[1,9,2,8], X[3,10,4,11], X[5,3,6,2], X[7,1,8,13], X[9,4,10,5], X[11,7,12,6], P[12,13]];</nowiki></pre> |
<pre style="color: red; border: 0px; padding: 0em"><nowiki>K1 = PD[X[1,9,2,8], X[3,10,4,11], X[5,3,6,2], X[7,1,8,13], X[9,4,10,5], X[11,7,12,6], P[12,13]];</nowiki></pre> |
||
{{In2}} |
{{In2}} |
||
Line 88: | Line 89: | ||
<!--Robot Land, no human edits to "END"--> |
<!--Robot Land, no human edits to "END"--> |
||
{{InOut| |
{{InOut| |
||
n = |
n = 10 | |
||
in = <nowiki>Jones[K][q] == Jones[K1][q]</nowiki> | |
in = <nowiki>Jones[K][q] == Jones[K1][q]</nowiki> | |
||
out= <nowiki>True</nowiki>}} |
out= <nowiki>True</nowiki>}} |
||
Line 96: | Line 97: | ||
<!--Robot Land, no human edits to "END"--> |
<!--Robot Land, no human edits to "END"--> |
||
{{HelpLine| |
{{HelpLine| |
||
n = |
n = 11 | |
||
in = <nowiki>Loop</nowiki> | |
in = <nowiki>Loop</nowiki> | |
||
out= <nowiki>Loop[i] represents a crossingsless loop labeled i.</nowiki>}} |
out= <nowiki>Loop[i] represents a crossingsless loop labeled i.</nowiki>}} |
||
Line 106: | Line 107: | ||
<!--Robot Land, no human edits to "END"--> |
<!--Robot Land, no human edits to "END"--> |
||
{{InOut| |
{{InOut| |
||
n = |
n = 12 | |
||
in = <nowiki>A2Invariant[Loop[1]][q]</nowiki> | |
in = <nowiki>A2Invariant[Loop[1]][q]</nowiki> | |
||
out= <nowiki> -2 2 |
out= <nowiki> -2 2 |
Revision as of 11:43, 30 August 2005
In the "Planar Diagrams" (PD
) presentation we present every knot or link diagram by labeling its edges (with natural numbers, 1,...,n, and with increasing labels as we go around each component) and by a list crossings presented as symbols where , , and are the labels of the edges around that crossing, starting from the incoming lower edge and proceeding counterclockwise. Thus for example, the PD
presentation of the knot above is:
(This of course is the Miller Institute knot, the mirror image of the knot 6_2)
(For In[1] see Setup)
|
|
|
Thus, for example, let us compute the determinant of the above knot:
In[4]:= |
K = PD[X[1,9,2,8], X[3,10,4,11], X[5,3,6,2], X[7,1,8,12], X[9,4,10,5], X[11,7,12,6]]; |
In[5]:=
|
Alexander[K][-1]
|
Out[5]=
|
-11
|
Some further details
|
|
|
For example, we could add an extra "point" on the Miller Institute knot, splitting edge 12 into two pieces, labeled 12 and 13:
In[9]:= |
K1 = PD[X[1,9,2,8], X[3,10,4,11], X[5,3,6,2], X[7,1,8,13], X[9,4,10,5], X[11,7,12,6], P[12,13]]; |
At the moment, many of our routines do not know to ignore such "extra points". But some do:
In[10]:=
|
Jones[K][q] == Jones[K1][q]
|
Out[10]=
|
True
|
|
Hence we can verify that the A2 invariant of the unknot is :
In[12]:=
|
A2Invariant[Loop[1]][q]
|
Out[12]=
|
-2 2
1 + q + q
|