ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n≥6n\geq 6 be even, and let An∗A_n^* denote the maximal area among all small nn-gons. An optimal nn-gon is a small nn-gon whose area is An∗A_n^*. Its diameter graph is the graph whose vertices are the polygon's vertices, with edges joining pairs at distance equal to the diameter, and a pendant edge is an edge incident to a vertex of degree one. Symmetry conjecture. For even n≥6n\geq 6, an optimal nn-gon has an axis of symmetry corresponding to the pendant edge in its diameter graph. The maximal-area problem for even small polygons is not fully resolved; the conjecture proposes additional symmetry for optimal polygons beyond the known structure of their diameter graphs.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.