Abstract
For the description of extremal polynomials (that is, the typical solutions of least deviation problems) one uses real hyperelliptic curves. A partitioning of the moduli space of such curves into cells enumerated by trees is considered. As an application of these techniques the range of the period map of the universal cover of the moduli space is explicitly calculated. In addition, extremal polynomials are enumerated by weighted graphs.
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.
