Polynomial invariants for trees. A statistical mechanics approach
This paper defines two distinct ways of relating polynomial invariants of trees. Starting from a root point any point of the tree can be reached by successive steps and each step is associated with a recurrence relation---the procedure being analogous to that for defining braids and knots. The work is compared with \textit{W. T. Tutte}'s result in [Can. J. Math. 6, 80-91 (1954; Zbl 0055.17101)] that the dichromate polynomial of any graph can be expressed as a sum over weight trees of the graph. Reviewer notes: The important point is that we must order the lines of a graph in some predetermined way, but the final result for the Whitney-Tutte dichromate polynomial alias Potts model generating function is independent of the order in which we list the lines. Some work by the reviewer gives a clue about the reason for this independence.
- A Contribution to the Theory of Chromatic Polynomials
- A Greedoid Polynomial Which Distinguishes Rooted Arborescences
- scientific article; zbMATH DE number 3981831 (Why is no real title available?)
- scientific article; zbMATH DE number 50650 (Why is no real title available?)
- scientific article; zbMATH DE number 3419161 (Why is no real title available?)
- On Ising's model of ferromagnetism
- Relations between the ‘percolation’ and ‘colouring’ problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the ‘percolation’ problem
- Skein quantization of Poisson algebras of loops on surfaces
This page was built for publication: Polynomial invariants for trees. A statistical mechanics approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1382267)
