Extremal monotonicity conjecture for the side length function of regular polygon stars

Let PnP_n be a regular polygon with nn sides, let s2l+1s_{2l+1} denote the side length function for inscribed (2l+1)(2l+1)-pointed stars, and call a point of PnP_n a midpoint crossing or vertex crossing according to whether the corresponding star has a midpoint coincidence or a vertex coincidence. For n4l+2n\ge 4l+2, Extremal monotonicity conjecture. Every midpoint crossing of PnP_n is a global minimum of s2l+1s_{2l+1}, every vertex crossing is a global maximum, midpoint and vertex crossings are interleaved around PnP_n, and s2l+1s_{2l+1} is strictly monotonic between adjacent midpoint and vertex crossings. This would strengthen the preceding partial characterization, which establishes that crossings are local extrema and that all crossings of each type have a common value; the conjectured global ordering and strict monotonicity remain unproved in the supplied text.

Sources & referencesView supporting material

Primary source

Henry Adams, Samir Chowdhury, Adam Quinn Jaffe and Bonginkosi Sibanda, “Vietoris-Rips Complexes of Regular Polygons”, arXiv:1807.10971 (2018).

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.