Abstract
We supplement the definition of principal nest, introduced by M. Lyubich, with a system of frames that makes possible the classification of combinatorial types for every level of the nest. As a consequence, we give necessary and sufficient conditions for the admissibility of a type and prove that given a sequence of finite admissible types, there is a quadratic polynomial whose nest realizes the sequence.
Sign-in/Register to access full text options 
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.
