Related papers: Integrable cluster dynamics of directed networks a…
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…
The pentagram map was introduced by R. Schwartz in 1992 for convex planar polygons. Recently, V. Ovsienko, R. Schwartz, and S. Tabachnikov proved Liouville integrability of the pentagram map for generic monodromies by providing a Poisson…
The pentagram map is a discrete integrable system first introduced by Schwartz in 1992. It was proved to be intregable by Schwartz, Ovsienko, and Tabachnikov in 2010. Gekhtman, Shapiro, and Vainshtein studied Poisson geometry associated to…
The pentagram map is a projectively natural iteration defined on polygons, and also on objects we call twisted polygons (a twisted polygon is a map from Z into the projective plane that is periodic modulo a projective transformation). We…
The pentagram map, introduced by Schwartz in 1992, is a dynamical system on the moduli space of polygons in the projective plane. Its real and complex dynamics have been explored in detail. We study the pentagram map over an arbitrary…
We introduce twisted triple crossing diagram maps, collections of points in projective space associated to bipartite graphs on the cylinder, and use them to provide geometric realizations of the cluster integrable systems of Goncharov and…
The pentagram map was introduced by R. Schwartz in 1992 and is now one of the most renowned discrete integrable systems. In the present paper we prove that this map, as well as all its known integrable multidimensional generalizations, can…
We consider nonlinear recurrences generated from cluster mutations applied to quivers that have the property of being cluster mutation-periodic with period 1. Such quivers were completely classified by Fordy and Marsh, who characterised…
The pentagram map is a discrete dynamical system on planar polygons. By definition, the image of a polygon $P$ under the pentagram map is the polygon $P'$ whose vertices are the intersection points of consecutive shortest diagonals of $P$.…
The pentagram map is a discrete dynamical system defined on the moduli space of polygons in the projective plane. This map has recently attracted a considerable interest, mostly because its connection to a number of different domains, such…
Cluster algebras are a class of commutative algebras whose generators are defined by a recursive process called mutation. We give a brief introduction to cluster algebras, and explain how discrete integrable systems can appear in the…
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…
We consider a class of complex manifolds constructed as multiplicative quiver varieties associated with a cyclic quiver extended by an arbitrary number of arrows starting at a new vertex. Such varieties admit a Poisson structure, which is…
One of the remarkable properties of cluster algebras is that any cluster, obtained from a sequence of mutations from an initial cluster, can be written as a Laurent polynomial in the initial cluster (known as the "Laurent phenomenon").…
The pentagram map was invented by Richard Schwartz in his search for a projective-geometric analogue of the midpoint map. It turns out that the dynamical behavior of the pentagram map is totally different from that of the midpoint map.…
We consider a class of map, recently derived in the context of cluster mutation. In this paper we start with a brief review of the quiver context, but then move onto a discussion of a related Poisson bracket, along with the Poisson algebra…
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…
The pentagram map is a projectively natural iteration defined on polygons, and also on a generalized notion of a polygon which we call {\it twisted polygons}. In this note we describe our recent work on the pentagram map, in which we find a…
It is known that there is a one-to-one mapping between oriented directed graphs and zero-sum replicator dynamics (Lotka-Volterra equations) and that furthermore these dynamics are Hamiltonian in an appropriately defined nonlinear Poisson…
We discuss the relation between the cluster integrable systems and $q$-difference Painlev\'e equations. The Newton polygons corresponding to these integrable systems are all 16 convex polygons with a single interior point. The Painlev\'e…