Tischler graphs of critically fixed rational maps and their applications

Abstract

A rational map $f:\widehat{\mathbb{C}}\to\widehat{\mathbb{C}}$ on the Riemann sphere $\widehat{\mathbb{C}}$ is called critically fixed if each critical point of $f$ is fixed under $f$. In this article we study properties of a combinatorial invariant, called Tischler graph, associated with such a map. More precisely, we show that the Tischler graph of a critically fixed rational map is always connected, establishing a conjecture made by Kevin Pilgrim. We also discuss the relevance of this result for classical open problems in holomorphic dynamics, such as combinatorial classification problem and global curve attractor problem.