Hostname: page-component-cd9895bd7-lnqnp Total loading time: 0 Render date: 2024-12-25T13:11:44.099Z Has data issue: false hasContentIssue false
  • English
  • Français

Knots, matroids and the Ising model

Published online by Cambridge University Press:  24 October 2008

W. Schwärzler  and
D. J. A. Welsh
W. Schwärzler
Affiliation:
Forschungsinstitut für Diskrete Mathematik, Universität Bonn, Germany
D. J. A. Welsh
Affiliation:
Merton College, Oxford
Get access Rights & Permissions [Opens in a new window]

Abstract

A polynomial is defined on signed matroids which contains as specializations the Kauffman bracket polynomial of knot theory, the Tutte polynomial of a matroid, the partition function of the anisotropic Ising model, the Kauffman–Murasugi polynomials of signed graphs. It leads to generalizations of a theorem of Lickorish and Thistlethwaite showing that adequate link diagrams do not represent the unknot. We also investigate semi-adequacy and the span of the bracket polynomial in this wider context.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 113 , Issue 1 , January 1993 , pp. 107 - 139
Copyright
Copyright © Cambridge Philosophical Society 1993

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Baxter, R. J.. Exactly Solved Models in Statistical Mechanics (Academic Press, 1982).Google Scholar
[2]Brylawski, T. H. and Oxley, J. G.. The Tutte polynomial and its applications. In Matroid Theory, vol. 3 (editor White, N.), to appear.Google Scholar
[3]Brylawski, T. H.. The Tutte polynomial. In Matroid Theory and its Applications, Centro Internationale Maternatico Estivo 3 Liguori (Napoli, 1980), pp. 125–275.Google Scholar
[4]Bitrde, G. and Zieschang, H.. Knots (de Gruyter, 1985).Google Scholar
[5]Cipra, B. A.. An introduction to the Ising model. Amer. Math. Monthly 94 (1987), 937–959.CrossRefGoogle Scholar
[6]Conway, J. H.. An enumeration of knots and links. In Computational Problems in Abstract Algebra (editor Leech, J.), (Pergamon Press, 1969), pp. 329–358.Google Scholar
[7]Crapo, H.. The Tutte polynomial. Aequationes Math. 3 (1969), 211–229.CrossRefGoogle Scholar
[8]Fortuin, C. M. and Kasteleyn, P. W.. On the random-cluster model. I. Introduction and relation to other models. Physica 57 (1972), 536–564.CrossRefGoogle Scholar
[9]Hakbn, W.. Theorie der Normalflächen. Ada Math. 105 (1961), 245–375.Google Scholar
[10]Jaeger, F.. On the Kauffman polynomial of planar matroids. In Proc. Fourth Czechoslovak, Symposium in Combinatorics (Prachatice, 1990), to appear.Google Scholar
[11]Jaeger, F., Vertigan, D. L. and Welsh, D. J. A.. On the computational complexity of the Jones and Tutte polynomials. Math. Proc. Cambridge Philos. Soc. 108 (1990), 35–53.CrossRefGoogle Scholar
[12]Jones, V. F. R.. A polynomial invariant for knots via Von Neumann algebras. Bull. Amer. Math. Soc. 12 (1985), 103–111.CrossRefGoogle Scholar
[13]Kauffman, L. H.. Formal Knot Theory (Princeton University Press, 1983).Google Scholar
[14]Kauffman, L. H.. On Knots. Ann. of Math. Studies no. 115 (Princeton University Press, 1987).Google Scholar
[15]Kauffman, L. H.. State models and the Jones polynomial. Topology 26 (1987), 395–407.CrossRefGoogle Scholar
[16]Kauffman, L. H.. An invariant of regular isotopy. Trans. Amer. Math. Soc. 318 (1990), 417–471.CrossRefGoogle Scholar
[17]Kauffman, L. H.. A Tutte polynomial for signed graphs. Discrete Appl. Math. 25 (1989), 105–127.CrossRefGoogle Scholar
[18]Lickorish, W. B. R.. Polynomials for links. Bull. London Math. Soc. 20 (1988), 558–588.CrossRefGoogle Scholar
[19]Lickorish, W. B. R. and Thistlethwaite, M. B.. Some links with non-trivial polynomials and their crossing numbers. Comment. Math. Helv. 63 (1988), 527–539.CrossRefGoogle Scholar
[20]Murasugi, K.. Jones polynomials and classical conjectures in knot theory. Topology 26 (1987), 187–194.CrossRefGoogle Scholar
[21]Murasugi, K.. On invariants of graphs with applications to knot theory. Trans. Amer. Math. Soc. 314 (1989), 1–49.CrossRefGoogle Scholar
[22]Oxley, J. G. and Welsh, D. J. A.. The Tutte polynomial and percolation. In Graph Theory and Belated Topics (editors Bondy, J. A. and Murty, U. S. R.), (Academic Press, 1979), pp. 329–339.Google Scholar
[23]Reidemeistek, K.. Homotopieringe und Linsenräume. Abh. Math. Sem. Univ. Hamburg 2 (1935), 102–109.CrossRefGoogle Scholar
[24]Robertson, N., Seymour, P. D. and Thomas, R.. Sachs' linkless embedding conjecture. J. Combin. Theory Ser. B, to be submitted.Google Scholar
[25]Rosenstiehl, P. and Read, R. C.. On the principal edge tripartition of a graph. Ann. Discrete Math. 3 (1978), 195–226.CrossRefGoogle Scholar
[26]Sachs, H.. On spatial representations of finite graphs. Colloq. Math. Soc. János Bolyai 37 (1981), 649–662.Google Scholar
[27]Tait, P. G.. On Knots I, II, III. In Scientific Papers, vol. 1 (Cambridge University Press, 1898), pp. 273–347.Google Scholar
[28]Thistlethwaite, M. B.. Knot tabulations and related topics. In Aspects of Topology (editors James, I. M. and Kronheimer, E. H.), (Cambridge University Press, 1985), pp. 1–76.Google Scholar
[29]Thistlethwaite, M. B.. A spanning tree expansion of the Jones polynomial. Topology 26 (1987), 297–309.CrossRefGoogle Scholar
[30]Thistlethwaite, M. B.. On the Kauffman polynomial of an adequate link. Invent. Math. 93 (1988), 285–296.CrossRefGoogle Scholar
[31]Traldi, L.. A dichromatic polynomial for weighted graphs and link polynomials. Proc. Amer. Math. Soc. 106 (1989), 279–286.CrossRefGoogle Scholar
[32]Tutte, W. T.. A contribution to the theory of chromatic polynomials. Canad. J. Math. 6 (1954), 80–91.CrossRefGoogle Scholar
[33]Tutte, W. T.. Graph Theory (Addison Wesley, 1984).Google Scholar
[34]Walton, P. N. and Welsh, D. J. A.. On the chromatic number of binary matroids. Mathematika 27 (1980), 1–9.CrossRefGoogle Scholar
[35]Welsh, D. J. A.. Matroid Theory. London Math. Soc. Monograph no. 8 (Academic Press, 1976).Google Scholar
[36]Welsh, D. J. A.. The computational complexity of some classical problems from statistical physics. In Disorder in Physical Systems (editors Grimmett, G. R. and Welsh, D. J. A.), (Oxford University Press, 1990), pp. 307–321.Google Scholar
[37]Welsh, D. J. A.. Knots and braids; some algorithmic questions. Contemp. Math. (1992), to appear.Google Scholar
[38]Zaslavsky, T.. Strong Tutte functions of matroids and graphs. Trans. Amer. Math. Soc. (1992), to appear.CrossRefGoogle Scholar