The strut-side perimeter conjecture for convex polygons

About 4 years old · traced to

Let n≥3n\geq 3 and let m∈{1,…,n−1}m\in\{1,\dots,n-1\}. Let PP be a convex polygon with consecutive vertices A1,A2,A3,…,An−1,AnA_1,A_2,A_3,\dots,A_{n-1},A_n. A side is said to have a strut when it satisfies the strut condition used in the preceding results. Suppose that the sides A1A2,A2A3,…,AmAm+1A_1A_2,A_2A_3,\dots,A_mA_{m+1} have struts and that

∣A1A2∣+∣A2A3∣+⋯+∣AmAm+1∣≥1.|A_1A_2|+|A_2A_3|+\cdots+|A_mA_{m+1}|\geq 1.

Strut-side perimeter conjecture. The perimeter L(P)L(P) satisfies

L(P)≥3.L(P)\geq 3.

The statement generalizes the preceding theorem for two adjacent sides and is motivated by examples whose perimeters approach 33.

References

Primary source

Yu. G. Nikonorov and O. Yu. Nikonorova, “Some extremal problems for polygons in the Euclidean plane”, arXiv:2209.05940 (2022).

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.