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

    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.


    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]
    Fundings :
      Source : OpenAIRE Research 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 data

    Source : ScholeXplorer IsReferencedBy DOI 10.1007/s00220-017-2993-8
    • 10.1007/s00220-017-2993-8
    • 10.1007/s00220-017-2993-8
    • 10.1007/s00220-017-2993-8
    Beyond Aztec Castles: Toric Cascades in the dP 3 Quiver
    Lai, Tri ; Musiker, Gregg ;

    1 Document citing this article

    Share

    Consultation statistics

    This page has been seen 138 times.
    This article's PDF has been downloaded 200 times.