pith. sign in

arxiv: 1110.0472 · v3 · pith:OHRLNBMOnew · submitted 2011-10-03 · 🧮 math.QA

Higher pentagram maps, weighted directed networks, and cluster dynamics

classification 🧮 math.QA
keywords pentagramintegrablenetworkssystemsclusterdiagonalsdirecteddiscrete
0
0 comments X
read the original abstract

The pentagram map that associates to a projective polygon a new one formed by intersections of short diagonals was introduced by R. Schwartz and was shown to be integrable by V. Ovsienko, R. Schwartz and S. Tabachnikov. Recently, M. Glick demonstrated that the pentagram map can be put into the framework of the theory of cluster algebras. In this paper, we extend and generalize Glick's work by including the pentagram map into a family of discrete completely integrable systems. Our main tool is Poisson geometry of weighted directed networks on surfaces developed by M. Gekhtman, M. Shapiro, and A. Vainshtein. The ingredients necessary for complete integrability -- invariant Poisson brackets, integrals of motion in involution, Lax representation -- are recovered from combinatorics of the networks. Our integrable systems depend on one discrete parameter $k>1$. The case $k=3$ corresponds to the pentagram map. For $k>3$, we give our integrable systems a geometric interpretation as pentagram-like maps involving deeper diagonals. If $k=2$ and the ground field is $\C$, we give a geometric interpretation in terms of circle patterns.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Adaptive Subproblem Selection in Benders Decomposition for Survivable Network Design Problems

    math.OC 2026-04 unverdicted novelty 6.0

    Adaptive multi-criteria scoring with online logistic regression for Benders subproblem selection yields statistically significant runtime and integral improvements on 135 survivable network design instances.