English
Related papers

Related papers: A Textbook Case of Pentagram Rigidity

200 papers

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

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…

Metric Geometry · Mathematics 2007-09-11 Richard Evan Schwartz

In the projective plane over a finite field of characteristic not equal to 2, we compute the probability that a randomly selected pair of distinct conics $(\mathscr{A},\mathscr{B})$, with $\mathscr{A}$ smooth or singular and $\mathscr{B}$…

Algebraic Geometry · Mathematics 2026-03-17 Milena Radnović , Ruzzel Ragas

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…

Exactly Solvable and Integrable Systems · Physics 2022-02-14 Anton Izosimov

We prove a topological rigidity result for simple, thick, hyperbolic P-manifolds of dimension 2: isomorphism of the fundamental groups implies homeomorphism of the P-manifolds. An immediate application is a diagram rigidity theorem for…

Group Theory · Mathematics 2007-05-23 J. -F. Lafont

We explore the rigidity of generic frameworks in 3-dimensions whose underlying graph is close to being planar. Specifically we consider apex graphs, edge-apex graphs and their variants and prove independence results in the generic…

Combinatorics · Mathematics 2024-02-28 Sean Dewar , Georg Grasegger , Eleftherios Kastis , Anthony Nixon , Brigitte Servatius

We consider polynomial approximations of z-bar to better understand the torsional rigidity of polygons. Our main focus is on low degree approximations and associated extremal problems that are analogous to Polya's conjecture for torsional…

Classical Analysis and ODEs · Mathematics 2024-11-13 Adam Kraus , Brian Simanek

A central question in dynamics is whether the topology of a system determines its geometry. This is known as rigidity. Under mild topological conditions rigidity holds for many classical cases, including: Kleinian groups, circle…

Dynamical Systems · Mathematics 2018-05-04 Marco Martens , Liviana Palmisano , Björn Winckler

A topological condition is given, characterizing which closed manifolds in dimensions < 8 (and conjecturally in general) admit symplectic structures. The condition is the existence of a certain fibration-like structure called a hyperpencil.…

Symplectic Geometry · Mathematics 2007-05-23 Robert E. Gompf

We study rigidity of rational maps that come from Newton's root finding method for polynomials of arbitrary degrees. We establish dynamical rigidity of these maps: each point in the Julia set of a Newton map is either rigid (i.e. its orbit…

Dynamical Systems · Mathematics 2020-10-27 Kostiantyn Drach , Dierk Schleicher

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

We conjecture that a convex polytope is uniquely determined up to isometry by its edge-graph, edge lengths and the collection of distances of its vertices to some arbitrary interior point, across all dimensions and all combinatorial types.…

Combinatorics · Mathematics 2024-01-09 Martin Winter

A family of closed manifolds is called cohomologically rigid if a cohomology ring isomorphism implies a diffeomorphism for any two manifolds in the family. We establish cohomological rigidity for large families of 3-dimensional and…

Algebraic Topology · Mathematics 2017-07-25 Victor Buchstaber , Nikolay Erokhovets , Mikiya Masuda , Taras Panov , Seonjeong Park

We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…

Combinatorics · Mathematics 2013-11-27 Pavel Kozhevnikov

Poncelet maps are circle maps constructed geometrically for a pair of nested ellipses; they are related to the classic billiard map on an elliptical domain when the orbit has an elliptical caustic. Here we show how the rotation number of…

Dynamical Systems · Mathematics 2023-09-18 H. E. Lomeli , J. D. Meiss

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

Let $\pi$ be a group satisfying the Farrell-Jones conjecture and assume that $B\pi$ is a 4-dimensional Poincar\'e duality space. We consider topological, closed, connected manifolds with fundamental group $\pi$ whose canonical map to $B\pi$…

Geometric Topology · Mathematics 2023-04-13 Daniel Kasprowski , Markus Land

We prove entropy rigidity for finite volume strictly convex projective manifolds in dimensions $\geq 3$, generalizing the work of arXiv:1708.03983 to the finite volume setting. The rigidity theorem uses the techniques of Besson, Courtois,…

Differential Geometry · Mathematics 2020-06-25 Harrison Bray , David Constantine

Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is "as convex as possible", given its topological constraints. For a simplicial complex, deciding tightness has a straightforward exponential time…

Computational Geometry · Computer Science 2018-10-24 Bhaskar Bagchi , Benjamin A. Burton , Basudeb Datta , Nitin Singh , Jonathan Spreer

An n-gon is defined as a sequence \P=(V_0,...,V_{n-1}) of n points on the plane. An n-gon \P is said to be convex if the boundary of the convex hull of the set {V_0,...,V_{n-1}} of the vertices of \P coincides with the union of the edges…

Computational Geometry · Computer Science 2007-05-23 Iosif Pinelis
‹ Prev 1 2 3 10 Next ›