Related papers: Discrete Monodromy, Pentagrams, and the Method of …

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

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…

In this paper I will explain a rigidity conjecture that intertwines the deep diagonal pentagram maps and Poncelet polygons. I will also establish a simple case of the conjecture, the one involving the $3$-diagonal map on a convex $8$-gon…

We introduce the notion of a combinatorial $n$-od cover, for $n \geq 3$, which is a tool that may be used to show that certain continua embedded in the plane are not simple $n$-od-like. Using this tool, we generalize a classic example of…

In this paper we define a generalization of the pentagram map to a map on twisted polygons in the Grassmannian space Gr(n;mn). We define invariants of Grassmannian twisted polygons under the natural action of SL(nm), invariants that define…

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…

Motivated by a question from V. Arnold about self-dual curves in projective spaces, we study {\cal M}_{m,n,k}: the moduli space of m-self-dual n-gons in {\mathbb P}^k. This paper lays out an explicit construction of self-dual polygons, and…

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…

As one type of incidence theory, the geometry of pentagram map seems quite classical at first. However, this is an excellent example of such a classical idea developed into a marvellous insight by some modern approach. We introduce an…

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…

A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…

Using three different approaches, we analyze the complexity of various birational maps constructed from simple operations (inversions) on square matrices of arbitrary size. The first approach consists in the study of the images of lines,…

The iterative absorption method has recently led to major progress in the area of (hyper-)graph decompositions. Amongst other results, a new proof of the Existence conjecture for combinatorial designs, and some generalizations, was…

Recently, the Dodgson's determinant condensation algorithm was revisited in many papers [College Math. Journal 42(1)(2011): 43--54, College Math. Journal 38(2)(2007): 85--95, Math Horizons 14(2)(2006): 12--15},etc.]. This method is…

A planar graph $G$ is called a pentagulation of an $n$-gon ($n\geq$ is an integer) if all faces of $G$ are pentagons, except one, which is an $n$-gon. A $3$-connected pentagulation $G$ of an $n$-gon is called minimal if it has the smallest…

The graph reconstruction conjecture asserts that every simple graph on at least three vertices is uniquely determined by its deck of vertex-deleted subgraphs. In this expository article we survey the conjecture and present an…

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…