THE POLE DIAGRAM AND THE MIYAZAWA POLYNOMIAL

Abstract

We introduce the pole diagram, which helps to retrieve information from a knot diagram when we smooth crossings. By using the notion, we define a bracket polynomial for the Miyazawa polynomial. The bracket polynomial gives a simple definition and evaluation for the Miyazawa polynomial. Then we show that the virtual crossing number of a virtualized alternating link is determined by its diagram. Furthermore, we construct infinitely many virtual link diagrams which attain the minimal real and virtual crossing numbers together.