 |
Discrete Mathematics & Theoretical Computer Science |
Max Glick ; Pavlo Pylyavskyy - $Y$ -meshes and generalized pentagram maps
dmtcs:2520 - Discrete Mathematics & Theoretical Computer Science, January 1, 2015, DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015) - https://doi.org/10.46298/dmtcs.2520$Y$ -meshes and generalized pentagram mapsArticle
Authors: Max Glick 1; Pavlo Pylyavskyy 
1
- 1 School of Mathematics
We introduce a rich family of generalizations of the pentagram map sharing the property that each generates an infinite configuration of points and lines with four points on each line. These systems all have a description as $Y$ -mutations in a cluster algebra and hence establish new connections between cluster theory and projective geometry.
Source: HAL:hal-01337830v1
Volume: DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015)
Section: Proceedings
Published on: January 1, 2015
Imported on: November 21, 2016
Keywords: pentagram map,discrete dynamical systems,cluster algebras,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
Funding:
- Source : OpenAIRE Graph
- RTG in Combinatorics; Funder: National Science Foundation; Code: 1148634
- Some questions in total positivity and cluster algebras; Funder: National Science Foundation; Code: 1068169
- PostDoctoral Research Fellowship; Funder: National Science Foundation; Code: 1303482
- CAREER: Algebraic Combinatorics and URE; Funder: National Science Foundation; Code: 1351590
10 Documents citing this article
Consultation statistics
This page has been seen 244 times.
This article's PDF has been downloaded 321 times.