Iterative Roots with Big Graph

Abstract

Let $g:X \rightarrow X$ be a bijection and $n\geq 2$ be a fixed integer. We consider the equation of iterative roots $\varphi ^n(x)=g(x)$ and we look for its solution with big graph: big from the point of view both of topology and measure theory.