Max Glick - The pentagram map and Y-patterns

dmtcs:2920 - Discrete Mathematics & Theoretical Computer Science, January 1, 2011, DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011) - https://doi.org/10.46298/dmtcs.2920
The pentagram map and Y-patterns

Authors: Max Glick 1

  • 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.

https://doi.org/10.46298/dmtcs.2920
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
  • Algebraic Combinatorics; Funder: National Science Foundation; Code: 0555880
  • EMSW21-RTG: Developing American Research Leadership in Algebraic Geometry and its Boundaries; Funder: National Science Foundation; Code: 0943832

Linked publications - datasets - softwares

Source : ScholeXplorer IsRelatedTo ARXIV 1511.05535
Source : ScholeXplorer IsRelatedTo DOI 10.37236/5698
Source : ScholeXplorer IsRelatedTo DOI 10.48550/arxiv.1511.05535
  • 1511.05535
  • 10.37236/5698
  • 10.37236/5698
  • 10.48550/arxiv.1511.05535
Solutions to the T-Systems with Principal Coefficients

1 Document citing this article

Share and export

Consultation statistics

This page has been seen 157 times.
This article's PDF has been downloaded 220 times.