Pentagram rigidity conjecture for convex Poncelet polygons

A convex Poncelet polygon is a polygon in the projective plane whose vertices lie on one conic and whose edges are tangent to another conic; convexity means convexity in an affine patch. Let (n,k)(n,k) be relatively prime integers with n7n\geq 7 and k(2,n/2)k\in(2,n/2). For a convex nn-gon P0P_0, define its kk-diagonal orbit by Pj=Tkj(P0)P_j=T_k^j(P_0), where TkT_k maps an nn-gon to the nn-gon formed by the successive intersections of its kk-diagonals. Pentagram Rigidity Conjecture. P0P_0 is convex Poncelet if and only if PjP_j is convex for every jZj\in\mathbb{Z}.

This conjecture characterizes convex Poncelet polygons by the preservation of convexity along the entire deep-diagonal orbit. The forward implication is known because Poncelet polygons are projectively equivalent to their images under TkT_k; the converse is the conjectural rigidity statement, with this paper establishing a special case.

Sources & referencesView supporting material

Primary source

Richard Evan Schwartz, “Pentagram Rigidity for Centrally Symmetric Octagons”, arXiv:2111.08358 (2024).

Additional references

2 papers in this index state this conjecture (2021). The statement above is taken from the most recent of them; the others are arXiv:2108.07604.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.