English
Related papers

Related papers: Long-diagonal pentagram maps

200 papers

We define higher pentagram maps on polygons in $P^d$ for any dimension $d$, which extend R.Schwartz's definition of the 2D pentagram map. We prove their integrability by presenting Lax representations with a spectral parameter for scale…

Dynamical Systems · Mathematics 2015-03-20 Boris Khesin , Fedor Soloviev

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…

Dynamical Systems · Mathematics 2012-05-17 Boris Khesin , Fedor Soloviev

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…

Algebraic Geometry · Mathematics 2019-10-30 Fedor Soloviev

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

Exactly Solvable and Integrable Systems · Physics 2025-09-29 Leaha Hand , Anton Izosimov

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…

Dynamical Systems · Mathematics 2023-01-27 Max H. Weinreich

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…

Dynamical Systems · Mathematics 2021-06-17 Danny Nackan , Romain Speciel

We propose a new family of natural generalizations of the pentagram map from 2D to higher dimensions and prove their integrability on generic twisted and closed polygons. In dimension $d$ there are $d-1$ such generalizations called dented…

Dynamical Systems · Mathematics 2014-12-09 Boris Khesin , Fedor Soloviev

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…

Dynamical Systems · Mathematics 2019-12-19 Valentin Ovsienko , Richard Evan Schwartz , Serge Tabachnikov

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…

Exactly Solvable and Integrable Systems · Physics 2022-05-10 Anton Izosimov

The pentagram map is a discrete dynamical system defined on the space of polygons in the plane. In the first paper on the subject, R. Schwartz proved that the pentagram map produces from each convex polygon a sequence of successively…

Dynamical Systems · Mathematics 2017-07-11 Max Glick

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…

Quantum Algebra · Mathematics 2016-05-19 Michael Gekhtman , Michael Shapiro , Serge Tabachnikov , Alek Vainshtein

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…

Quantum Algebra · Mathematics 2019-02-05 Nicholas Ovenhouse

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

Exactly Solvable and Integrable Systems · Physics 2016-10-03 Anton Izosimov

We revisit recent results on integrable cases for higher-dimensional generalizations of the 2D pentagram map: short-diagonal, dented, deep-dented, and corrugated versions, and define a universal class of pentagram maps, which are proved to…

Dynamical Systems · Mathematics 2015-06-19 Boris Khesin , Fedor Soloviev

In this paper I will establish a special case of a conjecture that intertwines the deep diagonal pentagram maps and Poncelet polygons. The special case is that of the 3-diagonal map acting on affine equivalence classes of centrally…

Symplectic Geometry · Mathematics 2024-01-17 Richard Evan Schwartz

The pentagram map is a natural iteration on projective equivalence classes of (twisted) n-gons in the projective plane. It was recently proved ([OST]) that the pentagram map is completely integrable, with the complete set of Poisson…

Combinatorics · Mathematics 2010-04-27 Richard Evan Schwartz , Serge Tabachnikov

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…

Dynamical Systems · Mathematics 2025-12-12 Max Weinreich

The pentagram map was introduced by R. Schwartz more than 20 years ago. In 2009, V. Ovsienko, R. Schwartz and S. Tabachnikov established Liouville complete integrability of this discrete dynamical system. In 2011, M. Glick interpreted the…

Dynamical Systems · Mathematics 2017-10-25 Michael Gekhtman , Michael Shapiro , Serge Tabachnikov , Alek Vainshtein

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

Dynamical Systems · Mathematics 2018-08-02 Quang-Nhat Le

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…

Combinatorics · Mathematics 2011-04-18 Max Glick
‹ Prev 1 2 3 10 Next ›