Discrete Mathematics & Theoretical Computer Science |

- 1 Department of Mathematics - University of Michigan

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.

Source: HAL:hal-01215101v1

Volume: DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)

Section: Proceedings

Published on: January 1, 2011

Imported on: January 31, 2017

Keywords: pentagram map,cluster algebra,Y-pattern,alternating sign matrix,[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

Funding:

- Source : OpenAIRE Graph
*EMSW21-RTG: Developing American Research Leadership in Algebraic Geometry and its Boundaries*; Funder: National Science Foundation; Code: 0943832*Algebraic Combinatorics*; Funder: National Science Foundation; Code: 0555880

This page has been seen 190 times.

This article's PDF has been downloaded 245 times.