A Penrose polynomial for embedded graphs

Details A Penrose polynomial for embedded graphs A Penrose polynomial for embedded graphs

2011-06-26

arxiv.org/abs/1106.5279v1

Mathematics

Combinatorics

Scientific paper

We extend the Penrose polynomial, originally defined only for plane graphs, to graphs embedded in arbitrary surfaces. Considering this Penrose polynomial of embedded graphs leads to new identities and relations for the Penrose polynomial which can not be realized within the class of plane graphs. In particular, by exploiting connections with the transition polynomial and the ribbon group action, we find a deletion-contraction-type relation for the Penrose polynomial. We relate the Penrose polynomial of an orientable checkerboard colourable graph to the circuit partition polynomial of its medial graph and use this to find new combinatorial interpretations of the Penrose polynomial. We also show that the Penrose polynomial of a plane graph G can be expressed as a sum of chromatic polynomials of twisted duals of G. This allows us to obtain a new reformulation of the Four Colour Theorem.

Affiliated with

Also associated with

No associations

Rating

A Penrose polynomial for embedded graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Penrose polynomial for embedded graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Penrose polynomial for embedded graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-637795