Abstract
This paper studies the pentagram map, a projectively natural iteration on the space of polygons. Inspired by a method from the theory of ordinary differential equations, the paper constructs roughly n algebraically independent invariants for the map, when it is defined on the space of n-gons. These invariants strongly suggest that the pentagram map is a discrete completely integrable system. The paper also relates the pentagram map to Dodgson’s method of condensation for computing determinants, also known as the octahedral recurrence.
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.
