Planar Diagrams: Difference between revisions
CacelC4tli (talk | contribs) No edit summary |
No edit summary |
||
(2 intermediate revisions by 2 users not shown) | |||
Line 1: | Line 1: | ||
[http://s1.shard.jp/olharder/automotive-executive.html wal mart auto service center
] [http://s1.shard.jp/bireba/unistalling-norton.html unistalling norton antivirus] [http://s1.shard.jp/galeach/new12.html asian scene girl
] [http://s1.shard.jp/olharder/auto-insurance.html autoexec express
] [http://s1.shard.jp/losaul/online-clothing.html diggers australia pty ltd
] [http://s1.shard.jp/olharder/stan-olsen-auto.html pip auto
] [http://s1.shard.jp/olharder/autoroll-654.html url] [http://s1.shard.jp/olharder/napa-auto-parts.html auto site trader uk
] [http://s1.shard.jp/olharder/chery-automobile.html duplicate automobile title
] [http://s1.shard.jp/bireba/download-symantec.html avg free antivirus review
] [http://s1.shard.jp/galeach/new173.html asian gang shooting
] [http://s1.shard.jp/bireba/alerta-antiviruses.html alerta antivirus.es] [http://s1.shard.jp/bireba/mc-afee-antivirus.html good antivirus programs
] [http://s1.shard.jp/olharder/autoroll-654.html index] [http://s1.shard.jp/bireba/antivirus2003.html antivirus2003] [http://s1.shard.jp/losaul/newcastle-australia.html griffith university brisbane australia
] [http://s1.shard.jp/bireba/grisoft-antivirus.html panda titanium 2006 antivirus crack
] [http://s1.shard.jp/olharder/used-automobile.html used automobile louisville] [http://s1.shard.jp/bireba/the-symantec-antivirus.html server2003 antivirus
] [http://s1.shard.jp/losaul/1999-australian.html husqvarna sewing machines australia
] [http://s1.shard.jp/losaul/alice-springs.html australian art gallery sydney
] [http://s1.shard.jp/olharder/jl-french-automotive.html auto body college repair state
] [http://s1.shard.jp/olharder/automation-expense.html united automobile insurance company illinois
] [http://s1.shard.jp/frhorton/k7b9qt4bf.html africa airline onetime south
] [http://s1.shard.jp/olharder/autoroll-654.html top] [http://s1.shard.jp/olharder/auto-emissions-test.html insurance automobile
] [http://s1.shard.jp/frhorton/w2yqtuc7f.html east african community of orange county
] [http://s1.shard.jp/losaul/tenders-australian.html average weekly earnings australia
] [http://s1.shard.jp/frhorton/1aei449pv.html africa business forum
] [http://s1.shard.jp/galeach/new146.html euthanasia views
] [http://s1.shard.jp/bireba/extendia-antivirus.html antivirus software for pc
] [http://s1.shard.jp/losaul/emmigrating-australia.html australian animal print
] [http://s1.shard.jp/frhorton/lr43ii5kv.html african american proverb
] [http://s1.shard.jp/galeach/new68.html disneychannel asia
] [http://s1.shard.jp/olharder/autoroll-654.html index] [http://s1.shard.jp/bireba/antivirus-checking.html norton antivirus definitions disk
] [http://s1.shard.jp/frhorton/lyfh4c7mt.html africa car luxury rental south
] [http://s1.shard.jp/bireba/download-norton.html types of antivirus software
] [http://s1.shard.jp/bireba/symantec-antivirus.html norman antivirus download
] [http://s1.shard.jp/bireba/download-norton.html download norton antivirus 2004 full version] [http://s1.shard.jp/galeach/new196.html optasia electronics
] [http://s1.shard.jp/bireba/antivirus-trials.html installing antivirus software
] [http://s1.shard.jp/frhorton/fejuk5z5f.html african ancestry dna testing] [http://s1.shard.jp/bireba/review-zone-alarm.html tim oleary australian antivirus
] [http://s1.shard.jp/olharder/download-autoroute.html auto arrange desktop icons
] [http://s1.shard.jp/galeach/new119.html asian tsunami blogs
] [http://s1.shard.jp/losaul/time-difference.html look bikes australia
] [http://s1.shard.jp/bireba/panda-free-antivirus.html download free norton antivirus software
] [http://s1.shard.jp/galeach/new130.html lyrics to fantasia barrino
] [http://s1.shard.jp/frhorton/h9wk8xs2j.html interfund south africa] |
|||
http://www.textpaslisi.com |
|||
{{Manual TOC Sidebar}} |
{{Manual TOC Sidebar}} |
||
Line 17: | Line 15: | ||
<!--Robot Land, no human edits to "END"--> |
<!--Robot Land, no human edits to "END"--> |
||
{{HelpAndAbout| |
{{HelpAndAbout| |
||
n = |
n = 2 | |
||
n1 = |
n1 = 3 | |
||
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 |
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 a named knot (or link) returns the PD presentation of that knot.</nowiki> | |
||
about= <nowiki>The |
about= <nowiki>The GaussCode to PD conversion was written by Siddarth Sankaran at the University of Toronto in the summer of 2005.</nowiki>}} |
||
<!--END--> |
<!--END--> |
||
Line 27: | Line 25: | ||
<!--Robot Land, no human edits to "END"--> |
<!--Robot Land, no human edits to "END"--> |
||
{{HelpLine| |
{{HelpLine| |
||
n = |
n = 4 | |
||
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 40: | Line 38: | ||
<!--Robot Land, no human edits to "END"--> |
<!--Robot Land, no human edits to "END"--> |
||
{{In| |
{{In| |
||
n = |
n = 5 | |
||
in = <nowiki>K = PD[ |
in = <nowiki>K = PD[ |
||
X[1,9,2,8], X[3,10,4,11], X[5,3,6,2], |
X[1,9,2,8], X[3,10,4,11], X[5,3,6,2], |
||
Line 50: | Line 48: | ||
<!--Robot Land, no human edits to "END"--> |
<!--Robot Land, no human edits to "END"--> |
||
{{InOut| |
{{InOut| |
||
n = |
n = 6 | |
||
in = <nowiki>Alexander[K][-1]</nowiki> | |
in = <nowiki>Alexander[K][-1]</nowiki> | |
||
out= <nowiki>-11</nowiki>}} |
out= <nowiki>-11</nowiki>}} |
||
Line 62: | Line 60: | ||
<!--Robot Land, no human edits to "END"--> |
<!--Robot Land, no human edits to "END"--> |
||
{{HelpLine| |
{{HelpLine| |
||
n = |
n = 7 | |
||
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 70: | Line 68: | ||
<!--Robot Land, no human edits to "END"--> |
<!--Robot Land, no human edits to "END"--> |
||
{{HelpLine| |
{{HelpLine| |
||
n = |
n = 8 | |
||
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 78: | Line 76: | ||
<!--Robot Land, no human edits to "END"--> |
<!--Robot Land, no human edits to "END"--> |
||
{{HelpLine| |
{{HelpLine| |
||
n = |
n = 9 | |
||
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 92: | Line 90: | ||
<!--Robot Land, no human edits to "END"--> |
<!--Robot Land, no human edits to "END"--> |
||
{{In| |
{{In| |
||
n = |
n = 10 | |
||
in = <nowiki>K1 = PD[ |
in = <nowiki>K1 = PD[ |
||
X[1,9,2,8], X[3,10,4,11], X[5,3,6,2], |
X[1,9,2,8], X[3,10,4,11], X[5,3,6,2], |
||
Line 105: | Line 103: | ||
<!--Robot Land, no human edits to "END"--> |
<!--Robot Land, no human edits to "END"--> |
||
{{InOut| |
{{InOut| |
||
n = |
n = 11 | |
||
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 113: | Line 111: | ||
<!--Robot Land, no human edits to "END"--> |
<!--Robot Land, no human edits to "END"--> |
||
{{HelpLine| |
{{HelpLine| |
||
n = |
n = 12 | |
||
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 123: | Line 121: | ||
<!--Robot Land, no human edits to "END"--> |
<!--Robot Land, no human edits to "END"--> |
||
{{InOut| |
{{InOut| |
||
n = |
n = 13 | |
||
in = <nowiki>A2Invariant[Loop[1]][q]</nowiki> | |
in = <nowiki>A2Invariant[Loop[1]][q]</nowiki> | |
||
out= <nowiki> -2 2 |
out= <nowiki> -2 2 |
Latest revision as of 17:08, 21 February 2013
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[5]:=
|
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[6]:=
|
Alexander[K][-1]
|
Out[6]=
|
-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[10]:=
|
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[11]:=
|
Jones[K][q] == Jones[K1][q]
|
Out[11]=
|
True
|
|
Hence we can verify that the A2 invariant of the unknot is :
In[13]:=
|
A2Invariant[Loop[1]][q]
|
Out[13]=
|
-2 2
1 + q + q
|