Planar Diagrams: Difference between revisions

From Knot Atlas
Jump to navigationJump to search
No edit summary
No edit summary
Line 23: Line 23:
<!--$$?X$$-->
<!--$$?X$$-->
<!--Robot Land, no human edits to "END"-->
<!--Robot Land, no human edits to "END"-->
{{HelpLine|
{{Help1|n=3|s=X}}
n = 3 |
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}.
in = <nowiki>X</nowiki> |
{{Help2}}
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>}}
<!--END-->
<!--END-->


Line 39: Line 40:
<!--$$Alexander[K][-1]$$-->
<!--$$Alexander[K][-1]$$-->
<!--Robot Land, no human edits to "END"-->
<!--Robot Land, no human edits to "END"-->
{{InOut1|n=5}}
{{InOut|
n = 5 |
<pre style="color: red; border: 0px; padding: 0em"><nowiki>Alexander[K][-1]</nowiki></pre>
{{InOut2|n=5}}<pre style="border: 0px; padding: 0em"><nowiki>-11</nowiki></pre>
in = <nowiki>Alexander[K][-1]</nowiki> |
out= <nowiki>-11</nowiki>}}
{{InOut3}}
<!--END-->
<!--END-->


Line 51: Line 52:
<!--$$?Xp$$-->
<!--$$?Xp$$-->
<!--Robot Land, no human edits to "END"-->
<!--Robot Land, no human edits to "END"-->
{{HelpLine|
{{Help1|n=6|s=Xp}}
n = 6 |
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.
in = <nowiki>Xp</nowiki> |
{{Help2}}
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>}}
<!--END-->
<!--END-->


<!--$$?Xm$$-->
<!--$$?Xm$$-->
<!--Robot Land, no human edits to "END"-->
<!--Robot Land, no human edits to "END"-->
{{HelpLine|
{{Help1|n=7|s=Xm}}
n = 7 |
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.
in = <nowiki>Xm</nowiki> |
{{Help2}}
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>}}
<!--END-->
<!--END-->


<!--$$?P$$-->
<!--$$?P$$-->
<!--Robot Land, no human edits to "END"-->
<!--Robot Land, no human edits to "END"-->
{{HelpLine|
{{Help1|n=8|s=P}}
n = 8 |
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.
in = <nowiki>P</nowiki> |
{{Help2}}
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>}}
<!--END-->
<!--END-->


Line 83: Line 87:
<!--$$Jones[K][q] == Jones[K1][q]$$-->
<!--$$Jones[K][q] == Jones[K1][q]$$-->
<!--Robot Land, no human edits to "END"-->
<!--Robot Land, no human edits to "END"-->
{{InOut|
{{InOut1|n=10}}
n = 10 |
<pre style="color: red; border: 0px; padding: 0em"><nowiki>Jones[K][q] == Jones[K1][q]</nowiki></pre>
in = <nowiki>Jones[K][q] == Jones[K1][q]</nowiki> |
{{InOut2|n=10}}<pre style="border: 0px; padding: 0em"><nowiki>True</nowiki></pre>
out= <nowiki>True</nowiki>}}
{{InOut3}}
<!--END-->
<!--END-->


<!--$$?Loop$$-->
<!--$$?Loop$$-->
<!--Robot Land, no human edits to "END"-->
<!--Robot Land, no human edits to "END"-->
{{HelpLine|
{{Help1|n=11|s=Loop}}
n = 11 |
Loop[i] represents a crossingsless loop labeled i.
in = <nowiki>Loop</nowiki> |
{{Help2}}
out= <nowiki>Loop[i] represents a crossingsless loop labeled i.</nowiki>}}
<!--END-->
<!--END-->


Line 100: Line 105:
<!--$$A2Invariant[Loop[1]][q]$$-->
<!--$$A2Invariant[Loop[1]][q]$$-->
<!--Robot Land, no human edits to "END"-->
<!--Robot Land, no human edits to "END"-->
{{InOut|
{{InOut1|n=12}}
n = 12 |
<pre style="color: red; border: 0px; padding: 0em"><nowiki>A2Invariant[Loop[1]][q]</nowiki></pre>
in = <nowiki>A2Invariant[Loop[1]][q]</nowiki> |
{{InOut2|n=12}}<pre style="border: 0px; padding: 0em"><nowiki> -2 2
out= <nowiki> -2 2
1 + q + q</nowiki></pre>
1 + q + q</nowiki>}}
{{InOut3}}
<!--END-->
<!--END-->

Revision as of 11:37, 30 August 2005


The PD notation

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)

In[1]:= ?PD

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.

In[2]:= PD::about

The PD to GaussCode and to MorseLink conversions were written by Siddarth Sankaran at the University of Toronto in the summer of 2005.

In[3]:= ?X
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}.

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

In[6]:= ?Xp
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.
In[7]:= ?Xm
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.
In[8]:= ?P
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.

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
In[11]:= ?Loop
Loop[i] represents a crossingsless loop labeled i.

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