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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
