Tutte-Whitney Polynomials: Some History and Generalizations

Combinatorics, Complexity, and Chance: A Tribute to Dominic Welsh

Volumn , Issue , 2007, Pages

  Farr, Graham E ^a  

^a MONASH UNIVERSITY   (Australia)

Author keywords

Binary functions; Binary matroids; Counting; Sets; Tutte whitney polynomials; Univariate polynomials

Indexed keywords

EID: 84920753555     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1093/acprof:oso/9780198571278.003.0003     Document Type: Chapter

References (89)

1. F. Ardila, The Tutte polynomial of a hyperplane arrangement (extended abstract), in 14th International Conference on Formal Power Series and Algebraic Combinatorics (University of Melbourne, 8-12 July 2002), http:// www.i3s.unice.fr/fpsac/FPSAC02/ARTICLES/Ardila.pdf
2. F. Ardila Computing the Tutte polynomial of a hyperplane arrangement, Pacific J. Math., to appear.
3. F. Ardila, Semimatroids and their Tutte polynomials, submitted.
4. J. Ashkin and E. Teller, Statistics of two-dimensional lattices with four components, Phys. Rev. 64 (1943) 178-184.
5. A. Barg, The matroid of supports of a linear code, Appl. Algebra Engrg. Comm. Comput. 8 (1997) 165-172.
6. N. L. Biggs, Algebraic Graph Theory (2nd edn.), Cambridge University Press (1993).
7. G. D. Birkhoff, A determinant formula for the number of ways of coloring a map, Ann. of Math. (2) 14 (1912/13) 42-46.
8. B. BollobÁs and O. Riordan, A Tutte polynomial for coloured graphs, Combin. Probab. Comput. 8 (1999) 45-93.
9. L. Borzacchini, Subgraph enumerating polynomial and reconstruction conjecture, Rend. Accad. Sci. Fis. Mat. Napoli (4) 43 (1976/77) 411-416.
10. L. Borzacchini Reconstruction theorems for graph enumerating polynomials, Calcolo 18 (1981) 97-101.
11. L. Borzacchini and C. Pulito, On subgraph enumerating polynomials and Tutte polynomials, Boll. Un. Mat. Ital. B (6) 1 (1982) 589-597.
12. T. Britz, MacWilliams identities and matroid polynomials, Electron. J. Combin. 9 (2002) #R19.
13. T. H. Brylawski, A decomposition for combinatorial geometries, Trans. Amer. Math. Soc. 171 (1972) 235-282.
14. T. H. Brylawski, The Tutte-Grothendieck ring, Algebra Universalis 2 (1972) 375-388.
15. T. H. Brylawski and J. G. Oxley, The Tutte polynomial and its applications, in Matroid Applications (N. White, ed.), Encyclopedia Math. Appl. 40, Cambridge University Press (1992) pp. 123-225.
16. P. J. Cameron, Orbit counting and the Tutte polynomial, this volume.
17. L. Chayes and J. Machta, Graphical representation and cluster algorithms. I. Discrete spin systems, Physica A 239 (1997) 542-601.
18. H. Crapo, A higher invariant for matroids, J. Combin. Theory 2 (1967) 406-417.
19. H. Crapo MÖbius inversion in lattices, Arch. Math. 19 (1968) 595-607.
20. H. Crapo, The Tutte polynomial, Aequationes Math. 3 (1969) 211-229.
21. J. A. Ellis-Monaghan and L. Traldi, Parametrized Tutte polynomials of weighted graphs and matroids, Combin. Probab. Comput., to appear.
22. G. E. Farr, A generalization of the Whitney rank generating function, Math. Proc. Camb. Phil. Soc. 113 (1993) 267-280.
23. G. E. Farr, Some results on generalised Whitney functions, Adv. in Appl. Math. 32 (2004) 239-262.
24. G. E. Farr, On the Ashkin-Teller model and Tutte-Whitney functions, Combin. Probab. Comput., to appear.
25. C. M. Fortuin and P. W. Kasteleyn, On the random cluster model. I. Introduction and relation to other models, Physica 57 (1972) 536-564.
26. C. Godsil and G. Royle, Algebraic Graph Theory, Springer, New York, (2001).
27. A. Goodall, Fourier analysis on finite Abelian groups: some graphical applications, this volume.
28. G. Gordon and E. McMahon, A greedoid polynomial which distinguishes rooted arborescences, Proc. Amer. Math. Soc. 107 (1989) 287-298.
29. C. Greene Weight enumeration and the geometry of linear codes, Stud. Appl. Math. 55 (1976) 119-128.
30. G. R. Grimmett, The random-cluster model, in Probability on Discrete Structures (H. Kesten, ed.), Encyclopaedia of Mathematical Sciences 110, Springer, Berlin (2004) pp. 73-123.
31. B. Grünbaum, Convex Polytopes, Wiley, New York (1967).
32. A. M. Hobbs and J. G. Oxley, William T. Tutte (1917-2002), Notices Amer. Math. Soc. 51 (2004) 320-330.
33. F. Jaeger D. L. Vertigan, and D. J. A. Welsh, On the computational complexity of the Jones and Tutte polynomials, Math. Proc. Camb. Phil. Soc. 108 (1990) 35-53.
34. M. R. Jerrum Approximating the Tutte polynomial, in this volume.
35. P. W. Kasteleyn and C. M. Fortuin, Phase transitions in lattice systems with local properties, J. Phys. Soc. Japan Suppl. 26 (1969) 11-14.
36. J. P. S. Kung, An Erlanger Problem for Combinatorial Geometries, Ph.D. thesis, MIT, Cambridge, MA. (1978).
37. J. P. S. Kung, The Rédei function of a relation, J. Combin. Theory Ser. A 29 (1980) 287-296.
38. J. P. S. Kung, Critical problems, in Matroid Theory (J. E. Bonin, J. G. Oxley, and B. Servatius, eds.), (Seattle, 2/6 July 1995), Contemp. Math. 197, Amer. Math. Soc., Providence, RI (1996) pp. 1-127.
39. J. P. S. Kung, Twelve views of matroid theory, in Combinatorial and Computational Mathematics (S. Hong, J. H. Kwah, K. H. Kim, and F. W. Roush, eds.), (Pohang, 15/17 Feb. 2000), World Sci. Publishing, River Edge, NJ (2001) pp. 56-96.
40. J. P. S. Kung, A Tutte decomposition for matrices and bimatroids, J. Combin. Theory Ser. B 96 (2006) 50-66.
41. J. P. S. Kung, M. Noy, and D. Welsh (eds.), Special Issue on the Tutte Polynomial, Adv. in Appl. Math. 32 (2004) nos 1-2.
42. M. Las Vergnas, The Tutte polynomial of a morphism of matroids. I. Setpointed matroids and matroid perspectives, Ann. Inst. Fourier (Grenoble) 49 (1999) 973-1015.
43. F. J. MacWilliams, A theorem on the distribution of weights in a systematic code, Bell System Tech. J. 42 (1963) 79-94.
44. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam (1977).
45. K. Murasugi On invariants of graphs with applications to knot theory, Trans. Amer. Math. Soc. 314 (1989) 1-49.
46. S. D. Noble Evaluating the rank generating function of a graphic 2- polymatroid, Combin. Probab. Comput. 15 (2006) 449-461.
47. S. D. Noble Complexity of graph polynomials, this volume.
48. S. D. Noble and D. J. A. Welsh, A weighted graph polynomial from chromatic invariants of knots, Symposium à la Mémoire de François Jaeger (Grenoble, 1998), Ann. Inst. Fourier (Grenoble) 49 (1999) 1057-1087.
49. J. G. Oxley, Matroid Theory, Oxford University Press, New York (1992).
50. J. G. Oxley, The contributions of Dominic Welsh to matroid theory, this volume.
51. J. G. Oxley and D. J. A. Welsh, The Tutte polynomial and percolation, in Graph Theory and Related Topics (J. A. Bondy, and U. S. R. Murty, eds.), Academic Press, New York (1979) pp. 329-339.
52. J. G. Oxley and D. J. A. Welsh, On some percolation results of J. M. Hammersley, J. Appl. Prob. 16 (1979) 526-540.
53. J. G. Oxley and D. J. A. Welsh, Chromatic, flow and reliability polynomials: the complexity of their coefficients, Combin. Probab. Comput. 11 (2002) 403-426.
54. J. G. Oxley and G. P. Whittle, Tutte invariants for -polymatroids, in Graph Structure Theory (N. Robertson and P. D. Seymour, eds.), (Seattle, 1991), Contemp. Math. 147, Amer. Math. Soc., Providence, RI (1993) pp. 9-19.
55. J. G. Oxley and G. P. Whittle, A characterization of Tutte invariants of - polymatroids, J. Combin. Theory Ser. B 59 (1993) 210-244.
56. C.-E. Pfister and Y. Velenik, Random-cluster representation of the Ashkin-Teller model, J. Statist. Phys. 88 (1997) 1295-1331.
57. R. B. Potts Some generalized order-disorder transformations, Proc. Camb. Phil. Soc. 48 (1952) 106-109.
58. J. Salas and A. D. Sokal, Dynamic critical behavior of a Swendsen-Wangtype algorithm for the Ashkin-Teller model, J. Statist. Phys. 85 (1996) 297-361.
59. C. A. B. Smith, Map colourings and linear mappings, in Combinatorial Mathematics and its Applications (D. J. A. Welsh, ed.), (Proc. Conf., Oxford, 1969), Academic Press, London (1971) pp. 259-283.
60. C. A. B. Smith, On Tutte's dichromate polynomial, Ann. Discrete Math. 3 (1978) 247-257.
61. A. D. Sokal Bounds on the complex zeros of (di)chromatic polynomials and Potts-model partition functions, Combin. Probab. Comput. 10 (2001) 41-77.
62. A. D. Sokal The multivariate Tutte polynomial (alias Potts model) for graphs and matroids, in Surveys in Combinatorics 2005 (B. S. Webb, ed.), London Math. Soc. Lecture Note Series 327, Cambridge University Press (2005) pp. 173-226.
63. R. P. Stanley, Graph colorings and related symmetric functions: ideas and applications: a description of results, interesting applications, & notable open problems, Discrete Math. 193 (1998) 267-286.
64. L. Traldi A dichromatic polynomial for weighted graphs and link polynomials, Proc. Amer. Math. Soc. 106 (1989) 279-286.
65. L. Traldi Generalized activities and K-terminal reliability, Discrete Math. 96 (1991) 131-149.
66. L. Traldi Series and parallel reductions for the Tutte polynomial, Discrete Math. 220 (2000) 291-297.
67. W. T. Tutte, A ring in graph theory, Proc. Camb. Phil. Soc. 43 (1947) 26-40.
68. W. T. Tutte An Algebraic Theory of Graphs, Ph.D. thesis, University of Cambridge (1948).
69. W. T. Tutte A contribution to the theory of chromatic polynomials, Canadian J. Math. 6 (1954) 80-91.
70. W. T. Tutte On dichromatic polynomials, J. Combin. Theory 2 (1967) 301-320.
71. W. T. Tutte Graph-polynomials, Adv. in Appl. Math. 32 (2004) 5-9.
72. D. L. Vertigan and D. J. A. Welsh, The computational complexity of the Tutte plane: the bipartite case, Combin. Probab. Comput. 1 (1992) 181-187.
73. D. J. A. Welsh, Matroid Theory, London Math. Soc. Monograph No. 8, Academic Press, London (1976).
74. D. J. A. Welsh, Complexity: Knots, Colourings and Counting, London Math. Soc. Lecture Note Series 186, Cambridge University Press (1993).
75. D. J. A. Welsh, Randomised approximation in the Tutte plane, Combin. Probab. Comput. 3 (1994) 137-143.
76. D. J. A. Welsh, The computational complexity of knot and matroid polynomials, Discrete Math. 124 (1994) 251-269.
77. D. J. A. Welsh, The random cluster process, Discrete Math. 136 (1994) 373-390.
78. D. J. A. Welsh, Randomised approximation schemes for Tutte-Gröthendieck invariants, in Discrete Probability and Algorithms, (D. Aldous, P. Diaconis, J. Spencer, and J. M. Steele, eds.), (Minneapolis, 1993), Springer, New York (1995) pp. 133-148.
79. D. J. A. Welsh, Counting colourings and flows in random graphs, in Combinatorics: Paul ErdÖs is Eighty, Vol. 2 (D. Miklós, V. T. Sós, and T. SzÖnyi, eds.), (Keszthely, 1993), Bolyai Society Mathematical Studies, 2 János Bolyai Mathematical Society, Budapest (1996) pp. 491-505.
80. D. J. A. Welsh, Percolation and the random cluster model: combinatorial and algorithmic problems, in Probabilistic Methods for Algorithmic Discrete Mathematics, (M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and B. Reed, eds.), Algorithms and Combinatorics 16, Springer, Berlin (1998) pp. 166-194.
81. D. J. A. Welsh, The Tutte polynomial, Random Structures Algorithms 15 (1999) 210-228.
82. D. J. A. Welsh, W. T. (Bill) Tuttein memoriam, Adv. in Appl. Math. 32 (2004) 3-4.
83. D. J. A. Welsh and K. K. Kayibi, A linking polynomial of two matroids, Adv. in Appl. Math. 32 (2004) 391-419.
84. D. J. A. Welsh and G. P. Whittle, Arrangements, channel assignments, and associated polynomials, Adv. in Appl. Math. 23 (1999) 375-406.
85. H. Whitney A logical expansion in mathematics, Bull. Amer. Math. Soc. 38 (1932) 572-579.
86. H. Whitney The coloring of graphs, Ann. of Math. (2) 33 (1932) 688-718.
87. F. Y. Wu C. King and W. T. Lu, On the rooted Tutte polynomial, Symposium à la Mémoire de François Jaeger (Grenoble, 1998), Ann. Inst. Fourier (Grenoble) 49 (1999) 1103-1114.
88. T. Zaslavsky Strong Tutte functions of matroids and graphs, Trans. Amer. Math. Soc. 334 (1992) 317-347.
89. T. Zaslavsky Biased graphs. III. Chromatic and dichromatic invariants, J. Combin. Theory Ser. B 64 (1995) 17-88.