Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4666773 | Advances in Mathematics | 2011 | 27 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Mathematics (General)