Abstract
We find new properties of the topological transition polynomial of embedded graphs, . We use these properties to explain the striking similarities between certain evaluations of Bollobás and Riordan's ribbon graph polynomial, , and the topological Penrose polynomial, . The general framework provided by also leads to several other combinatorial interpretations these polynomials. In particular, we express , , and the Tutte polynomial, , as sums of chromatic polynomials of graphs derived from ; show that these polynomials count -valuations of medial graphs; show that counts edge 3-colourings; and reformulate the Four Colour Theorem in terms of . We conclude with a reduction formula for the transition polynomial of the tensor product of two embedded graphs, showing that it leads to additional relations among these polynomials and to further combinatorial interpretations of and .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.