Search results
From Knot Atlas
Jump to navigationJump to search
Page title matches
- 40 bytes (9 words) - 18:49, 20 February 2013
- Jones polynomial: {{{1}}}25 bytes (2 words) - 21:51, 29 July 2005
- 62 bytes (9 words) - 16:28, 27 August 2005
- 38 bytes (8 words) - 18:49, 20 February 2013
- 58 bytes (14 words) - 18:49, 20 February 2013
- 78 bytes (19 words) - 23:46, 24 August 2005
- 68 bytes (17 words) - 18:49, 20 February 2013
- 57 bytes (14 words) - 12:47, 24 August 2005
- 65 bytes (15 words) - 12:49, 24 August 2005
- 58 bytes (14 words) - 12:49, 24 August 2005
- 77 bytes (19 words) - 18:00, 20 February 2013
- 88 bytes (22 words) - 18:01, 20 February 2013
- 53 bytes (12 words) - 20:26, 23 August 2005
- 53 bytes (13 words) - 20:27, 23 August 2005
- 90 bytes (22 words) - 18:00, 20 February 2013
- 75 bytes (18 words) - 12:47, 24 August 2005
- 63 bytes (15 words) - 18:00, 20 February 2013
- 54 bytes (11 words) - 11:01, 24 August 2005
- 81 bytes (19 words) - 13:02, 24 August 2005
- 63 bytes (16 words) - 13:02, 24 August 2005
Page text matches
- * [[The Jones Polynomial]] ** [[The Jones Polynomial#How is the Jones polynomial computed?|How is the Jones polynomial computed?]]624 bytes (68 words) - 07:52, 17 December 2008
- === The Coloured Jones Polynomials === <div class="NavHead">[[The Coloured Jones Polynomials]] (in the <math>n+1</math>-dimensional representation of <math>821 bytes (116 words) - 07:33, 30 July 2007
- same_jones = <* J = Jones[K][q]; ...= DeleteCases[Select[AllKnots[], (J === Jones[#][q] || (J /. q-> 1/q) === Jones[#][q])&], K];972 bytes (97 words) - 15:55, 23 June 2006
- Dror Bar-Natan, Khovanov's categorification of the Jones polynomial, arXiv: math.QA /0201043. L.H.Kauffman, State models and the Jones polynomial, {\it Topology,\/} {\bf 26:3} (1987), 395--407.798 bytes (101 words) - 00:48, 17 September 2006
- Same [[The Jones Polynomial|Jones Polynomial]] (up to mirroring, <math>q\leftrightarrow q^{-1}</math>): {{In|n=4|in=<nowiki>{A = Alexander[K][t], J = Jones[K][q]}</nowiki>}}2 KB (314 words) - 10:21, 13 August 2007
- ..., as expected, the Jones polynomial of <math>K</math> is the square of the Jones polynomial of [[4_1]]: <!--$$Jones[K][q] == Expand[Jones[Knot[4,1]][q]^2]$$-->4 KB (593 words) - 18:20, 21 February 2013
- D. Bar-Natan, {\it On Khovanov's categorification of the Jones polynomial}, preprint, 2001. M. Khovanov, {\it A categorification of the Jones polynomial}, Duke Math. J. {\bf 101} (2000), 359-426.621 bytes (79 words) - 02:46, 17 September 2006
- ...[[The_Jones_Polynomial#How_is_the_Jones_polynomial_computed.3F|How is the Jones Polynomial Computed?]]) and where <math>L(K)</math> is the regular isotopy It is well known that the Jones polynomial is related to the Kauffman polynomial via3 KB (446 words) - 18:23, 21 February 2013
- ...example, let us check that the knots [[10_22]] and [[10_35]] have the same Jones polynomial but different <math>A2</math> invariants: <!--$$Jones[Knot[10, 22]][q] == Jones[Knot[10, 35]][q]$$-->3 KB (384 words) - 18:22, 21 February 2013
- Jones polynomial: {{{1}}}25 bytes (2 words) - 21:51, 29 July 2005
- {{ine|Jones polynomial|{{{1}}}||}}34 bytes (3 words) - 21:56, 29 July 2005
- Jones Polynomial: {{{1}}}25 bytes (2 words) - 13:07, 26 August 2005
- Vaughan F. R. Jones19 bytes (4 words) - 02:45, 17 September 2006
- A categorification of the Jones polynomial42 bytes (6 words) - 02:56, 17 September 2006
- Categorifications of the colored Jones polynomial49 bytes (6 words) - 03:00, 17 September 2006
- ** [[The Jones Polynomial]] *** [[The Jones Polynomial#How is the Jones polynomial computed?|How is the Jones polynomial computed?]]2 KB (230 words) - 16:37, 15 July 2008
- same_jones = <* J = Jones[K][q]; ...= DeleteCases[Select[AllKnots[], (J === Jones[#][q] || (J /. q-> 1/q) === Jones[#][q])&], K];2 KB (218 words) - 17:09, 18 September 2005
- ...d; border: 0px; padding: 0em; background-color: rgb(255,255,255);"><nowiki>Jones[Knot[0, 1]][q]</nowiki></code></td></tr> ...255);"><nowiki>Select[AllKnots[], (J === Jones[#][q] || (J /. q-> 1/q) === Jones[#][q])&]</nowiki></code></td></tr>13 KB (1,710 words) - 18:02, 1 September 2005
- same_jones = <* J = Jones[K][q]; ...= DeleteCases[Select[AllKnots[], (J === Jones[#][q] || (J /. q-> 1/q) === Jones[#][q])&], K];2 KB (223 words) - 17:13, 18 September 2005
- ...d; border: 0px; padding: 0em; background-color: rgb(255,255,255);"><nowiki>Jones[Knot[3, 1]][q]</nowiki></code></td></tr> ...255);"><nowiki>Select[AllKnots[], (J === Jones[#][q] || (J /. q-> 1/q) === Jones[#][q])&]</nowiki></code></td></tr>15 KB (2,309 words) - 18:01, 1 September 2005