cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A173466 a(n) is the number of prime knots with n crossings such that the empirical unknotting numbers cannot be decided minimals using their signatures.

Original entry on oeis.org

0, 0, 0, 1, 0, 2, 2, 13, 27, 114, 370, 1614
Offset: 1

Views

Author

Jonathan Vos Post, Nov 22 2010

Keywords

Comments

From Franck Maminirina Ramaharo, Aug 14 2018: (Start)
Prime knots considered in the sequence are those satisfying (1/2)*abs(sigma(K)) < u(K), where sigma(K) denotes the signature of the knot K and u(K) the unknotting number.
Complement of A318052. (End)

Examples

			From _Franck Maminirina Ramaharo_, Aug 14 2018: (Start)
Let K denote a prime knot in Alexander-Briggs notation, s(K) = (1/2)*abs(sigma(K)) and u(K) = unknotting number of K. The following table gives some of the first prime knots with the property s(K) != u(K).
==============================================================
|  K   | 4_1 | 6_1 | 6_3 | 7_4 | 7_7 | 8_1 | 8_3 | 8_4 | 8_6 |
-------+-----+-----+-----+-----+-----+-----+-----+-----+-----+
| s(K) |  0  |  0  |  0  |  1  |  0  |  0  |  0  |  1  |  1  |
-------+-----+-----+-----+-----+-----+-----+-----+-----+-----+
| u(K) |  1  |  1  |  1  |  2  |  1  |  1  |  2  |  2  |  2  |
==============================================================
(End)
		

References

  • Peter R. Cromwell, Knots and Links, Cambridge University Press, November 15, 2004, pp. 151-154.
  • W. B. R. Lickorish, An introduction to Knot Theory, Springer, 1997, Table 8.1, p. 85.

Crossrefs

Formula

a(n) = A002863(n) - A318052(n). - Franck Maminirina Ramaharo, Aug 14 2018

Extensions

Edited, new name, and corrected by Franck Maminirina Ramaharo, Aug 14 2018

A318050 Triangle read by rows: T(n,k) is the number of prime knots with n crossings whose unknotting numbers are k.

Original entry on oeis.org

0, 1, 0, 1, 0, 1, 1, 0, 3, 0, 3, 3, 1, 0, 9, 11, 1, 0, 17, 22, 9, 1
Offset: 3

Views

Author

Keywords

Comments

The unknotting number of a knot is the minimal number of crossing switches required to convert a knot into the unknot (0 crossing).
Row n is a partition of A002863(n).
Row 10 cannot yet be completed because the unknotting number of some knots are still unknown.

Examples

			Triangle begins:
n\k|  0   1   2   3   4
---+-------------------
3  |  0   1
4  |  0   1
5  |  0   1   1
6  |  0   3
7  |  0   3   3   1
8  |  0   9  11   1
9  |  0  17  22   9   1
		

References

  • P. R. Cromwell, Knots and Links, Cambridge University Press, 2004, pp. 151-154.

Crossrefs

A318052 Number of prime knots with n crossings whose unknotting numbers are given by their signatures.

Original entry on oeis.org

0, 0, 1, 0, 2, 1, 5, 8, 22, 51, 182, 562
Offset: 1

Views

Author

Keywords

Comments

a(n) counts the prime knots with n crossings satisfying u(K) = (1/2)*abs(sigma(K)), where u(K) denote the unknotting numbers of the knot K, and sigma(K) its signature.

Examples

			Let K denote a prime knot in Alexander-Briggs notation, and let sigma(K) and u(K) denote the signature and the unknotting number of the knot K, respectively. The following table gives some of the first prime knots with the property u(K) = (1/2)*abs(sigma(K)).
==================================================================
|    K     | 3_1 | 5_1 | 5_2 | 6_2 | 7_1 | 7_2 | 7_5 | 7_6 | 8_2 |
-----------+-----+-----+-----+-----+-----+-----+-----+-----+-----+
| sigma(K) | -2  | -4  | -2  | -2  | -6  | -2  | -4  | -2  | -4  |
-----------+-----+-----+-----+-----+-----+-----+-----+-----+-----+
|   u(K)   |  1  |  2  |  1  |  1  |  3  |  1  |  2  |  1  |  2  |
==================================================================
		

References

  • P. R. Cromwell, Knots and Links, Cambridge University Press, 2004, pp. 151-154.

Crossrefs

Showing 1-3 of 3 results.