The pentagram map and Y-patterns
classification
🧮 math.CO
math.MG
keywords
pentagrampolygonalgebrasclusterconstructiondefineddiagonalsdraw
read the original abstract
The pentagram map, introduced by R. Schwartz, is defined by the following construction: given a polygon as input, draw all of its "shortest" diagonals, and output the smaller polygon which they cut out. We employ the machinery of cluster algebras to obtain explicit formulas for the iterates of the pentagram map.
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.