Planar Diagrams: Difference between revisions
DrorsRobot (talk | contribs) No edit summary |
DrorsRobot (talk | contribs) No edit summary |
||
| Line 14: | Line 14: | ||
<!--$$?PD$$--> |
<!--$$?PD$$--> |
||
<!--Robot Land, no human edits to "END"--> |
<!--Robot Land, no human edits to "END"--> |
||
{{HelpAndAbout| |
|||
{{HelpAndAbout1|n=1|s=PD}} |
|||
n = 1 | |
|||
| ⚫ | |||
in = <nowiki>PD</nowiki> | |
|||
{{HelpAndAbout2|n=2|s=PD}} |
|||
| ⚫ | |||
The PD to GaussCode and to MorseLink conversions were written by Siddarth Sankaran at the University of Toronto in the summer of 2005. |
about= <nowiki>The PD to GaussCode and to MorseLink conversions were written by Siddarth Sankaran at the University of Toronto in the summer of 2005.</nowiki>}} |
||
{{HelpAndAbout3}} |
|||
<!--END--> |
<!--END--> |
||
| Line 24: | Line 24: | ||
<!--Robot Land, no human edits to "END"--> |
<!--Robot Land, no human edits to "END"--> |
||
{{HelpLine| |
{{HelpLine| |
||
n = |
n = 2 | |
||
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 33: | ||
<!--$$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=3}} |
||
<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 41: | ||
<!--Robot Land, no human edits to "END"--> |
<!--Robot Land, no human edits to "END"--> |
||
{{InOut| |
{{InOut| |
||
n = |
n = 4 | |
||
in = <nowiki>Alexander[K][-1]</nowiki> | |
in = <nowiki>Alexander[K][-1]</nowiki> | |
||
out= <nowiki>-11</nowiki>}} |
out= <nowiki>-11</nowiki>}} |
||
| Line 53: | Line 53: | ||
<!--Robot Land, no human edits to "END"--> |
<!--Robot Land, no human edits to "END"--> |
||
{{HelpLine| |
{{HelpLine| |
||
n = |
n = 5 | |
||
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 61: | ||
<!--Robot Land, no human edits to "END"--> |
<!--Robot Land, no human edits to "END"--> |
||
{{HelpLine| |
{{HelpLine| |
||
n = |
n = 6 | |
||
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 69: | ||
<!--Robot Land, no human edits to "END"--> |
<!--Robot Land, no human edits to "END"--> |
||
{{HelpLine| |
{{HelpLine| |
||
n = |
n = 7 | |
||
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 78: | ||
<!--$$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=8}} |
||
<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 88: | ||
<!--Robot Land, no human edits to "END"--> |
<!--Robot Land, no human edits to "END"--> |
||
{{InOut| |
{{InOut| |
||
n = |
n = 9 | |
||
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 96: | ||
<!--Robot Land, no human edits to "END"--> |
<!--Robot Land, no human edits to "END"--> |
||
{{HelpLine| |
{{HelpLine| |
||
n = |
n = 10 | |
||
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 106: | ||
<!--Robot Land, no human edits to "END"--> |
<!--Robot Land, no human edits to "END"--> |
||
{{InOut| |
{{InOut| |
||
n = |
n = 11 | |
||
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:41, 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[3]:= |
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[4]:=
|
Alexander[K][-1]
|
Out[4]=
|
-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[8]:= |
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[9]:=
|
Jones[K][q] == Jones[K1][q]
|
Out[9]=
|
True
|
| ||||
Hence we can verify that the A2 invariant of the unknot is :
In[11]:=
|
A2Invariant[Loop[1]][q]
|
Out[11]=
|
-2 2
1 + q + q
|
