The Pentagram Integrals on Inscribed Polygons
classification
🧮 math.CO
math.AG
keywords
pentagrampolynomialscomputerinscribedintegralsprojectiveclassescombinatorial
read the original abstract
The pentagram map is a natural iteration on projective equivalence classes of (twisted) n-gons in the projective plane. It was recently proved ([OST]) that the pentagram map is completely integrable, with the complete set of Poisson commuting integrals given by the polynomials O1,...,O[n/2],On and E1,...,E[n/2],En, previously constructed in [S3]. These polynomials are somewhat reminiscent of the symmetric polynomials. It was observed in computer experiments that if a polygon is inscribed into a conic then Oi=Ei for all i. The goal of the paper is to prove this theorem. The proof is combinatorial, and it was also suggested by computer experimentation.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.