相关论文: The limit point of the pentagram map

The pentagram map takes a planar polygon $P$ to a polygon $P'$ whose vertices are the intersection points of consecutive shortest diagonals of $P$. The orbit of a convex polygon under this map is a sequence of polygons which converges…

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, 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…

We define polygonal dynamics as a family of dynamical systems acting on points in projective spaces. The most famous example is the pentagram map. Similar collapsing phenomena seem to occur in most of these systems. We prove it in some…

The pentagram map has been studied in a series of papers by Schwartz and others. Schwartz showed that an axis-aligned polygon collapses to a point under a predictable number of iterations of the pentagram map. Glick gave a different proof…

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…

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

The pentagram map, introduced by R. Schwartz, is a birational map on the configuration space of polygons in the projective plane. We study the singularities of the iterates of the pentagram map. We show that a "typical" singularity…

The pentagram map takes a planar polygon $P$ to a polygon $P'$ whose vertices are the intersection points of consecutive shortest diagonals of $P$. This map is known to interact nicely with Poncelet polygons, i.e. polygons which are…

We provide a rigorous treatment of continuous limits for various generalizations of the pentagram map on polygons in $\mathbb{RP}^d$ by means of quantum calculus. Describing this limit in detail for the case of the short-diagonal pentagram…

This paper considers a simple geometric construction, called the Pentagram map. The pentagram map, performed on N-gons, gives rise to a birational mapping on the space of all N-gons. This paper finds what conjecturally are all the…

The pentagram map on polygons in the projective plane was introduced by R. Schwartz in 1992 and is by now one of the most popular and classical discrete integrable systems. In the present paper we introduce and prove integrability of…

We extend the definition of the pentagram map from 2D to higher dimensions and describe its integrability properties for both closed and twisted polygons by presenting its Lax form. The corresponding continuous limit of the pentagram map in…

The pentagram map is a discrete integrable system on the moduli space of planar polygons. The corresponding first integrals are so-called monodromy invariants $E_1, O_1, E_2, O_2,\dots$ By analyzing the combinatorics of these invariants,…

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…

Given an iterated function system of affine dilations with fixed points the vertices of a regular polygon, we characterize which points in the limit set lie on the boundary of its convex hull.

In a series of three papers we develop an end space theory for directed graphs. As for undirected graphs, the ends of a digraph are points at infinity to which its rays converge. Unlike for undirected graphs, some ends are joined by limit…

A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most \pi. We can thus talk about the convexity of a set of points in terms of the…

Skew pentagram maps act on polygons by intersecting diagonals of different lengths. They were introduced by Khesin-Soloviev in 2015 as conjecturally non-integrable generalizations of the pentagram map, a well-known integrable system. In…

A Lorenz map is a Poincar\'e map for a three-dimensional Lorenz flow. We describe the theory of renormalization for Lorenz maps with a critical point and prove that a restriction of the renormalization operator acting on such maps has a…